By Topic

A generic simulator of real-time scheduling algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. De Vroey ; Dept. d'Inf., Univ. Libre de Bruxelles, Belgium ; J. Goossens ; C. Hernalsteen

We describe a language for defining scheduling algorithms for hard real-time systems and a tool to simulate the behavior of such systems on a predefined task set. The language is suitable for describing a real-time system composed of a task set, resources and a scheduling algorithm. The tasks can either be periodic or aperiodic, dependent or independent and the time constraints (e.g. deadlines) may be soft or hard. We consider two types of resources: the CPU and semaphores. Semaphores are used to describe the various possible dependences of the task set: shared memory, inter-task communication, devices etc. We consider only monoprocessor real-time systems. The third part of the system is given by the scheduling algorithm which is used to give resources (CPU and semaphores) to tasks

Published in:

Simulation Symposium, 1996., Proceedings of the 29th Annual

Date of Conference:

8-11 Apr 1996