Repository logo
 

Processor allocation for tasks that is robust against errors in computation time estimates

Simple item page
dc.contributor.authorZhang, Junxing, author
dc.contributor.authorShestak, Vladimir Vladimirov, author
dc.contributor.authorRaskey, Michael, author
dc.contributor.authorPippin, Alan J., author
dc.contributor.authorPichel, Ron, author
dc.contributor.authorOltikar, Mohana, author
dc.contributor.authorMehta, Ashish, author
dc.contributor.authorLee, Panho, author
dc.contributor.authorKrishnamurthy, Yogish G., author
dc.contributor.authorHoriuchi, Aaron, author
dc.contributor.authorGuru, Kumara, author
dc.contributor.authorAydin, Mahir, author
dc.contributor.authorAl-Otaibi, Mohammad, author
dc.contributor.authorAli, Syed Amjad, author
dc.contributor.authorMaciejewski, Anthony A., author
dc.contributor.authorSiegel, Howard Jay, author
dc.contributor.authorSugavanam, Prasanna V., author
dc.contributor.authorIEEE, publisher
dc.date.accessioned2007-01-03T04:37:42Z
dc.date.available2007-01-03T04:37:42Z
dc.date.issued2005
dc.description.abstractHeterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures, higher than expected load, or inaccuracies in estimation of system parameters. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized in such systems. It is important that the makespan of a resource allocation (mapping) be robust against errors in task computation time estimates. The problem of optimally mapping tasks onto machines of a heterogeneous computing environment has been shown, in general, to be NP-complete. Therefore, heuristic techniques to find near optimal solutions to this mapping problem are required. The goal of this research is to 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. Seven heuristics to derive near-optimal solutions and an upper bound to this problem are presented and evaluated.
dc.description.sponsorshipThis research was supported by the Colorado State University Center for Robustness in Computer Systems (funded by the Colorado Commission on Higher Education Technology Advancement Group through the Colorado Institute of Technology), and by the Colorado State University George T. Abell Endowment.
dc.format.mediumborn digital
dc.format.mediumproceedings (reports)
dc.identifier.bibliographicCitationSugavanam, Prasanna V., et al., Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates, 19th International Parallel and Distributed Processing Symposium: Proceedings, April 4-8, 2005, Denver, Colorado: 14 p.
dc.identifier.urihttp://hdl.handle.net/10217/2451
dc.languageEnglish
dc.language.isoeng
dc.publisherColorado State University. Libraries
dc.relation.ispartofFaculty Publications
dc.rights©2005 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.subjectcomputational complexity
dc.subjectmultiprocessing systems
dc.subjectresource allocation
dc.titleProcessor allocation for tasks that is robust against errors in computation time estimates
dc.typeText

Files

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

Collections

Faculty Publications