{"title":"面向共享总线实时多处理器的处理器间阻塞独立静态任务分配","authors":"Chang Yeol Choi, Heonshik Shin, Yookun Cho","doi":"10.1109/EMWRTS.1994.336865","DOIUrl":null,"url":null,"abstract":"In real-time systems, guaranteeing the schedulability of high priority tasks is more important than being able to schedule more tasks under resource constraints. The system bus in bus-based multiprocessors is a shared resource that is usually arbitrated by priority and fairness. This paper presents a new static task allocation strategy that takes into consideration the impact of bus arbitration policy on schedulability. By allocating task sets, partitioned by descending order of priorities, to the processors in the order of physical priorities, we can minimize the loss of schedulability caused by interference among processors. It is shown via simulation that the proposed strategy keeps high priority tasks schedulable and reduces the schedulability loss up to 26% compared with the conventional allocation scheme.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Interprocessor-blocking independent static task allocation for shared-bus real-time multiprocessors\",\"authors\":\"Chang Yeol Choi, Heonshik Shin, Yookun Cho\",\"doi\":\"10.1109/EMWRTS.1994.336865\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In real-time systems, guaranteeing the schedulability of high priority tasks is more important than being able to schedule more tasks under resource constraints. The system bus in bus-based multiprocessors is a shared resource that is usually arbitrated by priority and fairness. This paper presents a new static task allocation strategy that takes into consideration the impact of bus arbitration policy on schedulability. By allocating task sets, partitioned by descending order of priorities, to the processors in the order of physical priorities, we can minimize the loss of schedulability caused by interference among processors. It is shown via simulation that the proposed strategy keeps high priority tasks schedulable and reduces the schedulability loss up to 26% compared with the conventional allocation scheme.<<ETX>>\",\"PeriodicalId\":322579,\"journal\":{\"name\":\"Proceedings Sixth Euromicro Workshop on Real-Time Systems\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth Euromicro Workshop on Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMWRTS.1994.336865\",\"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 Sixth Euromicro Workshop on Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMWRTS.1994.336865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Interprocessor-blocking independent static task allocation for shared-bus real-time multiprocessors
In real-time systems, guaranteeing the schedulability of high priority tasks is more important than being able to schedule more tasks under resource constraints. The system bus in bus-based multiprocessors is a shared resource that is usually arbitrated by priority and fairness. This paper presents a new static task allocation strategy that takes into consideration the impact of bus arbitration policy on schedulability. By allocating task sets, partitioned by descending order of priorities, to the processors in the order of physical priorities, we can minimize the loss of schedulability caused by interference among processors. It is shown via simulation that the proposed strategy keeps high priority tasks schedulable and reduces the schedulability loss up to 26% compared with the conventional allocation scheme.<>