Pub Date : 1995-05-15DOI: 10.1109/RTTAS.1995.516214
K. Lam, Kam-yiu Lam, S. Hung
Proposes a new real-time optimistic protocol. By using a dynamic adjustment of the serialization order by backward-adjusting the non-serious conflicting transactions before the committing transactions, many unnecessary restarts can be eliminated. In the protocol, no conflict or serialization constraints have to be recorded during the read phase of a transaction. Different priority conflict resolution methods can be easily incorporated in the protocol. In addition, with the use of Thomas's write rule, the number of transaction restarts can further be much reduced.
{"title":"Real-time optimistic concurrency control protocol with dynamic adjustment of serialization order","authors":"K. Lam, Kam-yiu Lam, S. Hung","doi":"10.1109/RTTAS.1995.516214","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516214","url":null,"abstract":"Proposes a new real-time optimistic protocol. By using a dynamic adjustment of the serialization order by backward-adjusting the non-serious conflicting transactions before the committing transactions, many unnecessary restarts can be eliminated. In the protocol, no conflict or serialization constraints have to be recorded during the read phase of a transaction. Different priority conflict resolution methods can be easily incorporated in the protocol. In addition, with the use of Thomas's write rule, the number of transaction restarts can further be much reduced.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115726061","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-05-15DOI: 10.1109/RTTAS.1995.516218
Yoshifumi Manabe, S. Aoyagi
The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic real time task systems. The paper discusses feasibility decision for a given real time task system by the rate monotonic scheduling algorithm. It presents a new necessary and sufficient condition for a given task system to be feasible, and a new feasibility decision algorithm based on that condition. The time complexity of this algorithm depends solely on the number of tasks. This algorithm can be applied to the inverse deadline scheduling algorithm, which is an extension of the rate monotonic scheduling algorithm.
{"title":"A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks","authors":"Yoshifumi Manabe, S. Aoyagi","doi":"10.1109/RTTAS.1995.516218","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516218","url":null,"abstract":"The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic real time task systems. The paper discusses feasibility decision for a given real time task system by the rate monotonic scheduling algorithm. It presents a new necessary and sufficient condition for a given task system to be feasible, and a new feasibility decision algorithm based on that condition. The time complexity of this algorithm depends solely on the number of tasks. This algorithm can be applied to the inverse deadline scheduling algorithm, which is an extension of the rate monotonic scheduling algorithm.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123057442","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-01DOI: 10.1109/RTTAS.1995.516209
R. Wisniewski, Luis Stevens
As real-time applications become more complex, it becomes increasingly important to provide both a clean model for their development and the ability to verify that their execution matches the development model. In addition to becoming more complex, soft real-time programs are becoming more mainstream, and as such are being run on platforms running some variant of Unix. It is even more important in these environments to be able to monitor a program and understand its behavior. We describe a frame scheduler that provides a simple model to the real-time programmer while maintaining considerable flexibility. We motivate and describe the implementation of FrameView, a set of tools closely coupled with the frame scheduler. Since FrameView and the frame scheduler were developed in conjunction with each other and are tightly coupled, they provide a powerful and efficient means for programmers to implement, analyze and modify soft parallel real-time applications. The frame scheduler is fully implemented in IRIX 5.3, and FrameView is in beta release. In this paper, we describe our experiences building and using the frame scheduler and FrameView.
{"title":"A model and tools for supporting parallel real-time applications in Unix environments","authors":"R. Wisniewski, Luis Stevens","doi":"10.1109/RTTAS.1995.516209","DOIUrl":"https://doi.org/10.1109/RTTAS.1995.516209","url":null,"abstract":"As real-time applications become more complex, it becomes increasingly important to provide both a clean model for their development and the ability to verify that their execution matches the development model. In addition to becoming more complex, soft real-time programs are becoming more mainstream, and as such are being run on platforms running some variant of Unix. It is even more important in these environments to be able to monitor a program and understand its behavior. We describe a frame scheduler that provides a simple model to the real-time programmer while maintaining considerable flexibility. We motivate and describe the implementation of FrameView, a set of tools closely coupled with the frame scheduler. Since FrameView and the frame scheduler were developed in conjunction with each other and are tightly coupled, they provide a powerful and efficient means for programmers to implement, analyze and modify soft parallel real-time applications. The frame scheduler is fully implemented in IRIX 5.3, and FrameView is in beta release. In this paper, we describe our experiences building and using the frame scheduler and FrameView.","PeriodicalId":265113,"journal":{"name":"Proceedings Real-Time Technology and Applications Symposium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128129545","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
扫码关注我们
求助内容：
应助结果提醒方式：