Repository logo
 

Dynamic mapping in a heterogeneous environment with tasks having priorities and multiple deadlines

Simple item page
dc.contributor.authorYallampalli, Siva Sankar, author
dc.contributor.authorVangari, Praveen, author
dc.contributor.authorSripada, Siddhartha, author
dc.contributor.authorSharma, Ashish, author
dc.contributor.authorKaul, Aditya, author
dc.contributor.authorJoshi, Rohit S., author
dc.contributor.authorDilmaghani, Raheleh B., author
dc.contributor.authorRamakrishna, Chitta, author
dc.contributor.authorTideman, Sonja, author
dc.contributor.authorSchneider, Myron, author
dc.contributor.authorBruan, Tracy D., author
dc.contributor.authorMaciejewski, Anthony A., author
dc.contributor.authorSiegel, Howard Jay, author
dc.contributor.authorShivle, Sameer, author
dc.contributor.authorKim, Jong-Kook, author
dc.contributor.authorIEEE, publisher
dc.date.accessioned2007-01-03T04:37:42Z
dc.date.available2007-01-03T04:37:42Z
dc.date.issued2003
dc.description.abstractIn a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is essential to assign resources to tasks (match) and order the execution of tasks on each resource (schedule) in a manner that exploits the heterogeneity of the resources and tasks. The mapping (defined as matching and scheduling) of tasks onto machines with varied computational capabilities has been shown, in general, to be an NP-complete problem. Therefore, heuristic techniques to find a near-optimal solution to this mapping problem are required. Dynamic mapping is performed when the arrival of tasks is not known a priori. In the heterogeneous environment considered in this study, tasks arrive randomly, tasks are independent (i.e., no communication among tasks), and tasks have priorities and multiple deadlines. This research proposes, evaluates, and compares eight dynamic heuristics. The performance of the best heuristics is 83% of an upper bound.
dc.description.sponsorshipThis research was supported in part by the Colorado State University George T. Abell Endowment.
dc.format.mediumborn digital
dc.format.mediumproceedings (reports)
dc.identifier.bibliographicCitationKim, Jong-Kook, et al., Dynamic Mapping in a Heterogeneous Environment with Tasks Having Priorities and Multiple Deadlines, International Parallel and Distributed Processing Symposium: Proceedings, April 22-26, 2003, Nice, France: 15 p.
dc.identifier.urihttp://hdl.handle.net/10217/2450
dc.languageEnglish
dc.language.isoeng
dc.publisherColorado State University. Libraries
dc.relation.ispartofFaculty Publications
dc.rights©2003 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.subjectresource allocation
dc.subjectperformance evaluation
dc.subjectdistributed processing
dc.subjectscheduling
dc.titleDynamic mapping in a heterogeneous environment with tasks having priorities and multiple deadlines
dc.typeText

Files

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

Collections

Faculty Publications