Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Application of real-time monitoring to scheduling tasks with random execution times

By: Haban, D.; Shin, K.G.;

1989 / IEEE / 0-8186-2004-8

Description

This item was taken from the IEEE Periodical ' Application of real-time monitoring to scheduling tasks with random execution times ' A real-time monitor is employed to aid in scheduling tasks with random execution times in a real-time computing system. Scheduling algorithms are usually based on the worst-case execution time (WET) of each task. Due to data-dependent loops and conditional branches in each program and resource-sharing delay during execution, this WET is usually difficult to obtain and could be several orders of magnitude larger than the true execution time. Thus, scheduling tasks based on WET could result in a severe underutilization of CPU cycles and underestimation of the system's schedulability. To alleviate this problem, a real-time monitor is proposed for use as a scheduling aid. The real-time monitor is composed of dedicated hardware, called test and measurement processors (TMPs), used to measure with minimal interference the true execution time, which consists of the pure execution time and resource-sharing delay. The monitor, a permanent and transparent part of a real-time system, degrades system performance by less than 0.1% and does not interfere with the host system's execution. Using the measured pure execution time and resource-sharing delay for each task, a mechanism which reduces the discrepancy between the WET and the estimated execution time has been developed. This result is then used to decide at the earliest possible time whether a task can meet its deadline.<>