Distributed Algorithms

11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings
1997
ISBN: 978-3-540-63575-8
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1320, 341 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1090 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Tsigas, Philippas

Mavronicolas, Marios

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
• Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Betriebssysteme Windows Betriebssysteme
• Mathematik | Informatik EDV | Informatik Technische Informatik Externe Speicher & Peripheriegeräte

Inhaltsverzeichnis

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.