Pınar, A.Tabak, E. K.Aykanat, Cevdet2016-02-082016-02-082008-110743-7315http://hdl.handle.net/11693/22984We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors is specified, and chain partitioning, where processor permutation is allowed. We present polynomial time algorithms to solve the chain-on-chain partitioning problem optimally, while we prove that the chain partitioning problem is NP-complete. Our empirical studies show that our proposed exact algorithms produce substantially better results than heuristics, while solution times remain comparable. © 2008 Elsevier Inc. All rights reserved.EnglishChain-on-chain partitioningDynamic programmingLoad balancingOne-dimensional partitioningParallel computingParametric searchHeuristic programmingNuclear propulsionParallel processing systemsPolynomial approximationChain partitioningEmpirical studiesExact algorithmsHeterogeneous systemsNon uniformNP-completeOptimal load balancingPolynomial-time algorithmsReal time systemsArticle10.1016/j.jpdc.2008.07.005