Efficient leader election in asynchronous networks of the order three /
algorithm for bounded degree asynchronous networks of the
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1994.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | algorithm for bounded degree asynchronous networks of the an algorithm that answer the question in the affirmative. are also election algorithms for asynchronous mesh networks, distributed data system, and to replace a primary site in a election algorithm with message complexity 0(n) for a network Election is the problem of choosing a unique processor as the exactly k processors. There are several known election leader of a network. Such an election is very important in malfunctioning or crashed central lock coordinator in a natural question arises, therefore, if there exits any networks, for concurrency control, to replace a of the order k if each of the processors is connected to of the order three. In this thesis, we develop a network and order two. In general, the algorithms for all these networks replicated file system. A network of processors is said to be require a message complexity of 0(n log n) messages. There token regeneration in token ring, token bus, and FDDI which are of the order four, that require 0(n) messages. A |
|---|---|
| Item Description: | "Major subject: Electrical Engineering". Vita. |
| Physical Description: | vii, 48 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references. |