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.
N1 - Funding Information:
The authorsa re indebtedt o generouss upportpar-tially providedf or this work under the U.S. ONR Grants N00014-92-J-136a7n d N00014-93-1-104t7h,e U.S. NSWC Grants N60921-93-M-191a2n d N60921-93-M-3095a ndthe AT&T UEDP Grant 91-134.T hey are grateful for what has been a productivec ol-laborationw ith other DESTINATION team members, notablyt he CCCC company.U seful,constructive and valuablec riticisma nd ideas have been provided by a good numbero f participantosf the Software SynthesisS pecificationa d-hocWorking Group at NSWC, and by many Real-TimeC omputingL ab membersa nd visitors, including Prabha Gopinath, Willie Rossak,L onnieW elch,Jack Verhooseal nd Ken Tindell. Other NJIT participantosf the DESTINATION projecth avei ncludedM ike Khamis, Jin Xue, Tuna Tugeu, Manrice Pattersona nd Nicky Jones.
PY - 1996/2
Y1 - 1996/2
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; however, there are numerous 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. This paper therefore discusses approaches for determining a reasonable "pseudo-schedule" for a given system, network, and assignment, and the use of 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; however, there are numerous 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. This paper therefore discusses approaches for determining a reasonable "pseudo-schedule" for a given system, network, and assignment, and the use of this to simulate execution in evaluating cost functions.
UR - http://www.scopus.com/inward/record.url?scp=0030083215&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030083215&partnerID=8YFLogxK
U2 - 10.1016/0967-0661(95)00232-4
DO - 10.1016/0967-0661(95)00232-4
M3 - Article
AN - SCOPUS:0030083215
SN - 0967-0661
VL - 4
SP - 251
EP - 256
JO - Control Engineering Practice
JF - Control Engineering Practice
IS - 2
ER -