Distributed Computing: 12th International Symposium, DISC’98 Andros, Greece, September 24–26, 1998 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 12th International Symposium on Distributed Computing, DISC'98, held in Andros, Greece, in September 1998.
The 28 revised papers presented were carefully reviewed and selected from a total of 87 submissions. Also included are one invited paper and two abstracts of invited contributions. The papers address all currect issues of distributed systems, in particular Internet-based computing, shared-memory systems, ATM networks, security aspects, Java process coordination, network protocols, wait-free systems, shared objects, resource allocation, and distributed objects.

Author(s): Paola Flocchini, Bernard Mans, Nicola Santoro (auth.), Shay Kutten (eds.)
Series: Lecture Notes in Computer Science 1499
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998

Language: English
Pages: 428
Tags: Computer Communication Networks; Algorithm Analysis and Problem Complexity; Programming Techniques; Computation by Abstract Devices; Operating Systems

Sense of direction in distributed computing....Pages 1-15
Top-down considerations on distributed computing....Pages 16-19
Inter-task co-ordination in long-lived distributed applications....Pages 20-21
Seamlessly selecting the best copy from internet-wide replicated web servers....Pages 22-33
Wait-free synchronization in quantum-based multiprogrammed systems....Pages 34-48
Computing in totally anonymous asynchronous shared memory systems....Pages 49-61
Transient fault detectors....Pages 62-74
Directed virtual path layouts in ATM networks....Pages 75-88
A decision-theoretic approach to reliable message delivery....Pages 89-103
Propagation and leader election in a multihop broadcast environment....Pages 104-118
The arrow distributed directory protocol....Pages 119-133
Efficient Byzantine agreement secure against general adversaries....Pages 134-148
Long-lived, fast, waitfree renaming with optimal name space and high throughput....Pages 149-160
The compactness of interval routing for almost all graphs....Pages 161-174
A wait-free classification of loop agreement tasks....Pages 175-185
A stabilizing repair timer....Pages 186-200
Java: Memory consistency and process coordination....Pages 201-215
A complete and constant time wait-free implementation of CAS from LL/SC and vice versa....Pages 216-230
Failure detection and consensus in the crash-recovery model....Pages 231-245
A more committed quorum-based three phase commit protocol....Pages 246-257
Multicast group communication as a base for a load-balancing replicated data service....Pages 258-272
Efficient deadlock-free multi-dimensional interval routing in interconnection networks....Pages 273-287
A new protocol for efficient cooperative transversal Web caching....Pages 288-302
Fairness of shared objects....Pages 303-317
Optimistic Atomic Broadcast....Pages 318-332
Approximate agreement with mixed mode faults: Algorithm and lower bound....Pages 333-346
Using remote access histories for thread scheduling in distributed shared memory systems....Pages 347-362
The Bancomat problem: An example of resource allocation in a partitionable asynchronous system....Pages 363-377
Lifetime based consistency protocols for distributed objects....Pages 378-392
Deriving a scalable algorithm for mutual exclusion....Pages 393-407
OFC: A distributed fossil-collection algorithm for Time-Warp....Pages 408-418