Repository logo
 

Robust static allocation of resources for independent tasks under makespan and dollar cost constraints

Simple item page
dc.contributor.authorPippin, Alan, author
dc.contributor.authorRaskey, Michael, author
dc.contributor.authorGuru, Kumara, author
dc.contributor.authorLee, Panho, author
dc.contributor.authorAydin, Mahir, author
dc.contributor.authorZhang, Junxing, author
dc.contributor.authorAli, Syed, author
dc.contributor.authorKrishnamurthy, Yogish, author
dc.contributor.authorAl-Otaibi, Mohammad, author
dc.contributor.authorShestak, Vladimir, author
dc.contributor.authorHoriuchi, Aaron, author
dc.contributor.authorPichel, Ron, author
dc.contributor.authorMehta, Ashish, author
dc.contributor.authorOltikar, Mohana, author
dc.contributor.authorMaciejewski, Anthony A., author
dc.contributor.authorSiegel, H. J., author
dc.contributor.authorSugavanam, Prasanna, author
dc.contributor.authorElsevier Inc., publisher
dc.date.accessioned2007-01-03T08:09:34Z
dc.date.available2007-01-03T08:09:34Z
dc.date.issued2006
dc.description.abstractHeterogeneous computing (HC) systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be inaccuracies in the estimation of task execution times. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that needs to be optimized in such systems. Resource allocation is typically performed 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. In this research, the problem of finding a static mapping of tasks to maximize the robustness of makespan against the errors in task execution time estimates given an overall makespan constraint is studied. Two variations of this basic problem are considered: (1) where there is a given, fixed set of machines, (2) where an HC system is to be constructed from a set of machines within a dollar cost constraint. Six heuristic techniques for each of these variations of the problem are presented and evaluated.
dc.format.mediumborn digital
dc.format.mediumarticles
dc.identifier.bibliographicCitationSugavanam, Prasanna, et al., Robust Static Allocation of Resources for Independent Tasks under Makespan and Dollar Cost Constraints, Journal of Parallel and Distributed Computing 67, no. 4 (April 2007): [400]-416.
dc.identifier.urihttp://hdl.handle.net/10217/67371
dc.languageEnglish
dc.language.isoeng
dc.publisherColorado State University. Libraries
dc.relation.ispartofFaculty Publications
dc.rights©2006 Elesevier Inc.
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.subjectheterogeneous computing
dc.subjectrobustness
dc.subjectresource allocation
dc.subjectmakespan
dc.subjectcost constraint
dc.titleRobust static allocation of resources for independent tasks under makespan and dollar cost constraints
dc.typeText

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ECEaam00048.pdf
Size:
1.31 MB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Faculty Publications