Distributed Computing

13th International Symposium, DISC'99, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings

Häftad, Engelska, 1999

729 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 13th International Symposium on Distributed Computing, DISC'99, held in Bratislava, Slovak Republic, in September 1999.The 23 revised full papers presented with an invited paper were carefully reviewed and selected from a total of 75 submissions. The papers address a variety of current issues in distributed algorithms, systems, and programming, in particular failure detectors, broadcasting, group communication services, quorum systems, cryptography, randomness, mutual exclusion, networking, protocols, scheduling algorithms, and self-stabilization.

Produktinformation

Utgivningsdatum1999-09-15
Mått155 x 235 x 21 mm
Vikt569 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor366
Upplaga1999
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540665311

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Nätverk och kommunikation inom Data och it
Hårdvara inom Data och it
Operativsystem inom Data och it

Invited Lecture.- A Case for Message Oriented Middleware.- Regular Papers.- Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast.- Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems.- Solving Consensus Using Chandra-Toueg’s Unreliable Failure Detectors: A General Quorum-Based Approach.- A Dynamic Primary Configuration Group Communication Service.- Asynchronous Group Membership with Oracles.- Generic Broadcast.- Non-blocking Asynchronous Byzantine Quorum Systems.- Byzantine Agreement Secure against General Adversaries in the Dual Failure Model.- Randomness Recycling in Constant-Round Private Computations.- Abuse-Free Multi-party Contract Signing.- Fair and Efficient Mutual Exclusion Algorithms.- Fast and Scalable Mutual Exclusion.- The Congenial Talking Philosophers Problem in Computer Networks.- Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution.- DUALITY: An Architecture Independent Design Model for Parallel Systems Based on Partial Order Semantics.- A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems.- Stabilization-Preserving Atomicity Refinement.- Self-Testing/Correcting Protocols.- Randomization Helps to Perform Tasks on Processors Prone to Failures.- A New Scheduling Algorithm for General Strict Multithreaded Computations.- Consensus Numbers of Transactional Objects.- Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions.- Maintenance of a Spanning Tree in Dynamic Networks.