Distributed computing : 12th international symposium, DISC '98, Andros, Greece, September 24-26, 1998 : proceedings
| 000 | 01039pamuu2200277 a 4500 | |
| 001 | 000000659293 | |
| 005 | 20000302174918 | |
| 008 | 980819s1998 gw a b 101 0 eng | |
| 010 | ▼a 98041490 | |
| 020 | ▼a 3540650660 (softcover : alk. paper) | |
| 040 | ▼a DLC ▼c DLC ▼d OHX | |
| 049 | 1 | ▼l 121042408 ▼f 과학 |
| 050 | 0 0 | ▼a QA76.9.D5 ▼b D438 1998 |
| 072 | 7 | ▼a QA ▼2 lcco |
| 082 | 0 0 | ▼a 004/.36 ▼2 21 |
| 090 | ▼a 004.36 ▼b D611d ▼c 1998 | |
| 111 | 2 | ▼a DISC '98 ▼d (1998 : ▼c Andros, Greece) |
| 245 | 1 0 | ▼a Distributed computing : ▼b 12th international symposium, DISC '98, Andros, Greece, September 24-26, 1998 : proceedings / ▼c Shay Kutten (ed.). |
| 260 | ▼a Berlin ; ▼a New York : ▼b Springer, ▼c c1998. | |
| 300 | ▼a xi, 418 p. : ▼b ill. ; ▼c 24 cm. | |
| 440 | 0 | ▼a Lecture notes in computer science, ▼x 0302-9743 ; ▼v 1499 |
| 504 | ▼a Includes bibliographical references and index. | |
| 650 | 0 | ▼a Electronic data processing ▼x Distributed processing ▼x Congresses. |
| 700 | 1 | ▼a Kutten, Shay. |
| 950 | 1 | ▼b \57249 |
Holdings Information
| No. | Location | Call Number | Accession No. | Availability | Due Date | Make a Reservation | Service |
|---|---|---|---|---|---|---|---|
| No. 1 | Location Science & Engineering Library/Sci-Info(Stacks2)/ | Call Number 004.36 D611d 1998 | Accession No. 121042408 | Availability Available | Due Date | Make a Reservation | Service |
Contents information
Table of Contents
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 distributed objects.- Deriving a scalable algorithm for mutual exclusion.- OFC: A distributed fossil-collection algorithm for Time-Warp.
Information Provided By: :
