{"title":"多处理器系统的线性-时间在线任务分配方案","authors":"A. Burchard, Y. Oh, J. Liebeherr, S. Son","doi":"10.1109/RTOSS.1994.292566","DOIUrl":null,"url":null,"abstract":"A new online task assignment scheme is presented for multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The computational complexity of the task assignment scheme grows linearly with the number of tasks, and its performance is shown to be significantly better than previously existing schemes. The superiority of the assignment scheme is achieved by a new schedulability condition derived for the rate-monotonic scheduling discipline.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A linear-time online task assignment scheme for multiprocessor systems\",\"authors\":\"A. Burchard, Y. Oh, J. Liebeherr, S. Son\",\"doi\":\"10.1109/RTOSS.1994.292566\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new online task assignment scheme is presented for multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The computational complexity of the task assignment scheme grows linearly with the number of tasks, and its performance is shown to be significantly better than previously existing schemes. The superiority of the assignment scheme is achieved by a new schedulability condition derived for the rate-monotonic scheduling discipline.<<ETX>>\",\"PeriodicalId\":103713,\"journal\":{\"name\":\"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTOSS.1994.292566\",\"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 of 11th IEEE Workshop on Real-Time Operating Systems and Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTOSS.1994.292566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A linear-time online task assignment scheme for multiprocessor systems
A new online task assignment scheme is presented for multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The computational complexity of the task assignment scheme grows linearly with the number of tasks, and its performance is shown to be significantly better than previously existing schemes. The superiority of the assignment scheme is achieved by a new schedulability condition derived for the rate-monotonic scheduling discipline.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
