Distributed Computing: 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001. Proceedings, Volume 15

Front Cover
Springer Science & Business Media, Sep 19, 2001 - Computers - 341 pages
DISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. DISC 2001 was held on Oct 3–5, 2001, in Lisbon, Portugal. This volume includes 23 contributed papers. It is expected that these papers will be submitted in more polished form to fully refereed scienti?c journals. The extended abstracts of this year's invited lectures, by Gerard LeLann and David Peleg, will appear in next year's proceedings. We received 70 regular submissions. These submissions were read and eval- ted by the program committee, with the help of external reviewers when needed. Overall, the quality of the submissions was excellent, and we were unable to - cept many deserving papers. This year's Best Student Paper award goes to Yong-Jik Kim for the paper “A Time Complexity Bound for Adaptive Mutual Exclusion” by Yong-Jik Kim and James H. Anderson. October 2001 Jennifer Welch Organizing Committee Chair: Luis Rodrigues (University of Lisbon) Publicity: Paulo VerŽ?ssimo (University of Lisbon) Treasurer: Filipe Araujo Ž (University of Lisbon) Web: Alexandre Pinto (University of Lisbon) Registration: Hugo Miranda (University of Lisbon) Steering Committee Faith Fich (U. of Toronto) Michel Raynal (vice-chair) (IRISA) Maurice Herlihy (Brown U. ) AndrŽe Schiper (chair) (EPF Lausanne) Prasad Jayanti (Dartmouth) Jennifer Welch (Texas A&M U. ) Shay Kutten (Technion) Program Committee Marcos K. Aguilera (Compaq SRC) Mark Moir (Sun Microsystems Laboratories) Lorenzo Alvisi (U. Texas, Austin) Stephane Perennes (CNRS U.
 

What people are saying - Write a review

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

Contents

A Time Complexity Bound for Adaptive Mutual Exclusion
1
QuorumBased Algorithms for Group Mutual Exclusion
16
An Effective Characterization of Computability in Anonymous Networks
33
Competitive HillClimbing Strategies for Replica Placement in a Distributed File System
48
Optimal Unconditional Information Diffusion
63
Techniques and Theory
78
A LowLatency Nonblocking Commit Service
93
Stable Leader Election
108
SelfStabilizing Minimum Spanning Tree Construction on MessagePassing Networks
194
Self Stabilizing Distributed Queuing
209
A Space Optimal Deterministic SelfStabilizing Leader Election Algorithm for Unidirectional Rings
224
Randomized FiniteState Distributed Algorithms as Markov Chains
240
The Average Hop Count Measure for Virtual Path Layouts
255
Efficient Routing in Networks with Long Range Contacts
270
Efficient Routing in Networks with Long Range Contacts
285
A Pragmatic Implementation of Nonblocking LinkedLists
300

Adaptive LongLived Ok2Renaming with Ok2 Steps
123
A New Synchronous Lower Bound for Set Agreement
136
The Complexity of Synchronous Iterative DoAll with Crashes
151
Mobile Search for a Black Hole in an Anonymous Ring
166
Randomised Mutual Search for k 2 Agents
180
Stabilizing Replicated Search Trees
315
Adding Networks
330
Author Index
342
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information