{"title":"实时任务的在线调度","authors":"K. Hong, J. Leung","doi":"10.1109/REAL.1988.51119","DOIUrl":null,"url":null,"abstract":"The problem of online scheduling of a set of n independent, real-time tasks on m>or=1 identical processors is addressed. An online scheduler is said to be optimal if it performs as well as the best offline scheduler. It is shown that no optimal online scheduler can exist if the tasks have more than one distinct deadline. An optimal online scheduler for tasks with one common deadline is given. An optimal online scheduler is also given for environments in which processors can go down unexpectedly.<<ETX>>","PeriodicalId":116211,"journal":{"name":"Proceedings. Real-Time Systems Symposium","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"178","resultStr":"{\"title\":\"On-line scheduling of real-time tasks\",\"authors\":\"K. Hong, J. Leung\",\"doi\":\"10.1109/REAL.1988.51119\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of online scheduling of a set of n independent, real-time tasks on m>or=1 identical processors is addressed. An online scheduler is said to be optimal if it performs as well as the best offline scheduler. It is shown that no optimal online scheduler can exist if the tasks have more than one distinct deadline. An optimal online scheduler for tasks with one common deadline is given. An optimal online scheduler is also given for environments in which processors can go down unexpectedly.<<ETX>>\",\"PeriodicalId\":116211,\"journal\":{\"name\":\"Proceedings. Real-Time Systems Symposium\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"178\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Real-Time Systems Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REAL.1988.51119\",\"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. Real-Time Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REAL.1988.51119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The problem of online scheduling of a set of n independent, real-time tasks on m>or=1 identical processors is addressed. An online scheduler is said to be optimal if it performs as well as the best offline scheduler. It is shown that no optimal online scheduler can exist if the tasks have more than one distinct deadline. An optimal online scheduler for tasks with one common deadline is given. An optimal online scheduler is also given for environments in which processors can go down unexpectedly.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
