loading...
Data Partitioning with a Realistic Performance Model of Networks of Heterogeneous Computers with Task Size Limits
Cork, Ireland July 05-July 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.17Third International Symposium on Para ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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
Usage of this product signifies your acceptance of the Terms of Use.