My Account Log in

1 option

Distributed Computing : 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings / edited by Faith Ellen Fich.

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:
Ellen, Faith, 1956- editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2848.
Lecture Notes in Computer Science, 0302-9743 ; 2848
Language:
English
Subjects (All):
Computer architecture.
Computer networks.
Computer programming.
Operating systems (Computers).
Computers.
Algorithms.
Computer System Implementation.
Computer Communication Networks.
Programming Techniques.
Operating Systems.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Local Subjects:
Computer System Implementation.
Computer Communication Networks.
Programming Techniques.
Operating Systems.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Physical Description:
1 online resource (IX, 371 pages).
Edition:
First edition 2003.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
System Details:
text file PDF
Contents:
Resilient Consensus for Infinitely Many Processes
Uniform Solvability with a Finite Number of MWMR Registers
Timing-Based Mutual Exclusion with Local Spinning
On the Uncontended Complexity of Consensus
Probabilistic Quorums for Dynamic Systems
Efficient Replication of Large Data Objects
On the Locality of Consistency Conditions
Multi-writer Consistency Conditions for Shared Memory Objects
Booting Clock Synchronization in Partially Synchronous Systems
Automatic Discovery of Mutual Exclusion Algorithms
On the Implementation Complexity of Specifications of Concurrent Programs
Competitive Management of Non-preemptive Queues with Multiple Values
Constructing Disjoint Paths for Secure Communication
Compact Routing for Flat Networks
Lower Bounds for Oblivious Single-Packet End-to-End Communication
Efficient Gossip and Robust Distributed Computation
Condition-Based Consensus in Synchronous Systems
Using Conditions to Expedite Consensus in Synchronous Distributed Systems
Tight Bounds on Early Local Decisions in Uniform Consensus
Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors
On Failure Detectors and Type Boosters
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks
Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks
Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems
Overcoming the Majority Barrier in Large-Scale Systems.
Other Format:
Printed edition:
ISBN:
978-3-540-39989-6
9783540399896
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