Finding central sets of tree structures in synchronous distributed systems.
Conference
·
OSTI ID:945177
- Lafayette College, Easton, PA
- Plymouth State University, Plymouth, NH
- Mount Mercy College, Cedar Rapids, IA
- Chicago State University, Chicago, IL
Finding the central sets, such as center and median sets, of a network topology is a fundamental step in the design and analysis of complex distributed systems. This paper presents distributed synchronous algorithms for finding central sets in general tree structures. Our algorithms are distinguished from previous work in that they take only qualitative information, thus reducing the constants hidden in the asymptotic notation, and all vertices of the topology know the central sets upon their termination.
- Research Organization:
- Sandia National Laboratories
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 945177
- Report Number(s):
- SAND2004-4526C
- Country of Publication:
- United States
- Language:
- English
Similar Records
Minimizing phylogenetic number to find good evolutionary trees
Distributed algorithms for election in unidirectional and complete networks
Designing efficient algorithms for distributed systems
Conference
·
Mon May 01 00:00:00 EDT 1995
·
OSTI ID:70782
Distributed algorithms for election in unidirectional and complete networks
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5608910
Designing efficient algorithms for distributed systems
Thesis/Dissertation
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:6091377