{"title":"A simulation approach to statistical evaluation of periodic task scheduling in a real-time computer system","authors":"Zbigniew Handzel, K. Latawiec","doi":"10.1109/MMAR.2010.5587224","DOIUrl":null,"url":null,"abstract":"The task schedulability theorem in the celebrated GRMS theory provides a sufficient condition only, specifying the upper bound on CPU utilization by scheduled periodic tasks. This paper presents a simulation study on real-time task scheduling for a specific case when the upper bound on processor utilization can be exceeded. The results are applied in a problem of multiprocessor task scheduling.","PeriodicalId":336219,"journal":{"name":"2010 15th International Conference on Methods and Models in Automation and Robotics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 15th International Conference on Methods and Models in Automation and Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR.2010.5587224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The task schedulability theorem in the celebrated GRMS theory provides a sufficient condition only, specifying the upper bound on CPU utilization by scheduled periodic tasks. This paper presents a simulation study on real-time task scheduling for a specific case when the upper bound on processor utilization can be exceeded. The results are applied in a problem of multiprocessor task scheduling.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
