A fully distributed linear time algorithm for cluster network decomposition

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

Volumn 16, Issue , 2004, Pages 548-553

  Derbel, B ^a   Mosbah, M ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Clustered representation; Distributed algorithm; Synchronizers

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; LINEAR SYSTEMS; SET THEORY; SYNCHRONIZATION; TREES (MATHEMATICS);

CLUSTERED REPRESENTATION; DISJOINT CLUSTERS; DISTRIBUTED ALGORITHMS; SYNCHRONIZERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 11844252566     PISSN: 10272658     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. S. Moran, & S. Snir, Simple and Efficient network decomposition and synchronization, Theoretical Computer Science, 243, 2000, 217-241.
2. D. Peleg, Distributed Computing: A Locality-Sensitive Approach, (SIAM Monographs on Discrete Mathematics and Applications, 2000).
3. L. Shabtay, & A. Segall, Low Complexity network Synchronization, 8th Int. Workshop on Distributed Algorithms, 1994, 223-237.
4. B. Awerbuch, & D. Peleg, Network synchronization with polylogarithmic overhead, 31st IEEE Symp. on Foundations of Computer Science, 1990, 503-513.
5. B. Awerbuch, A. V. Goldberg, M. Luby, & S. A. Poltkin, Network decomposition and locality in distributed computation, 30th IEEE Symp. on Foundations of Computer Science, 1989, 364-369.
6. B. Awerbuch, & D. Peleg, Routing with polynomial communication-space trade-off, SIAM Journal on Discrete Mathematics, 5, 1992, 151-162.
7. E. Cohen, Fast Algorithms For Constructing t-Spanners And Paths with Stretch t, SIAM Journal on Computing, 28, 1998, 210-236.
8. M. Elkin, & D. Peleg, (1+ε, β)-spanner constructions for general graphs, 33rd Annual ACM STOC, 2001, 173-182.
9. B. Awerbuch, & D. Peleg, Online tracking of mobile users, Journal of the ACM, 42, 1995, 1021-1058.
10. A. Panconesi, & A. Srinivasan, Improved distributed algorithms for coloring and network decomposition, 24th Annual ACM STOC, 1992, 581-592.
11. B. Awerbuch, Complexity of network synchronization, Journal of the ACM, 32, 1985, 804-823.
12. sd ACM-SIAM Symp. on Discrete Algorithms, 1991, 320-330.
13. B. Awerbuch, & D. Peleg, Sparse Partitions, 31st IEEE Symp. on Foundations of Computer Science, 1990, 514-522.
14. L. Cowen, On Local Representations of Graphs and networks, (Ph. D Thesis, 1993).
15. B. Awerbuch, B. Berger, L. Cowen, & D. Peleg, Near-linear time construction of sparse neighborhood covers, SIAM Journal on Computing, 28, 1998, 263-277.
16. B. Awerbuch, B. Berger, L. Cowen, & D. Peleg, Fast distributed network decompositions and covers, Journal of Parallel and Distributed Computing, 39, 1996, 105-114.
17. B. Awerbuch, S. Kutten, & D. Peleg, Competitive Distributed Job Scheduling, 24th ACM Symp. on Theory of Computing, 1992, 571-580.
18. 1+1/k) size for weighted graphs, 30th Int. Col. on Automata, Languages and Programming, 2003, 384-296.
19. M. Thorup, & U. Zwick, Approximate Distance Oracles, 33rd Annual ACM STOC, 2001, 183-192.
20. Y. Metivier, M. Mosbah, P.A. Warcenier, & S. Gruner, A Distributed Algorithm for Computing a Spanning Tree in Anonymous T-prime Graphs, Studia Informatica Universalis, 2, 2002, 141-157.
21. R.G. Gallager, P. A. Humblet, & P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, 5(1), 1983, 66-77.
22. B. Derbel, & M. Mosbah, A linear time algorithm for graph decomposition, Technical Report RR-1315-04, LaBRI, 2004.