Distributed Algorithms
Editat de Marios Mavronicolas, Philippas Tsigasen Limba Engleză Paperback – 10 sep 1997
The volume presents 20 revised full papers selected from 59 submissions. Also included are three invited papers by leading researchers. The papers address a variety of current issues in the area of distributed algorithms and, more generally, distributed systems such as various particular algorithms, randomized computing, routing, networking, load balancing, scheduling, message-passing, shared-memory systems, communication, graph algorithms, etc.
Preț: 323.83 lei
Preț vechi: 404.79 lei
-20% Nou
Puncte Express: 486
Preț estimativ în valută:
57.30€ • 66.83$ • 50.31£
57.30€ • 66.83$ • 50.31£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540635758
ISBN-10: 3540635750
Pagini: 352
Ilustrații: XI, 341 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540635750
Pagini: 352
Ilustrații: XI, 341 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Towards fault-tolerant and secure agentry.- Workflow management — An exercise in distributed computing.- In memory of Anya Pogosyants.- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study.- A simple DFS-Based algorithm for linear interval routing.- ATM layouts with bounded hop count and congestion.- Scheduling in synchronous networks and the greedy algorithm.- Rapid convergence of a local load balancing algorithm for asynchronous rings.- Performing tasks on restartable message-passing processors.- Revisiting the Paxos algorithm.- Heartbeat: A timeout-free failure detector for quiescent reliable communication.- Genuine atomic multicast.- Low-overhead time-triggered group membership.- Virtual precedence in asynchronous systems: Concept and applications.- Detecting global predicates in distributed systems with clocks.- Fault tolerance bounds for memory consistency.- Precedence-based memory models.- Strong interaction fairness in a fully distributed system with unbounded speed variability.- Reliable communication over partially authenticated networks.- Self-stabilizing depth-first token passing on rooted networks.- Secure distributed storage and retrieval.- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system.- Transparent support for wait-free transactions.- On the power of multi-objects.