Vai al contenuto principale della pagina
Titolo: | Distributed Computing [[electronic resource] ] : 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings / / edited by Dahlia Malkhi |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Edizione: | 1st ed. 2002. |
Descrizione fisica: | 1 online resource (X, 378 p.) |
Disciplina: | 004/.36 |
Soggetto topico: | Computer communication systems |
Computers | |
Computer programming | |
Operating systems (Computers) | |
Algorithms | |
Computer Communication Networks | |
Theory of Computation | |
Programming Techniques | |
Operating Systems | |
Computation by Abstract Devices | |
Algorithm Analysis and Problem Complexity | |
Persona (resp. second.): | MalkhiDahlia |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | Early-Delivery Dynamic Atomic Broadcast -- Secure Computation without Agreement -- The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses -- Condition-Based Protocols for Set Agreement Problems -- Distributed Agreement and Its Relation with Error-Correcting Codes -- On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols -- Transformations of Self-Stabilizing Algorithms -- Simple Wait-Free Multireader Registers -- An Efficient Universal Construction for Message-Passing Systems -- Ruminations on Domain-Based Reliable Broadcast -- Stateless Termination Detection -- RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks -- Ad Hoc Membership for Scalable Applications -- Assignment-Based Partitioning in a Condition Monitoring System -- Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes -- Failure Detection Lower Bounds on Registers and Consensus -- Improved Compact Routing Scheme for Chordal Graphs -- A Practical Multi-word Compare-and-Swap Operation -- Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection -- Bounding Work and Communication in Robust Cooperative Computation -- Minimal Byzantine Storage -- Wait-Free n-Set Consensus When Inputs Are Restricted -- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures -- On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems. |
Titolo autorizzato: | Distributed computing |
ISBN: | 3-540-36108-1 |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465403403316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |