Distributed Computing (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
392
Utgivningsdatum
2000-09-01
Upplaga
2000 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Herlihy, M. (ed.)
Illustrationer
VIII, 392 p.
Dimensioner
238 x 156 x 24 mm
Vikt
604 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783540411437

Distributed Computing

14th International Conference, DISC 2000 Toledo, Spain, October 4-6, 2000 Proceedings

Häftad,  Engelska, 2000-09-01
783
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 1 format & utgåvor
DISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. DISC 2000 was held on4-6 October, 2000 in Toledo, Spain. This volume includes 23 contributed papers and the extended abstract of an invited lecture from last years DISC. It is expected that the regular papers will later be submitted in a more polished form to fully refereed scienti?c journals. The extended abstracts of this years invited lectures, by Jean-Claude Bermond and Sam Toueg, will appear in next years proceedings. We received over 100 regular submissions, a record for DISC. These s- missions were read and evaluated by the program committee, with the help of external reviewers when needed. Overall, the quality of the submissions was excellent, and we were unable to accept many deserving papers. This years Best Student Paper award goes to Polynomial and Adaptive Long-Lived (2k?1)-Renaming by Hagit Attiya and Arie Fouren. Arie Fouren is the student author.
Visa hela texten

Passar bra ihop

  1. Distributed Computing
  2. +
  3. Foundations for Health Promotion

De som köpt den här boken har ofta också köpt Foundations for Health Promotion av Jane Wills (häftad).

Köp båda 2 för 1174 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Maurice Herlihy

Innehållsförteckning

Lower Bounds in Distributed Computing.- Adaptive Mutual Exclusion with Local Spinning.- Bounds for Mutual Exclusion with only Processor Consistency.- Even Better DCAS-Based Concurrent Deques.- Distributed Algorithms for English Auctions.- A Probabilistically Correct Leader Election Protocol for Large Groups.- Approximation Algorithms for Survivable Optical Networks.- Distributed Cooperation During the Absence of Communication.- On the Importance of Having an Identity or, is Consensus really Universal?.- Polynomial and Adaptive Long-lived (2k- 1)-Renaming.- Computing with Infinitely Many Processes.- Establishing Business Rules for Inter-Enterprise Electronic Commerce.- Metering Schemes with Pricing.- Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms.- Self-Stabilizing Local Mutual Exclusion and Daemon Refinement.- More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs.- Gossip versus Deterministically Constrained Flooding on Small Networks.- Thrifty Generic Broadcast.- Locating Information with Uncertainty in Fully Interconnected Networks.- Optimistic Replication for Internet Data Services.- Scalable Replication in Database Clusters.- Disk Paxos.- Objects Shared by Byzantine Processes.- Short Headers Suffice for Communication in a DAG with Link Failures.- Consistency Conditions for a CORBA Caching Service.