Distributed Computing
Home > Computing and Information Technology > Computer science > Distributed Computing: 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings(4167 Lecture Notes in Computer Science)
Distributed Computing: 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings(4167 Lecture Notes in Computer Science)

Distributed Computing: 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings(4167 Lecture Notes in Computer Science)

|
     0     
5
4
3
2
1




International Edition


About the Book

DISC, the International Symposium on DIStributed Computing, is an annual forum for presentation of research on all facets of distributed computing, inc- ding the theory, design, analysis, implementation, and application of distributed systems and networks. The 20th anniversary edition of DISC was held on S- tember 18-20, 2006, in Stockholm, Sweden. There were 145 extended abstracts submitted to DISC this year, and this - lume contains the 35 contributions selected by the Program Committee and one invited paper among these 145 submissions. All submitted papers were read and evaluated by at least three Program Committee members, assisted by external reviewers. The ?nal decision regarding every paper was taken during the P- gram Committee meeting, which took place in Beer-Sheva, June 30 and July 1, 2006. The Best Student Award was split and given to two papers: the paper “- act Distance Labelings Yield Additive-Stretch Compact Routing Schemes,” by Arthur Bradly, and Lenore Cowen, and the paper “A Fast Distributed App- ximation Algorithm for Minimum Spanning Trees” co-authored by Maleq Khan and Gopal Pandurangan. The proceedings also include 13 three-page-long brief announcements (BA). TheseBAsarepresentationsofongoingworksforwhichfullpapersarenotready yet, or of recent results whose full description will soon be or has been recently presented in other conferences. Researchers use the BA track to quickly draw the attention of the community to their experiences, insights and results from ongoing distributed computing research and projects. The BAs included in this proceedings volume were selected among 26 BA submissions.

Table of Contents:
Exploring Gafni’s Reduction Land: From ? k to Wait-Free Adaptive -Renaming Via k-Set Agreement.- Exploring Gafni’s Reduction Land: From ? k to Wait-Free Adaptive -Renaming Via k-Set Agreement.- Renaming in Message Passing Systems with Byzantine Failures.- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists.- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering.- Fast Computation by Population Protocols with a Leader.- On Self-stabilizing Search Trees.- Efficient Dynamic Aggregation.- Groupings and Pairings in Anonymous Networks.- A New Proof of the GHS Minimum Spanning Tree Algorithm.- A Knowledge-Based Analysis of Global Function Computation.- Checking a Multithreaded Algorithm with ?+?CAL.- Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture.- Conflict Detection and Validation Strategies for Software Transactional Memory.- Transactional Locking II.- Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects.- One-Step Consensus Solvability.- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.- On Consistency of Encrypted Files.- Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.- A Lazy Snapshot Algorithm with Eager Validation.- Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients.- Time and Communication Efficient Consensus for Crash Failures.- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.- Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.- A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.- On Randomized Broadcasting in Power Law Networks.- Distributed Approximation Algorithms in Unit-Disk Graphs.- TheWeakest Failure Detectors to Boost Obstruction-Freedom.- Fully-Adaptive Algorithms for Long-Lived Renaming.- Constructing Shared Objects That Are Both Robust and High-Throughput.- Byzantine and Multi-writer K-Quorums.- On Minimizing the Number of ADMs in a General Topology Optical Network.- Robust Network Supercomputing with Malicious Processes.- Distributed Resource Allocation in Stream Processing Systems.- Low-latency Atomic Broadcast in the presence of contention.- Oblivious Gradient Clock Synchronization.- Brief Announcement: Abortable and Query-Abortable Objects.- Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers.- Brief Announcement: Convergence Analysis of Scalable Gossip Protocols.- Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules.- Brief Announcement: Many Slices Are Better Than One.- Brief Announcement: On Augmented Graph Navigability.- Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems.- Brief Announcement: Optimistic Algorithms for Partial Database Replication.- Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays.- Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance.- Brief Announcement Monitoring of Linear Distributed Computations.- Brief Announcement: Communication-Optimal Implementation of Failure Detector Class .- Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks.- Invited Talks.- Provably Unbreakable Hyper-encryption Using Distributed Systems.- Time, Clocks, and the Ordering of My Ideas AboutDistributed Systems.- My Early Days in Distributed Computing Theory: 1979–1982.- Panel on the Contributions of the DISC Community to Distributed Computing: A Historical Perspective.- DISC at Its 20th Anniversary:Past, Present and Future.- Erratum.- DISC at Its 20th Anniversary: Past, Present and Future.


Best Sellers


Product Details
  • ISBN-13: 9783540446248
  • 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: 580
  • Returnable: N
  • Series Title: Theoretical Computer Science and General Issues
  • Width: 155 mm
  • ISBN-10: 3540446249
  • Publisher Date: 18 Sep 2006
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 4167 Lecture Notes in Computer Science
  • Sub Title: 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Distributed Computing: 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings(4167 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Distributed Computing: 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings(4167 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: 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings(4167 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!