Repository logo
 

Robust processor allocation for independent tasks when dollar cost for processors is a constraint

Simple item page
dc.contributor.authorAli, Syed, author
dc.contributor.authorAl-Otaibi, Mohammad, author
dc.contributor.authorAydin, Mahir, author
dc.contributor.authorGuru, Kumara, author
dc.contributor.authorHoriuchi, Aaron, author
dc.contributor.authorKrishnamurthy, Yogish, author
dc.contributor.authorLee, Panho, author
dc.contributor.authorMehta, Ashish, author
dc.contributor.authorOltikar, Mohana, author
dc.contributor.authorPichel, Ron, author
dc.contributor.authorPippin, Alan, author
dc.contributor.authorRaskey, Michael, author
dc.contributor.authorShestak, Vladimir, author
dc.contributor.authorZhang, Junxing, author
dc.contributor.authorMaciejewski, Anthony A., author
dc.contributor.authorSiegel, H. J., author
dc.contributor.authorSugavanam, Prasanna, author
dc.contributor.authorIEEE, publisher
dc.date.accessioned2007-01-03T08:09:38Z
dc.date.available2007-01-03T08:09:38Z
dc.date.issued2006
dc.description.abstractIn 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.
dc.format.mediumborn digital
dc.format.mediumproceedings (reports)
dc.identifier.bibliographicCitationSugavanam, Prasanna, et al., Robust Processor Allocation for Independent Tasks When Dollar Cost for Processors is a Constraint, [2005 IEEE International Conference on Cluster Computing (CLUSTER): Burlington, MA, 27-30 September, 2005]: 1-10.
dc.identifier.urihttp://hdl.handle.net/10217/67387
dc.languageEnglish
dc.language.isoeng
dc.publisherColorado State University. Libraries
dc.relation.ispartofFaculty Publications
dc.rights©2006 IEEE.
dc.rightsCopyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.
dc.titleRobust processor allocation for independent tasks when dollar cost for processors is a constraint
dc.typeText

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ECEaam00114.pdf
Size:
364.18 KB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Faculty Publications