A delay optimal coterie on the k-dimensional folded Petersen graph

Authors:
P. C. Saxena;Sangita Gupta;Jagmohan Rai
Affiliations:
School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India;School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India;Department of Mathematics, P.G.D.A.V. College (E), University of Delhi, New Delhi, India
Venue:
Journal of Parallel and Distributed Computing
Year:
2003

Citing 14
Cited 2

How to assign votes in a distributed system

Journal of the ACM (JACM)
An efficient and fault-tolerant solution for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
A simple taxonomy for distributed mutual exclusion algorithms

ACM SIGOPS Operating Systems Review
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data

IEEE Transactions on Computers
A taxonomy of distributed mutual exclusion

Journal of Parallel and Distributed Computing
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
A Fault-Tolerant Algorithm for Replicated Data Management

IEEE Transactions on Parallel and Distributed Systems
Folded Petersen Cube Networks: New Competitors for the Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Delay-Optimal Quorum Consensus for Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data

IEEE Transactions on Knowledge and Data Engineering
Coterie Join Algorithm

IEEE Transactions on Parallel and Distributed Systems
Two New Quorum Based Algorithms for Distributed Mutual Exclusion

ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Cost Optimal Coteries

Cost Optimal Coteries

Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks

International Journal of Computer Mathematics
Research on petersen graphs and hyper-cubes connected interconnection networks

ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 10k 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, FPk. For any positive integer k, the coterie has message complexity 4k and delay k. Moreover, this coterie is not vote-assignable.