HS Verteilte Algorithmen - Literatur/Recherche

[ < zurück ]

Hinweise

Allgemeine Recherche

Vorlesungen anderer Universitäten

Bücher

Original-Veröffentlichungen

BibTeX-Datenbank: va-lit.bib

Autor(en) Titel Jahr Datei
Peer-to-Peer
  Freenet 1.4 Protocol, rev 00002    r4proto.txt 
Antony Rowstron and Peter Druschel  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems  2001  pastry.pdf 
Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker  A Scalable Content Addressable Network  2001  p13-ratnasamy.pdf 
Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong  Freenet: A Distributed Anonymous Information Storage and Retrieval System  2001  icsi-revised.ps.gz 
Ian Clarke, Theodore W. Hong, Scott G. Miller, Oskar Sandberg,Brandon Wiley  Protecting Free Expression Online with Freenet  2002  ieee-final.pdf 
DSS-Group  The Gnutella Protocol Specification v0.4    gnutella_protocol_0.4.pdf 
Ion Stoica and Robert Morris and David Karger and M. Frans Kaashoek and Hari Balakrishnan  Chord: A scalable peer-to-peer lookup service for internet applications  2001  chord_sigcomm.pdf 
Einigung
Christian Cachin and Klaus Kursawe and Victor Shoup  Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract)  2000  cachin00random.ps 
Christian Cachin and Jonathan A. Poritz  Secure intrusion-tolerant replication on the Internet  2002  cachin02secure.pdf 
Michael Backes and Christian Cachin  Reliable broadcast in a computational hybrid model with Byzantine faults, crashes, and recoveries  2002  backes02hybrid.pdf 
Christian Cachin and Klaus Kursaw and Frank Petzold and Victor Shoup  Secure and Efficient Asynchronous Broadcast Protocols  2001  cachin01secure.pdf 
M. Castro and B. Liskov  A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm  1999  castro99correctness.ps.gz 
Miguel Castro  Practical Byzantine Fault Tolerance  2001  castro01byzantine.pdf 
M. Castro and B. Liskov  Authenticated Byzantine Fault Tolerance Without Public-Key Cryptography  1999  castro99authenticated.pdf 
Castro and Liskov  Practical Byzantine Fault Tolerance  1999  castro99practical.pdf 
Leslie Lamport  Paxos Made Simple  2001  lamport01paxos.ps 
Roberto De Prisco and Butler W. Lampson and Nancy A. Lynch  Revisiting the Paxos Algorithm  1997  prisco98revisiting.ps 
B. W. Lampson  How to Build a Highly Available System Using Consensus  1996  lampson96how.pdf 
Leslie Lamport  The Part-Time Parliament  1989  lamport90parttime.ps 
Leslie Lamport and Robert Shostak and Marshall Pease  The Byzantine Generals Problem  1982  lamport82byzantine.pdf 
Michael Ben-Or  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols  1983  benor83consensus.pdf 
Michael J. Fischer and Nancy Lynch and Michal S. Paterson  Impossibility of Distributed Consensus with one Faulty Processor  1985  fischer85flp.pdf 
Verklemmungserkennung
Gabriel Bracha and Sam Toueg  A distributed algorithm for generalized deadlock detection  1984  bracha84deadlock.pdf 
K. Mani Chandy and Jayadev Misra and Laura M. Haas  Distributed deadlock detection  1983  chandy83deadlock.pdf 
K. M. Chandy and J. Misra  A distributed algorithm for detecting resource deadlocks in distributed systems  1982  chandy82deadlock.pdf 
Speicherbereinigung
Stephen M Blackburn and Richard L Hudson and Ron Morrison and J Eliot B Moss and David S Munro and John Zigma  Starting with Termination: A Methodology for Building Distributed Garbage Collection Algorithms  2001  blackburn01dgc.ps 
Gerard Tel and Friedemann Mattern  The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes  1993  tel93gc.ps 
Plainfossé, David and Shapiro, Marc  A Survey of Distributed Garbage Collection Techniques  1995  plainfosse95gcsurvey.ps 
Plainfossé, David and Shapiro, Marc  A Survey of Distributed Garbage Collection Techniques (Presentation Slides)  1995  plainfosse95gcslides.pdf 
Fabrice Le Fessant and Ian Piumarta and Marc Shapiro  An implementation of complete, asynchronous, distributed garbage collection  1998  fessant98gc.ps 
Zustandssicherung
Richard Koo and Sam Toueg  Checkpointing and rollback-recovery for distributed systems  1986  koo86checkpoint.pdf 
K. Mani Chandy and Leslie Lamport  Distributed snapshots: determining global states of distributed systems  1985  chandy85snapshot.pdf 
Gegenseitiger Ausschluss
Glenn Ricart and Ashok K. Agrawala  An optimal algorithm for mutual exclusion in computer networks  1981  ricart81mutex.pdf 
Mukesh Singhal  A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems  1989  singhal89mutex.pdf 
Guohong Cao and Mukesh Singhal  A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems  2001  cao01mutex.pdf 
Beverly A. Sanders  The information structure of distributed mutual exclusion algorithms  1987  sanders87mutex.pdf 
Ye-In Chang and Yao-Jen Chang  A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion  1997  chang97faulttolerant.pdf 
Mamoru Maekawa  A SQRT(N) algorithm for mutual exclusion in decentralized systems  1985  maekawa85mutex.pdf 
Wahlalgorithmen
Ernest Chang and Rosemary Robert  An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes  1979  chang79extrema.pdf 
Gary L. Peterson  An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem  1982  peterson82circular.pdf 
Zeit
Leslie Lamport  Time, clocks, and the ordering of events in a distributed system  1978  lamport78time.pdf 
Leslie Lamport and P. M. Melliar-Smith  Synchronizing Clocks in the Presence of Faults  1985  lamport85time.pdf