Implementation of election algorithm for asynchronous complete networks with intermittent link failures /
A network is complete if every processor has a direct communication channel to every other processor. We consider the election problem on complete asynchronous networks when the processors are reliable while some of the channels are subject to failure. In this thesis, we have implemented Lokre...
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1993.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
Internet
Link to OAKTrust copyRemote Storage
| Call Number: |
1993 Thesis K924 |
|
|---|---|---|
| Notes: |
Cushing Archival Copy (Library Use Only) |
|
| Call Number | Status | Get It |
| 1993 Thesis K924 | Available | |
Available Online
| Call Number: |
1993 Thesis K924 |
|
|---|---|---|
| Call Number | Status | Get It |
| 1993 Thesis K924 | Available | |