A delay optimal coterie on the k-dimensional folded Petersen graph
✍ Scribed by P.C. Saxena; Sangita Gupta; Jagmohan Rai
- Book ID
- 104344691
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 245 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
✦ Synopsis
Coteries are an effective tool for enforcing mutual exclusion in distributed systems. Communication delay is an important metric to measure the performance of a coterie. The topology of the interconnection network in a distributed system also has an impact on its performance. The k-dimensional folded Petersen graph, a graph with 10 k nodes and diameter 2k; qualifies as a good network topology for large distributed systems. In this paper, we present a delay optimal coterie on the k-dimensional folded Petersen graph, FP k : For any positive integer k; the coterie has message complexity 4 k and delay k: Moreover, this coterie is not vote-assignable.