Pub Date : 1995-04-25DOI: 10.1109/WPDRTS.1995.470486
B. R. Swim, M. Tayli, M. Benmaiza, M. Woodward
Deadline scheduling policies based on stochastic computation times perform well in average but fail in presence of transient overloads, causing already scheduled tasks to miss their deadline. This paper presents an approach using medium-term scheduling policies to cope with the problem of transient overload in dynamic real-time systems. The proposed approach has been implemented in a Real-Time Distributed Operating System (RTDOS) running on a Transputer network.<>
{"title":"Avoiding deadline decay under transient overloads","authors":"B. R. Swim, M. Tayli, M. Benmaiza, M. Woodward","doi":"10.1109/WPDRTS.1995.470486","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470486","url":null,"abstract":"Deadline scheduling policies based on stochastic computation times perform well in average but fail in presence of transient overloads, causing already scheduled tasks to miss their deadline. This paper presents an approach using medium-term scheduling policies to cope with the problem of transient overload in dynamic real-time systems. The proposed approach has been implemented in a Real-Time Distributed Operating System (RTDOS) running on a Transputer network.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121545108","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}
Pub Date : 1995-04-25DOI: 10.1109/WPDRTS.1995.470492
S. Chatterjee, J. Strosnider
Mapping, i.e., allocating resources to applications and finding I/O routes between resources, is a crucial step in meeting real-time/multi-media applications' end-to-end timing requirements. Given a set of real-time applications, the order in which they are mapped can also greatly impact whether these timing requirements are met. Because the optimal ordering solution is intractable, this paper introduces a logical application stream laxity metric that can be used to order the application streams in linear time that produces excellent results. We apply this metric to an example audio/video application set to illustrate our approach and to compare our solution to the optimal one.<>
{"title":"Application stream ordering for mapping real-time applications to a heterogeneous, distributed target platform","authors":"S. Chatterjee, J. Strosnider","doi":"10.1109/WPDRTS.1995.470492","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470492","url":null,"abstract":"Mapping, i.e., allocating resources to applications and finding I/O routes between resources, is a crucial step in meeting real-time/multi-media applications' end-to-end timing requirements. Given a set of real-time applications, the order in which they are mapped can also greatly impact whether these timing requirements are met. Because the optimal ordering solution is intractable, this paper introduces a logical application stream laxity metric that can be used to order the application streams in linear time that produces excellent results. We apply this metric to an example audio/video application set to illustrate our approach and to compare our solution to the optimal one.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419224","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}
Pub Date : 1995-04-25DOI: 10.1109/WPDRTS.1995.470488
B. Cogswell, Z. Segall
TIBBIT is a method of performing a binary to binary translation of an application from one architecture (source) to another (target) while maintaining the timing behavior of the code, even when it depends upon the speed (e.g. clock rate) of the host processor. Translated applications are scheduled under a real-time operating system on the target system such that processor-speed dependent behavior is accounted for and held equivalent. This work extends the technique from the single-processor implementation to include translation from single- and multiprocessor sources to multiprocessor targets.<>
{"title":"Timing insensitive binary-to-binary migration across multiprocessor architectures","authors":"B. Cogswell, Z. Segall","doi":"10.1109/WPDRTS.1995.470488","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470488","url":null,"abstract":"TIBBIT is a method of performing a binary to binary translation of an application from one architecture (source) to another (target) while maintaining the timing behavior of the code, even when it depends upon the speed (e.g. clock rate) of the host processor. Translated applications are scheduled under a real-time operating system on the target system such that processor-speed dependent behavior is accounted for and held equivalent. This work extends the technique from the single-processor implementation to include translation from single- and multiprocessor sources to multiprocessor targets.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"308 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131657402","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
扫码关注我们
求助内容：
应助结果提醒方式：