A clustering heuristic algorithm for scheduling periodic and deterministic tasks on a multiprocessor system

M. Ilyas, S.A. Khan
{"title":"A clustering heuristic algorithm for scheduling periodic and deterministic tasks on a multiprocessor system","authors":"M. Ilyas, S.A. Khan","doi":"10.1109/INMIC.2001.995305","DOIUrl":null,"url":null,"abstract":"In this paper, a Clustering Heuristic Scheduling Algorithm (CHSA) for periodic and deterministic tasks on a multiprocessor system is presented It is assumed that system repeatedly processes scheduled tasks periodically. The system consists of an array of independent processing elements and no inter-processor communication overheads. The system may or may not require code fetches for the execution of different tasks. The CHSA receives different tasks with a variable probability distribution over time. The CHSA attempts to increase the average processor utilization of the system, reduce the code fetch time overhead by attempting to cluster similar tasks and reduces power consumption across the system by attempting to keep as many processors as possible unutilized, thereby allowing them to be kept in a low-power mode.","PeriodicalId":286459,"journal":{"name":"Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INMIC.2001.995305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, a Clustering Heuristic Scheduling Algorithm (CHSA) for periodic and deterministic tasks on a multiprocessor system is presented It is assumed that system repeatedly processes scheduled tasks periodically. The system consists of an array of independent processing elements and no inter-processor communication overheads. The system may or may not require code fetches for the execution of different tasks. The CHSA receives different tasks with a variable probability distribution over time. The CHSA attempts to increase the average processor utilization of the system, reduce the code fetch time overhead by attempting to cluster similar tasks and reduces power consumption across the system by attempting to keep as many processors as possible unutilized, thereby allowing them to be kept in a low-power mode.
多处理器系统中周期性和确定性任务调度的聚类启发式算法
本文提出了一种多处理机系统中周期性和确定性任务的聚类启发式调度算法,该算法假设系统周期性地重复处理调度任务。该系统由一组独立的处理元件组成,没有处理器间的通信开销。系统可能需要也可能不需要获取代码来执行不同的任务。随着时间的推移,CHSA以可变的概率分布接收不同的任务。CHSA试图提高系统的平均处理器利用率,通过尝试集群类似的任务来减少代码获取时间开销,并通过尝试保持尽可能多的处理器未被利用来降低整个系统的功耗,从而允许它们保持在低功耗模式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信