Algorithms for scheduling with applications to parallel computing

Abstract Scheduling of message passing for synchronous communication is found to be equivalent to colouring the edges of a graph without conflict. The graph edge-colouring problem, which has other applications, is studied. An algorithm which colours the graph with no more than deg + 1 colours, where deg is the degree of the graph, is implemented. The problem of minimising the sum of the largest weight for each colour is also investigated and an algorithm suggested. These algorithms are used to organise the communication as part of a finite element Euler solver. Different communication schemes and their effect on the performance of the flow solver are compared.

[1]  Ronald J. Gould,et al.  Graph theory , 1988 .

[2]  Anthony J. G. Hey,et al.  The genesis distributed memory benchmarks. Part 2: COMMS1, TRANS1, FFT1 and QCD2 benchmarks on the suprenum and IPSC/860 computers , 1995, Concurr. Pract. Exp..

[3]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[4]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[5]  Vipin Kumar,et al.  Parallel multilevel graph partitioning , 1996, Proceedings of International Conference on Parallel Processing.

[6]  Y. F. Hu,et al.  Numerical Experiences with Partitioning of Unstructured Meshes , 1994, Parallel Comput..

[7]  Steven J. Plimpton,et al.  Parallel Algorithms for Dynamically Partitioning Unstructured Grids , 1995, PPSC.

[8]  Bruce Hendrickson,et al.  The Chaco user`s guide. Version 1.0 , 1993 .

[9]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[10]  Martin G. Everett,et al.  Dynamic Load-Balancing for Parallel Adaptive Unstructured Meshes , 1997, PP.

[11]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..

[12]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[13]  Charbel Farhat,et al.  A simple and efficient automatic fem domain decomposer , 1988 .

[14]  Vipin Kumar,et al.  Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.