By Topic

A simulation approach to statistical evaluation of periodic task scheduling in a real-time computer system

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

2 Author(s)
Zbigniew Handzel ; Department of Management and Social Communication, Jagiellonian University, Cracow, Poland ; Krzysztof J. Latawiec

The task schedulability theorem in the celebrated GRMS theory provides a sufficient condition only, specifying the upper bound on CPU utilization by scheduled periodic tasks. This paper presents a simulation study on real-time task scheduling for a specific case when the upper bound on processor utilization can be exceeded. The results are applied in a problem of multiprocessor task scheduling.

Published in:

Methods and Models in Automation and Robotics (MMAR), 2010 15th International Conference on

Date of Conference:

23-26 Aug. 2010