000			05356nam a22005895i 4500
001			978-3-642-17653-1
003			DE-He213
005			20140220084551.0
007			cr nn 008mamaa
008			101206s2010 gw | s |||| 0|eng d
020			_a9783642176531 _9978-3-642-17653-1
024	7		_a10.1007/978-3-642-17653-1 _2doi
050		4	_aTK5105.5-5105.9
072		7	_aUKN _2bicssc
072		7	_aCOM075000 _2bisacsh
082	0	4	_a004.6 _223
100	1		_aLu, Chenyang. _eeditor.
245	1	0	_aPrinciples of Distributed Systems _h[electronic resource] : _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, 517p. 112 illus. _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 ; _v6490
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.
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aSoftware engineering.
650		0	_aComputer software.
650		0	_aComputational complexity.
650		0	_aAlgebra _xData processing.
650		0	_aArtificial intelligence.
650	1	4	_aComputer Science.
650	2	4	_aComputer Communication Networks.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aSoftware Engineering.
650	2	4	_aArtificial Intelligence (incl. Robotics).
650	2	4	_aSymbolic and Algebraic Manipulation.
700	1		_aMasuzawa, Toshimitsu. _eeditor.
700	1		_aMosbah, Mohamed. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642176524
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6490
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-17653-1
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c112945 _d112945