000 -LEADER |
fixed length control field |
06557nam a22005295i 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20140310144053.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
fixed length control field |
cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
100824s2010 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783642157639 |
|
978-3-642-15763-9 |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
TK5105.5-5105.9 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
004.6 |
Edition number |
23 |
264 #1 - |
-- |
Berlin, Heidelberg : |
-- |
Springer Berlin Heidelberg, |
-- |
2010. |
912 ## - |
-- |
ZDB-2-SCS |
|
-- |
ZDB-2-LNC |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Lynch, Nancy A. |
Relator term |
editor. |
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
Title |
Distributed Computing |
Medium |
[electronic resource] : |
Remainder of title |
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings / |
Statement of responsibility, etc |
edited by Nancy A. Lynch, Alexander A. Shvartsman. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
XV, 532p. 85 illus. |
Other physical details |
online resource. |
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
Title |
Lecture Notes in Computer Science, |
International Standard Serial Number |
0302-9743 ; |
Volume number/sequential designation |
6343 |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
The 2010 Edsger W. Dijkstra Prize in Distributed Computing -- The 2010 Edsger W. Dijkstra Prize in Distributed Computing -- Invited Lecture I: Consensus (Session 1a) -- The Power of Abstraction -- Fast Asynchronous Consensus with Optimal Resilience -- Transactions (Session 1b) -- Transactions as the Foundation of a Memory Consistency Model -- The Cost of Privatization -- A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware -- Window-Based Greedy Contention Management for Transactional Memory -- Shared Memory Services and Concurrency (Session 1c) -- Scalable Flat-Combining Based Synchronous Queues -- Fast Randomized Test-and-Set and Renaming -- Concurrent Computing and Shellable Complexes -- Brief Announcements I (Session 1d) -- Brief Announcement: Hybrid Time-Based Transactional Memory -- Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency -- Brief Announcement: Fast Local-Spin Abortable Mutual Exclusion with Bounded Space -- Wireless Networks (Session 1e) -- What Is the Use of Collision Detection (in Wireless Networks)? -- Deploying Wireless Networks with Beeps -- Distributed Contention Resolution in Wireless Networks -- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks -- Brief Announcements II (Session 1f) -- Brief Announcement: Simple Gradecast Based Algorithms -- Brief Announcement: Decentralized Network Bandwidth Prediction -- Brief Announcement: Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT -- Invited Lecture II: Best Student Paper (Session 2a) -- Foundations of Speculative Distributed Computing -- Anonymous Asynchronous Systems: The Case of Failure Detectors -- Consensus and Leader Election (Session 2b) -- The Computational Structure of Progress Conditions -- Scalable Quantum Consensus for Crash Failures -- How Much Memory Is Needed for Leader Election -- Leader Election Problem versus Pattern Formation Problem -- Mobile Agents (Session 2c) -- Rendezvous of Mobile Agents in Directed Graphs -- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids -- Exclusive Perpetual Ring Exploration without Chirality -- Drawing Maps with Advice -- Invited Lecture III: Wireless Networks (Session 3a) -- Network-Aware Distributed Algorithms: Challenges and Opportunities in Wireless Networks -- Connectivity Problem in Wireless Networks -- Computing in Wireless and Mobile Networks (Session 3b) -- Trusted Computing for Fault-Prone Wireless Networks -- Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony -- Brief Announcements III (Session 3c) -- Brief Announcement: Failure Detectors Encapsulate Fairness -- Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study -- Brief Announcement: On Reversible and Irreversible Conversions -- Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting -- Brief Announcement: Flash-Log – A High Throughput Log -- Brief Announcement: New Bounds for Partially Synchronous Set Agreement -- Modeling Issues and Adversity (Session 3d) -- It’s on Me! The Benefit of Altruism in BAR Environments -- Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems -- On the Power of Non-spoofing Adversaries -- Implementing Fault-Tolerant Services Using State Machines: Beyond Replication -- Self-stabilizing and Graph Algortihms (Session 3e) -- Low Communication Self-stabilization through Randomization -- Fast Self-stabilizing Minimum Spanning Tree Construction -- The Impact of Topology on Byzantine Containment in Stabilization -- Minimum Dominating Set Approximation in Graphs of Bounded Arboricity -- Brief Announcements IV (Session 3f) -- Brief Announcement: Sharing Memory in a Self-stabilizing Manner -- Brief Announcement: Stabilizing Consensus with the Power of Two Choices. |
520 ## - SUMMARY, ETC. |
Summary, etc |
This book constitutes the refereed proceedings of the 24th International Symposium on Distributed Computing, DISC 2010, held in Cambridge, CT, USA, in September 2010. The 32 revised full papers, selected from 135 submissions, are presented together with 14 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, and were organized in topical sections on, transactions, shared memory services and concurrency, wireless networks, best student paper, consensus and leader election, mobile agents, computing in wireless and mobile networks, modeling issues and adversity, and self-stabilizing and graph algorithms. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer science. |
|
Topical term or geographic name as entry element |
Computer Communication Networks. |
|
Topical term or geographic name as entry element |
Software engineering. |
|
Topical term or geographic name as entry element |
Computer software. |
|
Topical term or geographic name as entry element |
Information systems. |
|
Topical term or geographic name as entry element |
Artificial intelligence. |
|
Topical term or geographic name as entry element |
Computer Science. |
|
Topical term or geographic name as entry element |
Computer Communication Networks. |
|
Topical term or geographic name as entry element |
Software Engineering. |
|
Topical term or geographic name as entry element |
Information Systems Applications (incl.Internet). |
|
Topical term or geographic name as entry element |
Algorithm Analysis and Problem Complexity. |
|
Topical term or geographic name as entry element |
Programming Techniques. |
|
Topical term or geographic name as entry element |
Artificial Intelligence (incl. Robotics). |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Shvartsman, Alexander A. |
Relator term |
editor. |
710 2# - ADDED ENTRY--CORPORATE NAME |
Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY |
Title |
Springer eBooks |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
Display text |
Printed edition: |
International Standard Book Number |
9783642157622 |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-15763-9 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Item type |
E-Book |