{"title":"实时系统中的前向任务调度策略","authors":"J. Apsel, K. Ecker, W. Halang","doi":"10.1109/WPDRTS.1994.365640","DOIUrl":null,"url":null,"abstract":"In this paper we consider the problem of scheduling hard real time tasks on a set of identical processors. Tasks are assumed to arrive for service at previously unknown points of time at the system. A decision has to be made whether a new task is rejected or accepted for processing. Once a task is accepted the scheduling policy assures that the task will be processed on time.<<ETX>>","PeriodicalId":275053,"journal":{"name":"Second Workshop on Parallel and Distributed Real-Time Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Throwforward task scheduling strategy in real time systems\",\"authors\":\"J. Apsel, K. Ecker, W. Halang\",\"doi\":\"10.1109/WPDRTS.1994.365640\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the problem of scheduling hard real time tasks on a set of identical processors. Tasks are assumed to arrive for service at previously unknown points of time at the system. A decision has to be made whether a new task is rejected or accepted for processing. Once a task is accepted the scheduling policy assures that the task will be processed on time.<<ETX>>\",\"PeriodicalId\":275053,\"journal\":{\"name\":\"Second Workshop on Parallel and Distributed Real-Time Systems\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second Workshop on Parallel and Distributed Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WPDRTS.1994.365640\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second Workshop on Parallel and Distributed Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPDRTS.1994.365640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Throwforward task scheduling strategy in real time systems
In this paper we consider the problem of scheduling hard real time tasks on a set of identical processors. Tasks are assumed to arrive for service at previously unknown points of time at the system. A decision has to be made whether a new task is rejected or accepted for processing. Once a task is accepted the scheduling policy assures that the task will be processed on time.<>