|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2005 IEEE International Conference on Cluster Computing
Robust Processor Allocation for Independent Tasks When Dollar Cost for Processors is a Constraint
Burlington, MA
September 27-September 30
ISBN: 0-7803-9485-2
| ASCII Text | x | ||
| P. Sugavanam, H.J. Siegel, A.A. Maciejewski, null Junxing Zhang, M. Shestak, M. Raskey, A. Pippin, R. Pichel, M. Oltikar, A. Mehta, null Panho Lee, Y. Krishnamurthy, A. Horiuchi, K. Guru, M. Aydin, M. Al-Otaibi, S. Ali, "Robust Processor Allocation for Independent Tasks When Dollar Cost for Processors is a Constraint," 2012 IEEE International Conference on Cluster Computing, pp. 1-10, 2005 IEEE International Conference on Cluster Computing, 2005. | |||
| BibTex | x | ||
| @article{ 10.1109/CLUSTR.2005.347023, author = {P. Sugavanam and H.J. Siegel and A.A. Maciejewski and null Junxing Zhang and M. Shestak and M. Raskey and A. Pippin and R. Pichel and M. Oltikar and A. Mehta and null Panho Lee and Y. Krishnamurthy and A. Horiuchi and K. Guru and M. Aydin and M. Al-Otaibi and S. Ali}, title = {Robust Processor Allocation for Independent Tasks When Dollar Cost for Processors is a Constraint}, journal ={2012 IEEE International Conference on Cluster Computing}, volume = {0}, year = {2005}, issn = {1552-5244}, pages = {1-10}, doi = {http://doi.ieeecomputersociety.org/10.1109/CLUSTR.2005.347023}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE International Conference on Cluster Computing TI - Robust Processor Allocation for Independent Tasks When Dollar Cost for Processors is a Constraint SN - 1552-5244 SP1 EP10 A1 - P. Sugavanam, A1 - H.J. Siegel, A1 - A.A. Maciejewski, A1 - null Junxing Zhang, A1 - M. Shestak, A1 - M. Raskey, A1 - A. Pippin, A1 - R. Pichel, A1 - M. Oltikar, A1 - A. Mehta, A1 - null Panho Lee, A1 - Y. Krishnamurthy, A1 - A. Horiuchi, A1 - K. Guru, A1 - M. Aydin, A1 - M. Al-Otaibi, A1 - S. Ali, PY - 2005 KW - task execution time estimates KW - robust processor allocation KW - distributed heterogeneous computing system KW - resource allocation KW - computation time estimates KW - makespan VL - 0 JA - 2012 IEEE International Conference on Cluster Computing ER - | |||
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. Different classes of machines used in such systems typically vary in dollar cost based on their computing efficiencies. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized. Resource allocation is often done based on estimates of the computation time of each task on each class of machines. Hence, it is important that makespan be robust against errors in computation time estimates. The dollar cost to purchase the machines for use can be a constraint such that only a subset of the machines available can be purchased. The goal of this study is to: (1) select a subset of all the machines available so that the cost constraint for the machines is satisfied, and (2) find a static mapping of tasks so that the robustness of the desired system feature, makespan, is maximized against the errors in task execution time estimates. Six heuristic techniques to this problem are presented and evaluated
Index Terms:
task execution time estimates, robust processor allocation, distributed heterogeneous computing system, resource allocation, computation time estimates, makespan
Citation:
P. Sugavanam, H.J. Siegel, A.A. Maciejewski, null Junxing Zhang, M. Shestak, M. Raskey, A. Pippin, R. Pichel, M. Oltikar, A. Mehta, null Panho Lee, Y. Krishnamurthy, A. Horiuchi, K. Guru, M. Aydin, M. Al-Otaibi, S. Ali, "Robust Processor Allocation for Independent Tasks When Dollar Cost for Processors is a Constraint," cluster, pp.1-10, 2005 IEEE International Conference on Cluster Computing, 2005
Usage of this product signifies your acceptance of the Terms of Use.
