Multiple-goal objective functions for optimization of task assignment in complex computer systems

T.J Marlowe , A.D Stoyenko , P.A Laplante , R.S Daita , C.C Amaro , C.M Nguyen , S.L Howell
{"title":"Multiple-goal objective functions for optimization of task assignment in complex computer systems","authors":"T.J Marlowe ,&nbsp;A.D Stoyenko ,&nbsp;P.A Laplante ,&nbsp;R.S Daita ,&nbsp;C.C Amaro ,&nbsp;C.M Nguyen ,&nbsp;S.L Howell","doi":"10.1016/0066-4138(94)90011-6","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p><p>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.</p></div>","PeriodicalId":100097,"journal":{"name":"Annual Review in Automatic Programming","volume":"18 ","pages":"Pages 55-60"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0066-4138(94)90011-6","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Review in Automatic Programming","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0066413894900116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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.

复杂计算机系统任务分配优化的多目标函数
复杂系统是大型应用程序,通常运行在分布式异构网络上,由许多不同的约束和对性能、实时行为和容错性等目标的需求驱动。这些需求经常发生冲突,并且这些设计目标的满足与向处理器分配系统任务有强烈的相互作用。NSWC设计框架DESTINATION提供了一个分配模块,可用于优化系统,通过目标成本函数加权组合的值来衡量。即使对于中等规模的系统和网络,分配空间也太大,无法进行详尽的搜索。我们已经实现了能产生启发式好的作业的算法。然而,对许多有趣的设计因素的编译时评估,即使是那些与分配明确相关的因素,如果没有对进度进行一些估计是不可能的。因此,我们提供了为给定的系统、网络和分配确定合理的“伪时间表”的方法,并使用它来模拟评估成本函数的执行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信