By Topic

Pre-scheduling on the domain of integers

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)
Weirong Wang ; Dept. of Comput. Sci., Texas Univ., Austin, TX, USA ; A. K. Mok ; G. Fohler

A preschedule is a static schedule without assuming constant and completely predictable rate of resource supply. A generalized prescheduling framework and a sound, complete, and PTIME preschedule generator was proposed in Wang et al. (2004) based on linear programming (LP). Since infinitely small time slices are not implementable for resources with context switch overhead, it is desirable to define and solve the prescheduling problem on the domain of integers so that context switching can occur only at boundaries of time quantums. However, integral LP (ILP) is NP-hard in the strong sense in general, so the ILP approach is not applicable and better techniques are needed. This paper answers this challenge by giving a sound, complete and PTIME rational-to-integral preschedule transformer based on a technique which we call "round-and-compensate".

Published in:

Real-Time Systems Symposium, 2004. Proceedings. 25th IEEE International

Date of Conference:

5-8 Dec. 2004