Scheduling strategies and estimations for concept-oriented rapid prototyping

@article{Burst1999SchedulingSA,
  title={Scheduling strategies and estimations for concept-oriented rapid prototyping},
  author={Alexander Burst and Michael Wolff and Markus K{\"u}hl and Klaus D. M{\"u}ller-Glaser},
  journal={Proceedings Tenth IEEE International Workshop on Rapid System Prototyping. Shortening the Path from Specification to Prototype (Cat. No.PR00246)},
  year={1999},
  pages={140-145}
}
  • A. Burst, M. Wolff, K. Müller-Glaser
  • Published 16 June 1999
  • Computer Science
  • Proceedings Tenth IEEE International Workshop on Rapid System Prototyping. Shortening the Path from Specification to Prototype (Cat. No.PR00246)
Scheduling strategies for a rapid prototyping system are discussed. Our rapid prototyping system is able to use several CASE-tools and generate code for models of heterogenous domains. By using the emerging CASE data interchange format CDIF the model data of CASE-tools is represented as tool-independent. This tool-independent layer serves as a basis for simulation and code generation. The generated code is partitioned in tasks which must be scheduled as fast as possible with a real-time… 
1 Citations

Figures and Tables from this paper

References

SHOWING 1-10 OF 19 REFERENCES
On Code Generation for Rapid Prototyping Using CDIF
TLDR
The structure of a software prototype for rapid prototyping purpose is presented including the dynamic generation of the modeling code for discrete and time–continuous domains as well as static components for the model execution.
Using CDIF for concept-oriented rapid prototyping of electronic systems
TLDR
An open environment for heterogeneous system design is presented supporting all design phases and results in a unique representation of modeling data and a modeling technique based, tool independent analysis, simulation and emulation.
A rapid prototyping environment for the concurrent development of mechatronic systems
TLDR
An open environment for heterogeneous system design is presented supporting all design phases and an overall system simulation and rapid prototyping will help the user to avoid conceptual errors.
Implications of Classical Scheduling Results for Real-Time Systems
TLDR
This work divides scheduling theory between uniprocessor and multiprocesser results, and begins with independent tasks and then considers shared resources and overload.
The rate monotonic scheduling algorithm: exact characterization and average case behavior
An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set is represented. In addition, a stochastic analysis which gives the
What Every Engineer Needs To Know About Rate-Monotonic Schedzding : A TutoriaZ
This Paper presents the fundamentals of rate-monotonic scheduling theory for those who have had no former experience with it. It explains, with examples, the basic theorems and their extensions,
Fast Concurrent Simulation Using the Time Warp Mechanism. Part I. Local Control.
TLDR
This Note addresses the problem of speeding up simulation through concurrency by proposing a new method for concurrent simulation that examines the concepts of messages, antimessages, annihilation, and rollback.
Recent Results in the Theory of Machine Scheduling
The state of the art of deterministic machine scheduling is reviewed. Emphasis is placed on efficient, i. e. polynomial-bounded, optimization algorithms. A few of the more significant NP-hardness
Scheduling algorithms for multiprogramming in a hard-real-time environment
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an
...
...