{"title":"实时应用与其他应用的资源共享","authors":"B. Sinharoy","doi":"10.1109/RTA.1993.263110","DOIUrl":null,"url":null,"abstract":"Most real-time applications run on dedicated system, to eliminate the uncertainty that may arise if other applications are running on the system. The resource requirement for the real-time application is determined on the basis of the system's ability to provide fault tolerance under the worst case execution time assumption. Costs of such systems will be better justified, if the real-time applications share the resources with other non real-time applications (such as, batch jobs), without compromising the real-time deadlines. Assuming a real-time application to consist of a set of optional and mandatory subtasks with time-critical precedence constraints among them, the problem of scheduling these subtasks on such a shared system so as to optimize the use of resources and execute time-critical applications with sufficient accuracy is addressed.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource sharing of real-time applications with other applications\",\"authors\":\"B. Sinharoy\",\"doi\":\"10.1109/RTA.1993.263110\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most real-time applications run on dedicated system, to eliminate the uncertainty that may arise if other applications are running on the system. The resource requirement for the real-time application is determined on the basis of the system's ability to provide fault tolerance under the worst case execution time assumption. Costs of such systems will be better justified, if the real-time applications share the resources with other non real-time applications (such as, batch jobs), without compromising the real-time deadlines. Assuming a real-time application to consist of a set of optional and mandatory subtasks with time-critical precedence constraints among them, the problem of scheduling these subtasks on such a shared system so as to optimize the use of resources and execute time-critical applications with sufficient accuracy is addressed.<<ETX>>\",\"PeriodicalId\":293622,\"journal\":{\"name\":\"[1993] Proceedings of the IEEE Workshop on Real-Time Applications\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings of the IEEE Workshop on Real-Time Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTA.1993.263110\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTA.1993.263110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Resource sharing of real-time applications with other applications
Most real-time applications run on dedicated system, to eliminate the uncertainty that may arise if other applications are running on the system. The resource requirement for the real-time application is determined on the basis of the system's ability to provide fault tolerance under the worst case execution time assumption. Costs of such systems will be better justified, if the real-time applications share the resources with other non real-time applications (such as, batch jobs), without compromising the real-time deadlines. Assuming a real-time application to consist of a set of optional and mandatory subtasks with time-critical precedence constraints among them, the problem of scheduling these subtasks on such a shared system so as to optimize the use of resources and execute time-critical applications with sufficient accuracy is addressed.<>