TY - JOUR
T1 - Multiple-goal objective functions for optimization of task assignment in complex computer systems
AU - Marlowe, T. J.
AU - Stoyenko, A. D.
AU - Laplante, P. A.
AU - Daita, R. S.
AU - Amaro, C. C.
AU - Nguyen, C. M.
AU - Howell, S. L.
PY - 1994
Y1 - 1994
N2 - Complex systems are large applications, typically running on distributed, heterogeneous networks, driven by a number of distinct constraints and desiderata on goals such as performance, real-time behavior, and fault tolerance. These requirements frequently conflict, and satisfaction of these design objectives interacts strongly with assignment of system tasks to processors. The NSWC design framework DESTINATION provides an assignment module which can be used to optimize the system, as measured by the value of a weighted combination of objective cost functions. For even modest-sized systems and networks, assignment space is too large to search exhaustively. We have implemented algorithms which generate heuristically good assignments. However, compile-time evaluation of many interesting design factors, even those clearly related to assignment, is impossible without some estimate of the schedule. We therefore provide approaches for determining a reasonable "pseudo-schedule" for a given system, network, and assignment, and use this to simulate execution in evaluating cost functions.
AB - Complex systems are large applications, typically running on distributed, heterogeneous networks, driven by a number of distinct constraints and desiderata on goals such as performance, real-time behavior, and fault tolerance. These requirements frequently conflict, and satisfaction of these design objectives interacts strongly with assignment of system tasks to processors. The NSWC design framework DESTINATION provides an assignment module which can be used to optimize the system, as measured by the value of a weighted combination of objective cost functions. For even modest-sized systems and networks, assignment space is too large to search exhaustively. We have implemented algorithms which generate heuristically good assignments. However, compile-time evaluation of many interesting design factors, even those clearly related to assignment, is impossible without some estimate of the schedule. We therefore provide approaches for determining a reasonable "pseudo-schedule" for a given system, network, and assignment, and use this to simulate execution in evaluating cost functions.
UR - http://www.scopus.com/inward/record.url?scp=43949153780&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=43949153780&partnerID=8YFLogxK
U2 - 10.1016/0066-4138(94)90011-6
DO - 10.1016/0066-4138(94)90011-6
M3 - Article
AN - SCOPUS:43949153780
SN - 0066-4138
VL - 18
SP - 55
EP - 60
JO - Annual Review in Automatic Programming
JF - Annual Review in Automatic Programming
IS - C
ER -