How helpers hasten h-Relations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 392-402

  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

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

DISTRIBUTED-MEMORY PARALLEL COMPUTERS; FILE TRANSFERS; MESSAGE EXCHANGE; TIME STEP;

ARTIFICIAL INTELLIGENCE; PROBLEM SOLVING;

EID: 84927559337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_36     Document Type: Article

References (22)

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, pages 3-16, 1991. 401
2. E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. LaPaugh. Scheduling file transfers. SIAM Journal on Computing, 14(3):744-780, 1985. 392, 393
3. R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(E log D) time. submitted for publication, 2000. 395
4. H. N. Gabow and O. Kariv. Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal on Computing, 11(1):117-129, 1982. 393
5. L. A. Goldberg, M. Jerrum, T. Leighton, and S. Rao. Doubly logarithmic communication algorithms for optical-communication parallel computers. SIAM Journal on Computing, 26(4):1100-1119, August 1997. 394
6. M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Processing, 54:77-132, 1998. 392
7. F. Harary. Graph Theory. Addison Wesley, 1969. 393, 401
8. D. S. Hochbaum, T. Nishizeki, and D. B. Shmoys. A better than "best possible" algorithm to edge color multigraphs. Journal ofAlgorithms, 7:79-104, 1986. 393
9. Ian Holyer. The NP-completeness of edge-coloring. SIAM Journal on Computing, 10(4):718-720, 1981. 393
10. A. Kapoor and R. Rizzi. Edge-coloring bipartite graphs. Journal of Algorithms, 34(2):390-396, 2000. 399
11. D. Konig. Theorie der endlichen und unendlichen Graphen. Akademische Verlagsgesellschaft, 1936. 401
12. M. Kubale. Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. European Journal of Operational Research, 94:242-251, 1996. 392
13. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing. Design and Analysis of Algorithms. Benjamin/Cummings, 1994. 400
14. G. Lev, N. Pippenger, and L. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Trans. on Comp., C-30, 2:93-100, 1981. 393
15. W. Liu, C. Wang, and K. Prasanna. Portable and scalable algorithms for irregular all-to-all communication. In 16th ICDCS, pages 428-435. IEEE, 1996. 393, 394, 401
16. S. Nakano, X. Zhou, and T. Nishizeki. Edge-coloring algorithms. In Computer Science Today, number 1000 in LNCS, pages 172-183. Springer, 1996. 393
17. T. Nishizeki and M. Sato. An algorithm for edge-coloring multigraphs. Trans. Inst. Electronics and Communication Eng., J67-D(4):466-471, 1984. (in Japanese). 393
18. Takao Nishizeki and Kenichi Kashiwagi. On the 1.1 edge-coloring of multigraphs. SIAM Journal on Discrete Mathematics, 3(3):391-410, August 1990. 392, 393, 400
19. M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra. MPI -the Complete Reference. MIT Press, 1996. 392
20. 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, pages 263-277, Milwaukee, Wisconsin, 11-13 May 1981. 393, 394, 401
21. V. G. Vizing. On an estimate of the chromatic class of a p-graph (in russian). Diskret. Analiz, 3:23-30, 1964. 393
22. J. Whitehead. The complexity of file transfer scheduling with forwarding. SIAM Journal on Computing, 19(2):222-245, April 1990. 394