DocumentCode
3142253
Title
Characterizing Task-Machine Affinity in Heterogeneous Computing Environments
Author
Al-Qawasmeh, Abdulla M. ; Maciejewski, Anthony A. ; Roberts, Rodney G. ; Siegel, Howard Jay
Author_Institution
Dept. of Electr. & Comput. Eng., Colorado State Univ., Fort Collins, CO, USA
fYear
2011
fDate
16-20 May 2011
Firstpage
34
Lastpage
44
Abstract
Many computing environments are heterogeneous, i.e., they consist of a number of different machines that vary in their computational capabilities. These machines are used to execute task types that vary in their computational requirements. Characterizing heterogeneous computing environments and quantifying their heterogeneity is important for many applications. In previous research, we have proposed preliminary measures for machine performance homogeneity and task-machine affinity. In this paper, we build on our previous work by introducing a complementary measure called the task difficulty homogeneity. Furthermore, we refine our measure of task-machine affinity to be independent of the task type difficulty measure and the machine performance homogeneity measure. We also give examples of how the measures can be used to characterize heterogeneous computing environments that are based on real world task types and machines extracted from the SPEC benchmark data.
Keywords
multiprocessing systems; task analysis; SPEC benchmark data; computational capabilities; heterogeneous computing; machine performance homogeneity measure; task difficulty homogeneity; task execution; task machine affinity; Benchmark testing; Computational modeling; Correlation; Equations; Mathematical model; Matrix converters; Matrix decomposition;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on
Conference_Location
Shanghai
ISSN
1530-2075
Print_ISBN
978-1-61284-425-1
Electronic_ISBN
1530-2075
Type
conf
DOI
10.1109/IPDPS.2011.125
Filename
6008819
Link To Document