Distributed Computing
Editat de Prasad Jayantien Limba Engleză Paperback – 15 sep 1999
Preț: 325.06 lei
Preț vechi: 406.33 lei
-20% Nou
Puncte Express: 488
Preț estimativ în valută:
57.51€ • 67.00$ • 50.22£
57.51€ • 67.00$ • 50.22£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540665311
ISBN-10: 3540665315
Pagini: 376
Ilustrații: X, 366 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540665315
Pagini: 376
Ilustrații: X, 366 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras