Del 1499 - Lecture Notes in Computer Science

Distributed Computing

12th International Symposium, DISC'98, Andros, Greece, September 24 -26, 1998, Proceedings

Häftad, Engelska, 1998

Av Shay Kutten

739 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1998-09-11
Mått155 x 235 x 24 mm
Vikt663 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor428
Upplaga1998
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540650669

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Nätverk och kommunikation inom Data och it
Hårdvara inom Data och it
Programvaruutveckling inom Data och it

Sense of direction in distributed computing.- Top-down considerations on distributed computing.- Inter-task co-ordination in long-lived distributed applications.- Seamlessly selecting the best copy from internet-wide replicated web servers.- Wait-free synchronization in quantum-based multiprogrammed systems.- Computing in totally anonymous asynchronous shared memory systems.- Transient fault detectors.- Directed virtual path layouts in ATM networks.- A decision-theoretic approach to reliable message delivery.- Propagation and leader election in a multihop broadcast environment.- The arrow distributed directory protocol.- Efficient Byzantine agreement secure against general adversaries.- Long-lived, fast, waitfree renaming with optimal name space and high throughput.- The compactness of interval routing for almost all graphs.- A wait-free classification of loop agreement tasks.- A stabilizing repair timer.- Java: Memory consistency and process coordination.- A complete and constant time wait-free implementation of CAS from LL/SC and vice versa.- Failure detection and consensus in the crash-recovery model.- A more committed quorum-based three phase commit protocol.- Multicast group communication as a base for a load-balancing replicated data service.- Efficient deadlock-free multi-dimensional interval routing in interconnection networks.- A new protocol for efficient cooperative transversal Web caching.- Fairness of shared objects.- Optimistic Atomic Broadcast.- Approximate agreement with mixed mode faults: Algorithm and lower bound.- Using remote access histories for thread scheduling in distributed shared memory systems.- The Bancomat problem: An example of resource allocation in a partitionable asynchronous system.- Lifetime based consistency protocols for distributedobjects.- Deriving a scalable algorithm for mutual exclusion.- OFC: A distributed fossil-collection algorithm for Time-Warp.