Skip to main content
SpringerLink
Log in
Book cover

Distributed Algorithms

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

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Marios Mavronicolas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Philippas Tsigas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: WDAG 1997.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. Towards fault-tolerant and secure agentry

    • Fred B. Schneider
    Pages 1-14

  3. Workflow management — An exercise in distributed computing

    • Andreas Reuter
    Pages 15-19

  4. In memory of Anya Pogosyants

    Pages 20-21

  5. Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study

    • Anna Pogosyants, Roberto Segala, Nancy Lynch
    Pages 22-36

  6. A simple DFS-Based algorithm for linear interval routing

    • T. Eilam, S. Moran, S. Zaks
    Pages 37-51

  7. ATM layouts with bounded hop count and congestion

    • Michele Flammin, Enrico Nardelli, Guido Proietti
    Pages 52-65

  8. Scheduling in synchronous networks and the greedy algorithm

    • King-Shan Lui, Shmuel Zaks
    Pages 66-80

  9. Rapid convergence of a local load balancing algorithm for asynchronous rings

    • Johannes E. Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
    Pages 81-95

  10. Performing tasks on restartable message-passing processors

    • Bogdan S. Chlebus, Roberto De Prisco, Alex A. Shvartsman
    Pages 96-110

  11. Revisiting the Paxos algorithm

    • Roberto De Prisco, Butler Lampson, Nancy Lynch
    Pages 111-125

  12. Heartbeat: A timeout-free failure detector for quiescent reliable communication

    • Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
    Pages 126-140

  13. Genuine atomic multicast

    • Rachid Guerraoui, André Schiper
    Pages 141-154

  14. Low-overhead time-triggered group membership

    • Shmuel Katz, Pat Lincoln, John Rushby
    Pages 155-169

  15. Virtual precedence in asynchronous systems: Concept and applications

    • Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal
    Pages 170-184

  16. Detecting global predicates in distributed systems with clocks

    • Scott D. Stoller
    Pages 185-199

  17. Fault tolerance bounds for memory consistency

    • Jerry James, Ambuj K. Singh
    Pages 200-214

  18. Precedence-based memory models

    • Victor Luchangco
    Pages 215-229

  19. Strong interaction fairness in a fully distributed system with unbounded speed variability

    • Yuh-Jzer Joung, Jen-Yi Liao
    Pages 230-244

  20. Reliable communication over partially authenticated networks

    • Amos Beimell, Matthew Franklin
    Pages 245-259
Back to top

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation