000 | 03885nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-44783-2 | ||
003 | DE-He213 | ||
005 | 20160624101952.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1995 gw | s |||| 0|eng d | ||
020 |
_a9783540447832 _9978-3-540-44783-2 |
||
024 | 7 |
_a10.1007/BFb0022134 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYZG _2bicssc |
|
072 | 7 |
_aCOM037000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aDistributed Algorithms _h[electronic resource] : _b9th International Workshop, WDAG '95 Le Mont-Saint-Michel, France, September 13–15, 1995 Proceedings / _cedited by Jean-Michel Hélary, Michel Raynal. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1995. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1995. |
|
300 |
_aXII, 340 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 ; _v972 |
|
505 | 0 | _aThe triumph and tribulation of system stabilization -- Wait-free computing -- On real-time and non real-time distributed computing -- Theory and practice in distributed systems -- The inherent cost of strong-partial view-synchronous communication -- Revisiting the relationship between non-blocking atomic commitment and consensus -- Dissecting distributed coordination -- Optimal Broadcast with Partial Knowledge -- Multi-dimensional Interval Routing Schemes -- Data transmission in processor networks -- Distributed protocols against mobile eavesdroppers -- Universal constructions for large objects -- Load balancing: An exercise in constrained convergence -- Larchant-RDOSS: A distributed shared persistent memory and its garbage collector -- Broadcasting in hypercubes with randomly distributed Byzantine faults -- On the number of authenticated rounds in Byzantine Agreement -- Total ordering algorithms for asynchronous Byzantine systems -- A uniform self-stabilizing minimum diameter spanning tree algorithm -- Self-stabilization of wait-free shared memory objects -- Deterministic, constant space, self-stabilizing leader election on uniform rings -- Efficient detection of restricted classes of global predicates -- Faster possibility detection by combining two approaches. | |
520 | _aThis book constitutes the proceedings of the 9th International Workshop on Distributed Algorithms, WDAG '95, held in Le Mont-Saint-Michel, France in September 1995. Besides four invited contributions, 18 full revised research papers are presented, selected from a total of 48 submissions during a careful refereeing process. The papers document the progress achieved in the area since the predecessor workshop (LNCS 857); they are organized in sections on asynchronous systems, networks, shared memory, Byzantine failures, self-stabilization, and detection of properties. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aOperating systems (Computers). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aOperating Systems. |
650 | 2 | 4 | _aCombinatorics. |
700 | 1 |
_aHélary, Jean-Michel. _eeditor. |
|
700 | 1 |
_aRaynal, Michel. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540602743 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v972 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0022134 |
942 |
_2EBK4999 _cEBK |
||
999 |
_c34293 _d34293 |