Pınar, A.Aykanat, Cevdet2016-02-082016-02-0820040743-73151096-0848http://hdl.handle.net/11693/24250The one-dimensional decomposition of nonuniform workload arrays with optimal load balancing is investigated. The problem has been studied in the literature as the "chains-on-chains partitioning" problem. Despite the rich literature on exact algorithms, heuristics are still used in parallel computing community with the "hope" of good decompositions and the "myth" of exact algorithms being hard to implement and not runtime efficient. We show that exact algorithms yield significant improvements in load balance over heuristics with negligible overhead. Detailed pseudocodes of the proposed algorithms are provided for reproducibility. We start with a literature review and propose improvements and efficient implementation tips for these algorithms. We also introduce novel algorithms that are asymptotically and runtime efficient. Our experiments on sparse matrix and direct volume rendering datasets verify that balance can be significantly improved by using exact algorithms. The proposed exact algorithms are 100 times faster than a single sparse-matrix vector multiplication for 64-way decompositions on the average. We conclude that exact algorithms with proposed efficient implementations can effectively replace heuristics. © 2004 Elsevier Inc. All rights reserved.EnglishChains-on-chains partitioningDynamic programmingImage-space parallel volume renderingIterative refinementOne-dimensional partitioningOptimal load balancingParallel sparse matrix vector multiplicationParametric searchAlgorithmsDynamic programmingGraph theoryHeuristic methodsMatrix algebraVectorsOne-dimensional partitioningOptimal load balancingParallel sparse matrix vector multiplicationParallel processing systemsArticle10.1016/j.jpdc.2004.05.003