A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Characterizing Resource Allocation Heuristics for Heterogeneous Computing Systems
[chapter]
2005
Advances in Computers
In many distributed computing environments, collections of applications need to be processed using a set of heterogeneous computing (HC) resources to maximize some performance goal. An important research problem in these environments is how to assign resources to applications (matching) and order the execution of the applications (scheduling) so as to maximize some performance criterion without violating any constraints. This process of matching and scheduling is called mapping. 1Howard Jay
doi:10.1016/s0065-2458(04)63003-8
fatcat:i2sy57dac5eoxnfd7xg3hv6iga