Affiliation:
1. University of Brest, Brest Cedex, France
Abstract
This paper describes an Ada framework called Cheddar which provides tools to check if a real time application meets its temporal constraints. The framework is based on the real time scheduling theory and is mostly written for educational purposes. With Cheddar, an application is defined by a set of processors, tasks, buffers, shared resources and messages. Cheddar provides feasibility tests in the cases of monoprocessor, multiprocessor and distributed systems. It also provides a flexible simulation engine which allows the designer to describe and run simulations of specific systems. The framework is open and has been designed to be easily connected to CASE tools such as editors, design tools, simulators, ...
Publisher
Association for Computing Machinery (ACM)
Reference26 articles.
1. Applying new scheduling theory to static priority pre-emptive scheduling
2. J. Blumenthal olatowski J. Hildebrandt and D. Timmermann. Framework for validation and Analysis of Real time Scheduling Algorithms and scheduler implementations. University of Rostock Technical report available from http://yasa.e-technik.uni-rostock.de/ 2003. J. Blumenthal olatowski J. Hildebrandt and D. Timmermann. Framework for validation and Analysis of Real time Scheduling Algorithms and scheduler implementations. University of Rostock Technical report available from http://yasa.e-technik.uni-rostock.de/ 2003.
3. Dynamic scheduling of real-time tasks under precedence constraints
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献