000 | 04906nam a22003975i 4500 | ||
---|---|---|---|
001 | 302809 | ||
003 | MX-SnUAN | ||
005 | 20160429155800.0 | ||
007 | cr nn 008mamaa | ||
008 | 150903s2010 gw | o |||| 0|eng d | ||
020 |
_a9783642176531 _99783642176531 |
||
024 | 7 |
_a10.1007/9783642176531 _2doi |
|
035 | _avtls000356280 | ||
039 | 9 |
_a201509030548 _bVLOAD _c201405060403 _dVLOAD _y201402191215 _zstaff |
|
040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
050 | 4 | _aTK5105.5-5105.9 | |
100 | 1 |
_aLu, Chenyang. _eeditor. _9341215 |
|
245 | 1 | 0 |
_aPrinciples of Distributed Systems : _b14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings / _cedited by Chenyang Lu, Toshimitsu Masuzawa, Mohamed Mosbah. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
300 |
_axii, 517 páginas 112 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 ; _v6490 |
|
500 | _aSpringer eBooks | ||
505 | 0 | _aRobots -- Pattern Formation through Optimum Matching by Oblivious CORDA Robots -- RoboCast: Asynchronous Communication in Robot Networks -- Randomization in Distributed Algorithms -- Biased Selection for Building Small-World Networks -- Application of Random Walks to Decentralized Recommender Systems -- Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes -- Brief Announcements I -- Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths -- Self-stabilizing Byzantine Asynchronous Unison, -- Graph Algorithms -- Reliably Detecting Connectivity Using Local Graph Traits -- Distributed Game-Theoretic Vertex Coloring -- Constructing a Map of an Anonymous Graph: Applications of Universal Sequences -- Brief Announcements II -- Effect of Fairness in Model Checking of Self-stabilizing Programs -- A Formal Framework for Conformance Testing of Distributed Real-Time Systems -- Fault-Tolerance -- Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value -- A Fault Avoidance Strategy Improving the Reliability of the EGI Production Grid Infrastructure -- Failure Detectors Encapsulate Fairness -- -Based k-Set Agreement Algorithms -- Distributed Programming -- Distributed Programming with Tasks -- SkewCCC+: A Heterogeneous Distributed Hash Table -- On the Automated Implementation of Time-Based Paxos Using the IOA Compiler -- Real-Time -- Partitioning Real-Time Systems on Multiprocessors with Shared Resources -- On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors -- Tardiness Bounds for Global EDF with Deadlines Different from Periods -- Shared Memory -- Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency -- An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects -- Efficient Lock Free Privatization -- A Competitive Analysis for Balanced Transactional Memory Workloads -- Concurrency -- Fast Local-Spin Abortable Mutual Exclusion with Bounded Space -- Turning Adversaries into Friends: Simplified, Made Constructive, and Extended -- Quasi-Linearizability: Relaxed Consistency for Improved Concurrency -- A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem -- On the Message Complexity of Global Computations -- Optimizing Regenerator Cost in Traffic Grooming -- On Minimizing Average End-to-End Delay in P2P Live Streaming Systems -- Monotonic Stabilization -- Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol -- Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. | |
520 | _aThis book constitutes the refereed proceedings of the 14th International Conference on Principles of Distributed Systems, OPODIS 2010, held in Tozeur, Tunisia, in December 2010. The 32 full papers and 4 brief announcements presented were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections on robots; randomization in distributed algorithms; brief announcements; graph algorithms; fault-tolerance; distributed programming; real-time; shared memory; and concurrency. | ||
590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
700 | 1 |
_aMasuzawa, Toshimitsu. _eeditor. _9326606 |
|
700 | 1 |
_aMosbah, Mohamed. _eeditor. _9341216 |
|
710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
776 | 0 | 8 |
_iEdición impresa: _z9783642176524 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-17653-1 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c302809 _d302809 |