{"title":"异步周期任务的Pfair/ERfair混合调度","authors":"James H. Anderson, A. Srinivasan","doi":"10.1109/EMRTS.2001.934004","DOIUrl":null,"url":null,"abstract":"In this paper, we prove that a simplified variant of the PD Pfair algorithm, called PD/sup 2/, is optimal for scheduling any mix of early-release and non-early-release asynchronous tasks on a multiprocessor. This result breaks new ground by incorporating both early-release and non-early-release tasks under a common framework. In addition, all prior work on optimal multiprocessor Pfair scheduling algorithms has been limited to synchronous periodic task systems.","PeriodicalId":292136,"journal":{"name":"Proceedings 13th Euromicro Conference on Real-Time Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"203","resultStr":"{\"title\":\"Mixed Pfair/ERfair scheduling of asynchronous periodic tasks\",\"authors\":\"James H. Anderson, A. Srinivasan\",\"doi\":\"10.1109/EMRTS.2001.934004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we prove that a simplified variant of the PD Pfair algorithm, called PD/sup 2/, is optimal for scheduling any mix of early-release and non-early-release asynchronous tasks on a multiprocessor. This result breaks new ground by incorporating both early-release and non-early-release tasks under a common framework. In addition, all prior work on optimal multiprocessor Pfair scheduling algorithms has been limited to synchronous periodic task systems.\",\"PeriodicalId\":292136,\"journal\":{\"name\":\"Proceedings 13th Euromicro Conference on Real-Time Systems\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"203\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 13th Euromicro Conference on Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMRTS.2001.934004\",\"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 13th Euromicro Conference on Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMRTS.2001.934004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
In this paper, we prove that a simplified variant of the PD Pfair algorithm, called PD/sup 2/, is optimal for scheduling any mix of early-release and non-early-release asynchronous tasks on a multiprocessor. This result breaks new ground by incorporating both early-release and non-early-release tasks under a common framework. In addition, all prior work on optimal multiprocessor Pfair scheduling algorithms has been limited to synchronous periodic task systems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
