时变负载任务系统中的动态处理器分配

A. Brunstrom, R. Simha
{"title":"时变负载任务系统中的动态处理器分配","authors":"A. Brunstrom, R. Simha","doi":"10.1109/SECON.1995.513106","DOIUrl":null,"url":null,"abstract":"In many applications a task is repeatedly executed on several sets of data in a pipeline fashion. For example, image processing software is frequently executed on a sequence of images. Due to varying semantic content in the data, each subtask of the overall task may experience variations in execution time for different instances of the data. The authors consider the problem of efficiently executing a task on a large parallel machine. In particular, they focus on dynamically assigning processors to subtasks in response to changing workloads seen by the subtasks. They present several processor assignment algorithms and study their performance through simulation. The simulation study is based on an application in computer vision. The results suggest dynamic re-assignment can perform very close to the theoretical optimum and distinctly better than static assignments.","PeriodicalId":334874,"journal":{"name":"Proceedings IEEE Southeastcon '95. Visualize the Future","volume":"1992 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Dynamic processor assignment in a task system with time-varying load\",\"authors\":\"A. Brunstrom, R. Simha\",\"doi\":\"10.1109/SECON.1995.513106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many applications a task is repeatedly executed on several sets of data in a pipeline fashion. For example, image processing software is frequently executed on a sequence of images. Due to varying semantic content in the data, each subtask of the overall task may experience variations in execution time for different instances of the data. The authors consider the problem of efficiently executing a task on a large parallel machine. In particular, they focus on dynamically assigning processors to subtasks in response to changing workloads seen by the subtasks. They present several processor assignment algorithms and study their performance through simulation. The simulation study is based on an application in computer vision. The results suggest dynamic re-assignment can perform very close to the theoretical optimum and distinctly better than static assignments.\",\"PeriodicalId\":334874,\"journal\":{\"name\":\"Proceedings IEEE Southeastcon '95. Visualize the Future\",\"volume\":\"1992 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Southeastcon '95. Visualize the Future\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.1995.513106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE Southeastcon '95. Visualize the Future","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1995.513106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在许多应用程序中,任务以管道方式在几组数据上重复执行。例如,图像处理软件经常在一系列图像上执行。由于数据中的语义内容不同,对于数据的不同实例,整体任务的每个子任务的执行时间可能会有所不同。作者考虑了在大型并行机上高效执行任务的问题。特别是,它们关注于动态地将处理器分配给子任务,以响应子任务看到的工作负载变化。他们提出了几种处理器分配算法,并通过仿真研究了它们的性能。仿真研究是基于计算机视觉中的一个应用。结果表明,动态再分配的效果非常接近理论最优,明显优于静态再分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic processor assignment in a task system with time-varying load
In many applications a task is repeatedly executed on several sets of data in a pipeline fashion. For example, image processing software is frequently executed on a sequence of images. Due to varying semantic content in the data, each subtask of the overall task may experience variations in execution time for different instances of the data. The authors consider the problem of efficiently executing a task on a large parallel machine. In particular, they focus on dynamically assigning processors to subtasks in response to changing workloads seen by the subtasks. They present several processor assignment algorithms and study their performance through simulation. The simulation study is based on an application in computer vision. The results suggest dynamic re-assignment can perform very close to the theoretical optimum and distinctly better than static assignments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信