Distributed Computing
Editat de Maurice Herlihyen Limba Engleză Paperback – 20 sep 2000
Preț: 327.27 lei
Preț vechi: 409.09 lei
-20%
Puncte Express: 491
Carte tipărită la comandă
Livrare economică 27 iulie-10 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540411437
ISBN-10: 3540411437
Pagini: 400
Ilustrații: VIII, 392 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540411437
Pagini: 400
Ilustrații: VIII, 392 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Lower Bounds in Distributed Computing.- Adaptive Mutual Exclusion with Local Spinning.- Bounds for Mutual Exclusion with only Processor Consistency.- Even Better DCAS-Based Concurrent Deques.- Distributed Algorithms for English Auctions.- A Probabilistically Correct Leader Election Protocol for Large Groups.- Approximation Algorithms for Survivable Optical Networks.- Distributed Cooperation During the Absence of Communication.- On the Importance of Having an Identity or, is Consensus really Universal?.- Polynomial and Adaptive Long-lived (2k- 1)-Renaming.- Computing with Infinitely Many Processes.- Establishing Business Rules for Inter-Enterprise Electronic Commerce.- Metering Schemes with Pricing.- Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms.- Self-Stabilizing Local Mutual Exclusion and Daemon Refinement.- More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs.- Gossip versus Deterministically Constrained Flooding on Small Networks.- Thrifty Generic Broadcast.- Locating Information with Uncertainty in Fully Interconnected Networks.- Optimistic Replication for Internet Data Services.- Scalable Replication in Database Clusters.- Disk Paxos.- Objects Shared by Byzantine Processes.- Short Headers Suffice for Communication in a DAG with Link Failures.- Consistency Conditions for a CORBA Caching Service.