How Helpers Hasten h-Relations

Journal of Algorithms

Volumn 41, Issue 1, 2001, Pages 86-98

  Sanders, Peter ^a   Solis Oba, Roberto ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345861199     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1169     Document Type: Article

References (25)

1. G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha, A comparison of sorting algorithms for the connection machine CM-2, in "ACM Symposium on Parallel Architectures and Algorithms," pp. 3-16, 1991.
2. E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. LaPaugh, Scheduling file transfers, SIAM J. Comput. 14, No. 3 (1985), 744-780.
3. R. Cole, K. Ost, and S. Schirra, "Edge-Coloring Bipartite Multigraphs in O(E log D) Time," Combinatorica 21, No. 1 (2001), 5-12.
4. H. N. Gabow and O. Kariv, Algorithms for edge coloring bipartite graphs and multigraphs, SIAM J. Comput. 11, No. 1 (1982), 117-129.
5. L. A. Goldberg, M. Jerrum, T. Leighton, and S. Rao, Doubly logarithmic communication algorithms for optical-communication parallel computers, SIAM J. Comput. 26, No. 4 (1997), 1100-1119.
6. M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. Sibeyn, Packet routing in fixed-connection networks: A survey, J. Parallel Distrib. Process. 54 (1998), 77-132. doi: 10.1006/jpdc. 1998.1483.
7. J. Hall, J. Hartline, A. R. Karlin, J. Saia, and J. Wilkes, On algorithms for efficient data migration, in "12th ACM-SIAM Symposium on Discrete Algorithms," pp. 620-629, 2001.
8. F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1969.
9. D. S. Hochbaum, T. Nishizeki, and D. B. Shmoys, A better than "best possible" algorithm to edge color multigraphs, J. Algorithms 7 (1986), 79-104.
10. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10, No. 4 (1981), 718-720.
11. A. Kapoor and R. Rizzi, Edge-coloring bipartite graphs, J. Algorithms 34 (2000), 390-396, doi: 10.1006/jagm.1999.1058.
12. D. König, "Theorie der endlichen und unendlichen Graphen," Akad. Verlagsgetsellschaft, Frankfurt/Leipzig, 1936.
13. M. Kubale, Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors, European J. Operation. Res. 94 (1996), 242-251.
14. V. Kumar, A. Grama, A. Gupta, and G. Karypis, "Introduction to Parallel Computing. Design and Analysis of Algorithms," Benjamin-Cummings, Redwood City, CA, 1994.
15. G. Lev, N. Pippenger, and L. Valiant, A fast parallel algorithm for routing in permutation networks, IEEE Trans. Comput. C-30, No. 2 (1981), 93-100.
16. W. Liu, C. Wang, and K. Prasanna, Portable and scalable algorithms for irregular all-to-all communication, in "16th ICDCS," pp. 428-435, IEEE Press, New York, 1996.
17. S. Nakano, X. Zhou, and T. Nishizeki, Edge-coloring algorithms, in "Computer Science Today," Lecture Notes in Computer Science, No. 1000, pp. 172-183. Springer-Verlag, Berlin/New York, 1996.
18. T. Nishizeki and M. Sato, An algorithm for edge-coloring multigraphs, Trans. Inst. Electron. Comm. Engrg. J67-D, No. 4 (1984), 466-471 [in Japanese].
19. T. Nishizeki and K. Kashiwagi, On the 1.1 edge-coloring of multigraphs, SIAM J. Discrete Math. 3, No. 3 (1990), 391-410.
20. R. Reussner, P. Sanders, L. Prechelt, and M. Müller, SKaMPI: A detailed, accurate MPI benchmark, in "EuroPVM/MPI," Lecture Notes in Computer Science, No. 1497, pp. 52-59, 1998; result database at http://liinwww.ira.uka.de/skampi.
21. P. Sanders and R. Solis-Oba, "How Helpers Hasten h-relations," Technical Report 559, the University of Western Ontario, Department of Computer Science, March 2001.
22. M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra, "MPI - The Complete Reference," MIT Press, Cambridge, MA, 1996.
23. L. G. Valiant and G. J. Brebner, Universal schemes for parallel communication, in "Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation," pp. 263-277, Milwaukee, Wisconsin, 1981.
24. V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz. 3 (1964), 23-30. [in Russian]
25. J. Whitehead, The complexity of file transfer scheduling with forwarding, SIAM J. Comput. 19, No. 2 (1990), 222-245.