A Scheme for Partitioning Regular Graphs
In this paper we investigate partitioning algorithms for one class of regular graphs. An example of such problem is given for a system of PDE equations, which describe the nonlinear interaction of laser waves in nonlinear media. Parallelization of the algorithm is done using data parallelism paradigm. First we present optimal static mesh decomposition and investigate its effectivity. Then we propose one heuristic for dynamic load balancing. Results of numerical experiments are presented.
KeywordsLoad Balance Parallel Algorithm Regular Graph Task Graph Parallel Execution Time
Unable to display preview. Download preview PDF.
- 2.Čiegis, R., Starikovičius, V., Wasniewski, J.: On the efficiency of scheduling algorithms for parallel Gaussian elimination with communication delays. Lecture notes in computer science, volume 1947, PARA2000, The fifth workshop on Applied Parallel Computing, Editors T Surevik, F. Manne, R. Moe, A.H. Gebremedhin, Springer, 75–82 (2000).Google Scholar
- 3.Girdauskas, V., Dementjev, A., Kairytė, G., Čiegis, R.: Influence of the beam aberrations and Kerr nonlinearity of medium on the effectiveness and pulse quality of SBS-compressor. Lithuanian Journal of Physics, 37(1997) 319–326Google Scholar