{"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.