By Topic

A feasible region for meeting aperiodic end-to-end deadlines in resource pipelines

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)
T. Abdelzaher ; Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA ; G. Thaker ; P. Lardieri

This paper generalizes the notion of utilization bounds for schedulability of aperiodic tasks to the case of distributed resource systems. In the basic model, aperiodically arriving tasks are processed by multiple stages of a resource pipeline within end-to-end deadlines. The authors consider a multidimensional space in which each dimension represents the instantaneous utilization of a single stage. A feasible region is derived in this space such that all tasks meet their deadlines as long as pipeline resource consumption remains within the feasible region. The feasible region is a multidimensional extension of the single-resource utilization bound giving rise to a bounding surface in the utilization space rather than a scalar bound. Extensions of the analysis are provided to nonindependent tasks and arbitrary task graphs. We evaluate the performance of admission control using simulation, as well as demonstrate the applicability of these results to task schedulability analysis in the total ship computing environment envisioned by the US navy.

Published in:

Distributed Computing Systems, 2004. Proceedings. 24th International Conference on

Date of Conference: