Distributed Algorithms [electronic resource] : 2nd International Workshop Amsterdam, The Netherlands, July 8–10, 1987 Proceedings / edited by J. Leeuwen.

By: Leeuwen, J [editor.]Contributor(s): SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 312Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1988Description: VII, 432 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540392392Subject(s): Mathematics | Operating systems (Computers) | Data structures (Computer science) | Computer software | Database management | Computer graphics | Combinatorics | Mathematics | Combinatorics | Algorithm Analysis and Problem Complexity | Data Structures | Computer Graphics | Operating Systems | Database ManagementAdditional physical formats: Printed edition:: No titleDDC classification: 511.6 LOC classification: QA164-167.2Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: This volume presents the proceedings of the 2nd International Workshop on Distributed Algorithms, held July 8-10, 1987, in Amsterdam, The Netherlands. It contains 29 papers on new developments in the area of the design and analysis of distributed algorithms. The topics covered include, e.g. algorithms for distributed consensus and agreement in networks, connection management and topology update schemes, election and termination detection protocols, and other issues in distributed network control.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

This volume presents the proceedings of the 2nd International Workshop on Distributed Algorithms, held July 8-10, 1987, in Amsterdam, The Netherlands. It contains 29 papers on new developments in the area of the design and analysis of distributed algorithms. The topics covered include, e.g. algorithms for distributed consensus and agreement in networks, connection management and topology update schemes, election and termination detection protocols, and other issues in distributed network control.

There are no comments on this title.

to post a comment.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha