{"title":"确定多任务系统中的实时处理储备","authors":"J. Preston, Paul A. Little, L. Martin","doi":"10.1109/DASC.1995.482915","DOIUrl":null,"url":null,"abstract":"The ability to accurately predict usable processing reserve is needed in many real-time software applications. Earlier research has shown that there are limits on the amount of available processor throughput that can be used to perform work with hard real-time deadlines. In this paper, we present an approach for determining and manipulating usable real-time processing reserve for multitasking systems that use preemptive, priority-based scheduling rules. Such systems must be prioritized using either rate monotonic, or deadline monotonic criteria. The approach computes real-time processing reserve for a schedulable task set, assuming that additional computation requirements will be levied on existing tasks. The approach includes a method for computing the maximum work that can be performed by an added task while preserving schedulability of the task set. Additionally, we introduce a method for balancing work within a task set to increase available real-time processing reserve. The method can be conditionally applied to harmonic tasks within a task set to improve the work efficiency of a processing resource.","PeriodicalId":125963,"journal":{"name":"Proceedings of 14th Digital Avionics Systems Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"DETERMINING REAL-TIME PROCESSING RESERVE IN MULTITASKING SYSTEMS\",\"authors\":\"J. Preston, Paul A. Little, L. Martin\",\"doi\":\"10.1109/DASC.1995.482915\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ability to accurately predict usable processing reserve is needed in many real-time software applications. Earlier research has shown that there are limits on the amount of available processor throughput that can be used to perform work with hard real-time deadlines. In this paper, we present an approach for determining and manipulating usable real-time processing reserve for multitasking systems that use preemptive, priority-based scheduling rules. Such systems must be prioritized using either rate monotonic, or deadline monotonic criteria. The approach computes real-time processing reserve for a schedulable task set, assuming that additional computation requirements will be levied on existing tasks. The approach includes a method for computing the maximum work that can be performed by an added task while preserving schedulability of the task set. Additionally, we introduce a method for balancing work within a task set to increase available real-time processing reserve. The method can be conditionally applied to harmonic tasks within a task set to improve the work efficiency of a processing resource.\",\"PeriodicalId\":125963,\"journal\":{\"name\":\"Proceedings of 14th Digital Avionics Systems Conference\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 14th Digital Avionics Systems Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DASC.1995.482915\",\"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 14th Digital Avionics Systems Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.1995.482915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
DETERMINING REAL-TIME PROCESSING RESERVE IN MULTITASKING SYSTEMS
The ability to accurately predict usable processing reserve is needed in many real-time software applications. Earlier research has shown that there are limits on the amount of available processor throughput that can be used to perform work with hard real-time deadlines. In this paper, we present an approach for determining and manipulating usable real-time processing reserve for multitasking systems that use preemptive, priority-based scheduling rules. Such systems must be prioritized using either rate monotonic, or deadline monotonic criteria. The approach computes real-time processing reserve for a schedulable task set, assuming that additional computation requirements will be levied on existing tasks. The approach includes a method for computing the maximum work that can be performed by an added task while preserving schedulability of the task set. Additionally, we introduce a method for balancing work within a task set to increase available real-time processing reserve. The method can be conditionally applied to harmonic tasks within a task set to improve the work efficiency of a processing resource.