{"title":"Overhead effects in real-time preemptive schedules","authors":"D. Rhodes, W. Wolf","doi":"10.1145/301177.301529","DOIUrl":null,"url":null,"abstract":"The hard real-time schedulability of dependent task-graphs is studied for single bus homogeneous multiprocessor systems. A model which includes interrupts and context switching as well as bus contention is developed. The model captures real-time operating system effects aimed at realistically modeling both intra-processor and inter-processor communications. A robust scheduler is used to assess the impact of interrupt service time (IST) and context switching time (CST) on schedulability. For the class of task-graphs studied, it is shown that schedulability is a nonlinear function of only the weighted sum of IST and CST.","PeriodicalId":344739,"journal":{"name":"Proceedings of the Seventh International Workshop on Hardware/Software Codesign (CODES'99) (IEEE Cat. No.99TH8450)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Seventh International Workshop on Hardware/Software Codesign (CODES'99) (IEEE Cat. No.99TH8450)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/301177.301529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
The hard real-time schedulability of dependent task-graphs is studied for single bus homogeneous multiprocessor systems. A model which includes interrupts and context switching as well as bus contention is developed. The model captures real-time operating system effects aimed at realistically modeling both intra-processor and inter-processor communications. A robust scheduler is used to assess the impact of interrupt service time (IST) and context switching time (CST) on schedulability. For the class of task-graphs studied, it is shown that schedulability is a nonlinear function of only the weighted sum of IST and CST.