000 06310nam a22003855i 4500
001 303248
003 MX-SnUAN
005 20160429155816.0
007 cr nn 008mamaa
008 150903s2010 gw | o |||| 0|eng d
020 _a9783642157639
_99783642157639
024 7 _a10.1007/9783642157639
_2doi
035 _avtls000355818
039 9 _a201509031003
_bVLOAD
_c201405060356
_dVLOAD
_y201402191203
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aTK5105.5-5105.9
100 1 _aLynch, Nancy A.
_eeditor.
_9341780
245 1 0 _aDistributed Computing :
_b24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings /
_cedited by Nancy A. Lynch, Alexander A. Shvartsman.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _axv, 532 páginas 85 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6343
500 _aSpringer eBooks
505 0 _aThe 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 _aThis 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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aShvartsman, Alexander A.
_eeditor.
_9304891
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642157622
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-15763-9
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c303248
_d303248