Distributed Computing
Home > Computing and Information Technology > Computer hardware > Network hardware > Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings(5218 Lecture Notes in Computer Science)
Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings(5218 Lecture Notes in Computer Science)

Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings(5218 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



Available


X
About the Book

This book constitutes the refereed proceedings of the 22nd International Symposium on Distributed Computing, DISC 2008, held in Arcachon, France, in September 2008. The 33 revised full papers, selected from 101 submissions, are presented together with 11 brief announcements of ongoing works; all of them were carefully reviewed and selected for inclusion in the book. The papers address all aspects of distributed computing, including the theory, design, implementation and applications of distributed algorithms, systems and networks - ranging from foundational and theoretical topics to algorithms and systems issues and to applications in various fields.

Table of Contents:
Regular Papers.- The Mailbox Problem.- Matrix Signatures: From MACs to Digital Signatures in Distributed Systems.- How to Solve Consensus in the Smallest Window of Synchrony.- Local Terminations and Distributed Computability in Anonymous Networks.- A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring.- Fast Distributed Approximations in Planar Graphs.- Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion.- The Weakest Failure Detector for Message Passing Set-Agreement.- Local Maps: New Insights into Mobile Agent Algorithms.- r 3: Resilient Random Regular Graphs.- Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics.- Constant-Space Localized Byzantine Consensus.- Optimistic Erasure-Coded Distributed Storage.- On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing.- On Radio Broadcasting in Random Geometric Graphs.- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.- Deterministic Rendezvous in Trees with Little Memory.- Broadcasting in UDG Radio Networks with Missing and Inaccurate Information.- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory.- Permissiveness in Transactional Memories.- The Synchronization Power of Coalesced Memory Accesses.- Optimizing Threshold Protocols in Adversarial Structures.- Hopscotch Hashing.- Computing Lightweight Spanners Locally.- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.- Leveraging Linial’s Locality Limit.- Continuous Consensus with Failures and Recoveries.- No Double Discount: Condition-Based Simultaneity Yields Limited Gain.- Bosco: One-Step ByzantineAsynchronous Consensus.- A Limit to the Power of Multiple Nucleation in Self-assembly.- Using Bounded Model Checking to Verify Consensus Algorithms.- Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks.- Brief Announcements.- Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.- The Dynamics of Probabilistic Population Protocols.- A Distributed Algorithm for Computing and Updating the Process Number of a Forest.- Brief Announcment: Corruption Resilient Fountain Codes.- Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks.- Easy Consensus Algorithms for the Crash-Recovery Model.- Evaluating the Quality of a Network Topology through Random Walks.- Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems.- Data Failures.- Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network.- Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model.


Best Sellers


Product Details
  • ISBN-13: 9783540877783
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 522
  • Series Title: Theoretical Computer Science and General Issues
  • Sub Title: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings
  • ISBN-10: 3540877789
  • Publisher Date: 10 Sep 2008
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 5218 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings(5218 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings(5218 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008, Proceedings(5218 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!