Please use this identifier to cite or link to this item:
|Title:||Divisible load scheduling on a hypercube cluster with finite-size buffers and granularity constraints|
Divisible load theory
|Citation:||Li, X., Veeravalli, B., Ko, C.C. (2001). Divisible load scheduling on a hypercube cluster with finite-size buffers and granularity constraints. Proceedings - 1st IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2001 : 660-667. ScholarBank@NUS Repository. https://doi.org/10.1109/CCGRID.2001.923257|
|Abstract:||In this paper we address the problem of scheduling a large size divisible load on a hypercube cluster of processors. Unlike in earlier studies in the divisible load theory (DLT) literature, here, we assume that the processors have finite-size buffers. Further we impose constraints on the extent to which the load can be divided, referred to as granularity constraint. We first present the closed-form solutions for the case with infinite-size buffers. For the case with load granularity constraint, we propose a simple algorithm to find the sub-optimal solution and then we analyze the case when these buffer are of finite size. For this case, we present an elegant strategy, referred to as incremental balancing strategy (IBS), to obtain an optimal load distribution. Based on the rigorous mathematical analysis, a number of interesting and useful properties exhibited by the algorithm are proven. Numerical examples are presented for the ease of understanding. © 2001 IEEE.|
|Source Title:||Proceedings - 1st IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2001|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 13, 2018
WEB OF SCIENCETM
checked on Nov 5, 2018
checked on Oct 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.