Skip to main content
  • Conference proceedings
  • © 1997

Distributed Algorithms

11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1320)

Conference series link(s): WDAG: International Workshop on Distributed Algorithms

Conference proceedings info: WDAG 1997.

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (24 papers)

  1. Front Matter

  2. Towards fault-tolerant and secure agentry

    • Fred B. Schneider
    Pages 1-14
  3. Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study

    • Anna Pogosyants, Roberto Segala, Nancy Lynch
    Pages 22-36
  4. A simple DFS-Based algorithm for linear interval routing

    • T. Eilam, S. Moran, S. Zaks
    Pages 37-51
  5. ATM layouts with bounded hop count and congestion

    • Michele Flammin, Enrico Nardelli, Guido Proietti
    Pages 52-65
  6. Scheduling in synchronous networks and the greedy algorithm

    • King-Shan Lui, Shmuel Zaks
    Pages 66-80
  7. Rapid convergence of a local load balancing algorithm for asynchronous rings

    • Johannes E. Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
    Pages 81-95
  8. Performing tasks on restartable message-passing processors

    • Bogdan S. Chlebus, Roberto De Prisco, Alex A. Shvartsman
    Pages 96-110
  9. Revisiting the Paxos algorithm

    • Roberto De Prisco, Butler Lampson, Nancy Lynch
    Pages 111-125
  10. Heartbeat: A timeout-free failure detector for quiescent reliable communication

    • Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
    Pages 126-140
  11. Genuine atomic multicast

    • Rachid Guerraoui, André Schiper
    Pages 141-154
  12. Low-overhead time-triggered group membership

    • Shmuel Katz, Pat Lincoln, John Rushby
    Pages 155-169
  13. Virtual precedence in asynchronous systems: Concept and applications

    • Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal
    Pages 170-184
  14. Fault tolerance bounds for memory consistency

    • Jerry James, Ambuj K. Singh
    Pages 200-214
  15. Precedence-based memory models

    • Victor Luchangco
    Pages 215-229
  16. Reliable communication over partially authenticated networks

    • Amos Beimell, Matthew Franklin
    Pages 245-259

About this book

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.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access