Distributed Algorithms: 4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings.

Front Cover
Springer Science & Business Media, Jun 19, 1991 - Computers - 431 pages
0 Reviews
This volume contains the proceedings of the 4th International Workshop on Distributed Algorithms, held near Bari, Italy, September 24-26, 1990. The workshop was a forum for researchers, students and other interested persons to discuss recent results and trends in the design and analysis of distributed algorithms for communication networks and decentralized systems. The volume includes all 28 papers presented at the workshop, covering current research in such aspects of distributed algorithm design as distributed combinatorial algorithms, distributed algorithms on graphs, distributed algorithms for new types of decentralized systems, distributed data structures, synchronization and load-balancing, distributed algorithms for control and communication, design and verification of network protocols, routing algorithms, fail-safe and fault-tolerant distributed algorithms, distributed database techniques, algorithms for transaction management and replica control, and other related topics.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

SelfStabilizing Ring Orientation
1
MemoryEfficient Self Stabilizing Protocols for General Networks
15
On the Computational Power Needed to Elect a Leader
29
Spanning Tree Construction for Nameless Networks
41
A linear faulttolerant naming algorithm
57
A ComplexityOriented View
71
An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems
90
On the Average Performance of Synchronized Programs in Distributed Networks
102
LocalizedAccess Protocols for Replicated Databases
245
WEIGHTED VOTING FOR OPERATION DEPENDENT MANAGEMENT OF REPLICATED DATA
263
Wakeup under ReadWrite Atomicity
277
Time and Message Efficient Reliable Broadcasts
289
EarlyStopping Distributed Bidding and Applications
304
FAST CONSENSUS IN NETWORKS OF BOUNDED DEGREE
321
Common Knowledge and Consistent Simultaneous Coordination
334
Agreement on the Group Membership in Synchronous Distributed Systems
353

Distributed Algorithms for Reconstructing MST after Topology Change
122
EFFICIENT DISTRIBUTED ALGORITHMS FOR SINGLESOURCE SHORTEST PATHS AND RELATED PROBLEMS ON PLANE NETWORKS
133
Stepwise Development of a Distributed Load Balancing Algorithm
151
Greedy Packet Scheduling
169
Optimal Computation of Global Sensitive Functions in Fast Networks
185
Efficient Mechanism for Fairness and DeadlockAvoidance in HighSpeed Networks
192
Strong Verifiable Secret Sharing Extended Abstract
213
WEAK CONSISTENCY AND PESSIMISTIC REPLICA CONTROL
228
TIGHT BOUNDS ON THE ROUND COMPLEXITY OF DISTRIBUTED 1SOLVABLE TASKS
373
A TimeRandomness Tradeoff for Communication Complexity
390
BOUNDS ON THE COSTS OF REGISTER IMPLEMENTATIONS
402
A Bounded FirstIn FirstEnabled Solution to the 1Exclusion Problem
422
LIST OF PARTICIPANTS
432
AUTHOR INDEX
433
Copyright

Common terms and phrases

About the author (1991)

NICOLA SANTORO, PhD, is Professor of Computer Science at Carleton University. Dr. Santoro has been involved in distributed computing from the beginning of the field. He has contributed extensively on the algorithmic aspects, authoring many seminal papers. He is a founder of the main theoretical conferences in the field (PODC, DISC, SIROCCO). His current research is on distributed algorithms for mobile agents, autonomous mobile robots, and mobile sensor networks.