Buch, Englisch, Band 312, 432 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1370 g
2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987. Proceedings
Buch, Englisch, Band 312, 432 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1370 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-19366-1
Verlag: Springer Berlin Heidelberg
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung Client-Server Netzwerke
- Mathematik | Informatik EDV | Informatik Betriebssysteme Windows Betriebssysteme
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik Mathematik Algebra Elementare Algebra
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
Weitere Infos & Material
A distributed spanning tree algorithm.- Directed network protocols.- Fault tolerant queries in computer networks.- General and efficient decentralized consensus protocols.- A framework for agreement.- Byzantine firing squad using a faulty external source.- An improved multiple identification algorithm for synchronous broadcasting networks.- Distributed algorithms for tree pattern matching.- On the packet complexity of distributed selection.- Load balancing in a network of transputers.- Experience with a new distributed termination detection algorithm.- A distributed deadlock avoidance technique.- How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion.- Verification of connection-management protocols.- Generalized scheme for topology-update in dynamic networks.- Local fail-safe network reset procedure.- Synchronizing asynchronous bounded delay networks.- A modular proof of correctness for a network synchronizer.- On the use of synchronizers for asynchronous communication networks.- Atomic multireader register.- An optimistic resiliency control scheme for distributed database systems.- A failsafe scheme for replicated information.- Randomized function evaluation on a ring.- A distributed ring orientation algorithm.- Constructing efficient election algorithms from efficient traversal algorithms.- Optimal resilient ring election algorithms.- Fault-tolerant distributed algorithm for election in complete networks.- Lower bounds for synchronous networks and the advantage of local information.- On the existence of generic broadcast algorithms in networks of Communicating Sequential Processes.- Stepwise removal of virtual channels in distributed algorithms.