My Account Log in

1 option

Distributed Computing : 13th International Symposium, DISC'99, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings / edited by Prasad Jayanti.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Jayanti, Prasad, 1962- editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1693.
Lecture Notes in Computer Science, 0302-9743 ; 1693
Language:
English
Subjects (All):
Computer networks.
Computer architecture.
Computer programming.
Algorithms.
Computers.
Operating systems (Computers).
Computer Communication Networks.
Computer System Implementation.
Programming Techniques.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Operating Systems.
Local Subjects:
Computer Communication Networks.
Computer System Implementation.
Programming Techniques.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Operating Systems.
Physical Description:
1 online resource (X, 366 pages).
Edition:
First edition 1999.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
System Details:
text file PDF
Summary:
DISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. This volume includes 23 contributed papers and an invited lecture, all presented at DISC '99, held on September 27-29, 1999 in Bratislava, Slovak Republic. In addition to regular submissions, the call for papers for DISC '99 also - licited Brief Announcements (BAs). We received 60 regular submissions and 15 brief announcement submissions. These were read and evaluated by the p- gramcommittee, with the additional help of external reviewerswhen needed. At the program committee meeting on June 10-11 at Dartmouth College, Hanover, USA, 23 regular submissions and 4 BAs were selected for presentation at DISC '99. The extended abstracts of these 23 regular papers appear in this volume, while the four BAs appear as a special publication of Comenius Univ- sity, Bratislava- the hostof DISC '99.It is expected that the regularpapers will be submitted later, in more polished form, to fully refereed scienti?c journals. Of the 23 regular papers selected for the conference, 12 quali?ed for the Best Student Paper award. The program committee awarded this honor to the paper entitled "Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast" by Marcos Aguilera, Sam Toueg, and Borislav Deianov. Marcos and Borislav, who are both students, share this award.
Contents:
Invited Lecture
A Case for Message Oriented Middleware
Regular Papers
Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach
A Dynamic Primary Configuration Group Communication Service
Asynchronous Group Membership with Oracles
Generic Broadcast
Non-blocking Asynchronous Byzantine Quorum Systems
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Randomness Recycling in Constant-Round Private Computations
Abuse-Free Multi-party Contract Signing
Fair and Efficient Mutual Exclusion Algorithms
Fast and Scalable Mutual Exclusion
The Congenial Talking Philosophers Problem in Computer Networks
Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution
DUALITY: An Architecture Independent Design Model for Parallel Systems Based on Partial Order Semantics
A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems
Stabilization-Preserving Atomicity Refinement
Self-Testing/Correcting Protocols
Randomization Helps to Perform Tasks on Processors Prone to Failures
A New Scheduling Algorithm for General Strict Multithreaded Computations
Consensus Numbers of Transactional Objects
Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions
Maintenance of a Spanning Tree in Dynamic Networks.
Other Format:
Printed edition:
ISBN:
978-3-540-48169-0
9783540481690
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account