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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Kutten, Shay (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Έκδοση: 1st ed. 1998.
• Σειρά: Lecture Notes in Computer Science, 1499
• Θέματα: Computer communication systems.; Computers.; Software engineering.; Algorithms.; Computer programming.; Computer Communication Networks.; Theory of Computation.; Software Engineering/Programming and Operating Systems.; Algorithm Analysis and Problem Complexity.; Programming Techniques.; Computation by Abstract Devices.

 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. 

 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.