| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910768453303321 |
|
|
Titolo |
Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1997.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XI, 341 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 1320 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Computer networks |
Software engineering |
Algorithms |
Computer programming |
Theory of Computation |
Computer Communication Networks |
Software Engineering/Programming and Operating Systems |
Algorithm Analysis and Problem Complexity |
Programming Techniques |
Computation by Abstract Devices |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 11th International Workshop on Distributed Algorithms, WDAG '97, held in Saarbrücken, Germany, in September 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. |
|
|
|
|
|
|
|
| |