Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICON.2011.6168521
DC Field | Value | |
---|---|---|
dc.title | Scheduling hybrid divisible and indivisible loads on clusters | |
dc.contributor.author | Hu, M. | |
dc.contributor.author | Veeravalli, B. | |
dc.date.accessioned | 2014-06-19T03:26:54Z | |
dc.date.available | 2014-06-19T03:26:54Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | Hu, M.,Veeravalli, B. (2011). Scheduling hybrid divisible and indivisible loads on clusters. ICON 2011 - 17th IEEE International Conference on Networks : 141-146. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ICON.2011.6168521" target="_blank">https://doi.org/10.1109/ICON.2011.6168521</a> | |
dc.identifier.isbn | 9781457718250 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/71713 | |
dc.description.abstract | Divisible load applications occur in many fields of science and engineering. Such applications can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. In this paper we investigate the scheduling problem for processing a set of tasks comprising both divisible and indivisible tasks on cluster systems. Indivisible loads are characterized by the property that they need to be processed on their entirety on a single processor while divisible loads can be distributed across several processing nodes by fully exploiting the underlying data parallelism. We propose a novel scheduling algorithm referred to as Hybrid Load Scheduling (HLS) algorithm for handling a set of tasks comprising both divisible and indivisible tasks on clusters. HLS fully exploits the parallelism in divisible loads to achieve high resource utilization. It also utilizes a pipelining technique to hide communication time and thus further optimize the overall performance. Simulations are presented to evaluate and compare the performance of the proposed strategy. © 2011 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICON.2011.6168521 | |
dc.source | Scopus | |
dc.subject | cluster computing | |
dc.subject | communication delay | |
dc.subject | Divisible loads | |
dc.subject | parallel processing | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1109/ICON.2011.6168521 | |
dc.description.sourcetitle | ICON 2011 - 17th IEEE International Conference on Networks | |
dc.description.page | 141-146 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.