Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04)
Data Partitioning with a Realistic Performance Model of Networks of Heterogeneous Computers with Task Size Limits
Cork, Ireland
July 05-July 07
ISBN: 0-7695-2210-6
The paper presents a performance model that can be used to optimally schedule arbitrary tasks on a network of heterogeneous computers when there is an upper bound on the size of the task that can be solved by each computer. We formulate a problem of partitioning of an n-element set over p heterogeneous processors using this advanced performance model and give its efficient solution of the complexity 0(p^3 x\log _2 n).
Index Terms:
Heterogeneous (hybrid) systems, Scheduling and task partitioning, Load balancing and task assignment
Citation:
Alexey Lastovetsky, Ravi Reddy, "Data Partitioning with a Realistic Performance Model of Networks of Heterogeneous Computers with Task Size Limits," ispdc, pp.133-140, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (ISPDC/HeteroPar'04), 2004