000 | 05834nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-92221-6 | ||
003 | DE-He213 | ||
005 | 20160624102126.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540922216 _9978-3-540-92221-6 |
||
024 | 7 |
_a10.1007/978-3-540-92221-6 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUT _2bicssc |
|
072 | 7 |
_aCOM069000 _2bisacsh |
|
072 | 7 |
_aCOM032000 _2bisacsh |
|
082 | 0 | 4 |
_a005.7 _223 |
245 | 1 | 0 |
_aPrinciples of Distributed Systems _h[electronic resource] : _b12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings / _cedited by Theodore P. Baker, Alain Bui, Sébastien Tixeuil. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2008. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2008. |
|
300 |
_aXIV, 580 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v5401 |
|
505 | 0 | _aInvited Talks -- The Next 700 BFT Protocols -- On Replication of Software Transactional Memories -- Regular Papers -- Write Markers for Probabilistic Quorum Systems -- Byzantine Consensus with Unknown Participants -- With Finite Memory Consensus Is Easier Than Reliable Broadcast -- Group Renaming -- Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38% -- Deadline Monotonic Scheduling on Uniform Multiprocessors -- A Comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT -- A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots -- Fault-Tolerant Flocking in a k-Bounded Asynchronous System -- Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks -- Degree 3 Suffices: A Large-Scale Overlay for P2P Networks -- On the Time-Complexity of Robust and Amnesic Storage -- Graph Augmentation via Metric Embedding -- A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness -- The 0–1-Exclusion Families of Tasks -- Interval Tree Clocks -- Ordering-Based Semantics for Software Transactional Memory -- CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks -- Impact of Information on the Complexity of Asynchronous Radio Broadcasting -- Distributed Approximation of Cellular Coverage -- Fast Geometric Routing with Concurrent Face Traversal -- Optimal Deterministic Remote Clock Estimation in Real-Time Systems -- Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms -- Revising Distributed UNITY Programs Is NP-Complete -- On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots -- Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring -- Rendezvous of Mobile Agents When Tokens Fail Anytime -- Solving Atomic Multicast When Groups Crash -- A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence -- Leader Election in Extremely Unreliable Rings and Complete Networks -- Toward a Theory of Input Acceptance for Transactional Memories -- Geo-registers: An Abstraction for Spatial-Based Distributed Computing -- Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets -- Load-Balanced and Sybil-Resilient File Search in P2P Networks -- Computing and Updating the Process Number in Trees -- Redundant Data Placement Strategies for Cluster Storage Environments -- An Unreliable Failure Detector for Unknown and Mobile Networks -- Efficient Large Almost Wait-Free Single-Writer Multireader Atomic Registers -- A Distributed Algorithm for Resource Clustering in Large Scale Platforms -- Reactive Smart Buffering Scheme for Seamless Handover in PMIPv6 -- Uniprocessor EDF Scheduling with Mode Change. | |
520 | _aThis book constitutes the refereed proceedings of the 12th International Conference on Principles of Distributed Systems, OPODIS 2008, held in Luxor, Egypt, in December 2008. The 30 full papers and 11 short papers presented were carefully reviewed and selected from 102 submissions. The conference focused on the following topics: communication and synchronization protocols; distributed algorithms and multiprocessor algorithms; distributed cooperative computing; embedded systems; fault-tolerance, reliability and availability; grid and cluster computing; location- and context-aware systems; mobile agents and autonomous robots; mobile computing and networks; peer-to-peer systems and overlay networks; complexity and lower bounds; performance analysis of distributed systems; real-time systems; security issues in distributed computing and systems; sensor networks; specification and verification of distributed systems; and testing and experimentation with distributed systems. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer network architectures. | |
650 | 0 | _aInformation systems. | |
650 | 0 | _aElectronic data processing. | |
650 | 0 | _aInformation Systems. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aInformation Systems and Communication Service. |
650 | 2 | 4 | _aComputer Systems Organization and Communication Networks. |
650 | 2 | 4 | _aManagement of Computing and Information Systems. |
650 | 2 | 4 | _aComputing Methodologies. |
700 | 1 |
_aBaker, Theodore P. _eeditor. |
|
700 | 1 |
_aBui, Alain. _eeditor. |
|
700 | 1 |
_aTixeuil, Sébastien. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540922209 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v5401 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-92221-6 |
942 |
_2EBK8360 _cEBK |
||
999 |
_c37654 _d37654 |