An experimental study of a simple, distributed edge-coloring algorithm

ACM Journal of Experimental Algorithmics

Volumn 9, Issue , 2004, Pages

  Marathe, Madhav V ^a   Panconesi, Alessandro ^b   Risinger, Larry D ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Distributed algorithms; Edge coloring; Experimental analysis of algorithms; High performance computing; Randomized algorithms; Scheduling

Indexed keywords

EID: 84927751005     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1005813.1041515     Document Type: Article

References (15)

1. rd European Symposium on Algorithms (ESA 95).
2. DURAND, D., JAIN, R., AND TSEYTLIN, D. 1994. Distributed Scheduling Algorithms to Improve the Performance of Parallel Data Transfers. In ACM SIGARCH Computer Architecture News. ACM Press, 35-40. Special issue on Input/Output in Parallel Computer Systems.
3. rd European Symposium on Algorithms (ESA 95).
4. th SIAM Conference on Parallel Processing for Scientific Computing.
5. FINOCCHI, I., PANCONESI, A., AND SILVESTRI, R. 2002. An experimental study of simple, distributed vertex colouring algorithms. In Proceedings of the Thirteenth ACM-SIAM Symposium on Discrete Algorithms (SODA 02). ACM Press, 245-269. To appear in Algorithmica.
6. GABOW, H. AND KARIV, O. 1982. Algorithms for edge-coloring bipartite graphs and multigraphs. SIAM J. Comput. 1, 11, 117-129.
7. GRABLE, D. AND PANCONESI, A. 1997. Nearly optimal distributed edge-coloring in o(log log n) rounds. RSA 10, 3 (May), 385-405.
8. th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997, pp. 278-285.
9. HOCHBAUM, D., Eds. 1997. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA.
10. HOYLER, I. 1980. The NP-completeness of edge colorings. SIAM J. Comput. 10, 718-720.
11. JAIN, R., SOMALWAR, K., WERTH, J., AND BROWNE, J. 1992a. Scheduling parallel I/O operations in multiple bus systems. J. Parallel Distrib. Comput. 16, 4, 352-362.
12. JAIN, R., WERTH, J., BROWNE, J., AND SASAKI, G. 1992b. A graph-theoretic model for the scheduling problem and its application to simultaneous resource scheduling. In Computer Science and Operations Research: New Developments in Their Interfaces. O. Balci, R. Shander, and S. Zerrick, Eds. Penguin Press.
13. JAIN, R. AND WERTH, J. 1995. Analysis of approximate algorithms for edge-coloring bipartite graphs. IPL 54, 3, 163-168.
14. th SIAM Conference on Parallel Processing for Scientific Comput. LANL Report LA-UR-97-30, 14-17.
15. PANCONESI, A. AND SRINIVASAN, A. 1992. Fast randomized algorithms for distributed edge coloring. SIAM J. Comput. 26, 2, 350-368. Also in Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) 1992.