Pub Date : 1900-01-01DOI: 10.1109/EMWRTS.1998.684945
J.C. Palencia Gutierrez, J. Javier Gutiérrez, M. González Harbour
We present an improvement of the schedulability analysis technique for distributed hard real time systems that allows us to increase the maximum schedulable resource utilization. Since the improvement affects only the analysis technique, there is no additional implementation cost for the application itself. The improvement in the analysis consists of calculating a lower bound for the best case response time of tasks and messages, in order to reduce the estimated jitter in the activation of subsequent tasks and messages. This reduction of jitter implies reduced worst case bounds for the response times, and thus allows us to increase the maximum schedulable utilization. The paper explores two different ways to calculate a lower bound on the best case execution times. The paper also shows the results of simulations that we have carried out, in which we found that we could increase the maximum schedulable limit of the different resources by approximately 5% more utilization.
{"title":"Best-case analysis for improving the worst-case schedulability test for distributed hard real-time systems","authors":"J.C. Palencia Gutierrez, J. Javier Gutiérrez, M. González Harbour","doi":"10.1109/EMWRTS.1998.684945","DOIUrl":"https://doi.org/10.1109/EMWRTS.1998.684945","url":null,"abstract":"We present an improvement of the schedulability analysis technique for distributed hard real time systems that allows us to increase the maximum schedulable resource utilization. Since the improvement affects only the analysis technique, there is no additional implementation cost for the application itself. The improvement in the analysis consists of calculating a lower bound for the best case response time of tasks and messages, in order to reduce the estimated jitter in the activation of subsequent tasks and messages. This reduction of jitter implies reduced worst case bounds for the response times, and thus allows us to increase the maximum schedulable utilization. The paper explores two different ways to calculate a lower bound on the best case execution times. The paper also shows the results of simulations that we have carried out, in which we found that we could increase the maximum schedulable limit of the different resources by approximately 5% more utilization.","PeriodicalId":318810,"journal":{"name":"Proceeding. 10th EUROMICRO Workshop on Real-Time Systems (Cat. No.98EX168)","volume":"24 23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128457902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：