Vai al contenuto principale della pagina
| Titolo: |
Distributed Algorithms [[electronic resource] ] : 9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. Proceedings / / edited by Jean-Michel Helary, Michel Raynal
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Edizione: | 1st ed. 1995. |
| Descrizione fisica: | 1 online resource (XII, 340 p.) |
| Disciplina: | 004/.36 |
| Soggetto topico: | Computers |
| Software engineering | |
| Computer programming | |
| Algorithms | |
| Computer communication systems | |
| Computation by Abstract Devices | |
| Theory of Computation | |
| Software Engineering/Programming and Operating Systems | |
| Programming Techniques | |
| Algorithm Analysis and Problem Complexity | |
| Computer Communication Networks | |
| Persona (resp. second.): | HelaryJean-Michel |
| RaynalMichel | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di contenuto: | The 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. |
| Sommario/riassunto: | This 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. |
| Titolo autorizzato: | Distributed algorithms ![]() |
| ISBN: | 3-540-44783-0 |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466151103316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |