Algorithms for scheduling with applications to parallel computing

Advances in Engineering Software

Volumn 28, Issue 9, 1997, Pages 563-572

  Hu, Y F ^a   Blake, R J ^a  

^a DARESBURY LABORATORY   (United Kingdom)

Author keywords

Communication time; Graph edge colouring; Grid partitioning; Message passing; Scheduling

Indexed keywords

DATA COMMUNICATION SYSTEMS; FINITE ELEMENT METHOD; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION;

GRAPH EDGE COLORING; GRID PARTITIONING;

PARALLEL ALGORITHMS;

EID: 0031338907     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-9978(97)00051-3     Document Type: Article

References (18)

1. Barnard, S. T. & Simon, H. D., Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 1994, 6, 101-117.
2. Diniz, P., Plimpton, S., Hendrickson, B. & Leland, R., Parallel algorithms for dynamically partitioning unstructured grids. In SIAM Proceedings Series 195, ed. D. H. Bailey, P. E. Bjorstad, Jr Gilbert, M. V. Mascagni, R. S. Schreiber, H. D. Simon, V. J. Torczon & J. T. Watson., SIAM, Philadelphia, 1995, pp. 615-620.
3. Farhat, C., A simple and efficient automatic FEM domain decomposer. Computer and Structures, 1988, 28, 579-602.
4. Gould, R., Graph Theory. The Benjamin/Cummings Publishing Company, 1988.
5. Hendrickson, B. & Leland, R., The Chaco User's Guide, Version 1.0. Technical Report SAND 93-2339, Sandia National Laboratories, Allbuquerque, NM, 1993.
6. Hey, A. J. G., Hockney, R., Getov, V., Wolton, I., Melin, J. & Allwright, J., The Genesis distributed memory benchmarks. Part 2: COMMS1, TRANS1, FFT1 and QCD2 benchmarks on the SUPERNUM and iPSC/860 computers. Concurrency: Practice and Experience, 1995, 7, 543-570.
7. Holyer, I., The NP-completeness of edge-colouring. SIAM Journal of Computing, 1981, 10, 718-720.
8. Hu, Y. F. & Blake, R. J., Numerical experiences with partitioning of unstructured meshes. Parallel Computing, 1994, 20, 815-829.
9. Karypis, G. & Kumar, V., Parallel multilevel graph partitioning. Technical Report, Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, 1995.
10. Karypis, G. & Kumar, V., Parallel multilevel k-way partitioning scheme for irregular graphs. Technical Report, Department of Computer Science, University of Minnesota, MN 55455, 1996.
11. Kernighan, B. W. & Lin, S., An efficient heuristic procedure for partitioning graphs. Bell Systems Tech. J., 1970, 49, 291-308.
12. Peiro, J., Peraire, J. & Morgan, K., FELISA System Version 1.0, User Manual.
13. Simon, H. D., Partitioning of unstructured problems for parallel processing. Computer Systems in Engineering, 1991, 2, 135-148.
14. Venkatakrishnan, V., Simon, H. D. & Barth, T. J., A MIMD implementation of a parallel Euler solver for unstructured grids. Journal of Supercomputing, 1992, 6, 117-137.
15. Vizing, V. G., On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz, 1964, 3, 25-30.
16. Walshaw, C., Cross, M. & Everett, M., A parallelisable algorithm for optimising unstructured mesh partitions. Technical Report 95/IM/03, University of Greenwich, London SE18 6PF, UK, 1995.
17. Walshaw, C., Cross, M. & Everett, M., Dynamic load balancing for parallel adaptive unstructured meshes. In Parallel Processing for Scientific Computing, ed. M. Heath et al. SIAM, Philadelphia, 1997.
18. Williams, R. D., Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Practice and Experience, 1991, 3, 457-481.