Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Bandwidth allocation for fixed-priority-scheduled compositional real-time systems

Bandwidth allocation for fixed-priority-scheduled compositional real-time systems Bandwidth Allocation for Fixed-Priority-Scheduled Compositional Real-Time Systems FARHANA DEWAN and NATHAN FISHER, Wayne State University Recent research in compositional real-time systems has focused on determination of a component's real-time interface parameters. An important objective in interface-parameter determination is minimizing the bandwidth allocated to each component of the system while simultaneously guaranteeing component schedulability. With this goal in mind, in this article, we explore fixed-priority schedulability in compositional setting. First we derive an efficient exact test based on iterative convergence for sporadic task systems scheduled by fixed-priority (e.g., deadline monotonic, rate monotonic) upon an explicit-deadline periodic (EDP) resource. Then we address the time complexity of the exact test by developing a fully-polynomial-time approximation scheme (FPTAS) for allocating bandwidth to components. Our parametric algorithm takes the task system and an accuracy parameter > 0 as input and returns a bandwidth which is guaranteed to be at most a factor (1 + ) times the optimal minimum bandwidth required to successfully schedule the task system. We perform thorough simulation over synthetically generated task systems to compare the performance of our proposed efficient-exact and the approximate algorithm and observe a significant decrease in runtime and a very small relative error when comparing http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Embedded Computing Systems (TECS) Association for Computing Machinery

Bandwidth allocation for fixed-priority-scheduled compositional real-time systems

Download PDF
29 pages

Loading next page...
 
/lp/association-for-computing-machinery/bandwidth-allocation-for-fixed-priority-scheduled-compositional-real-gRZ1kitEc6

References (44)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2014 by ACM Inc.
ISSN
1539-9087
DOI
10.1145/2560038
Publisher site
See Article on Publisher Site

Abstract

Bandwidth Allocation for Fixed-Priority-Scheduled Compositional Real-Time Systems FARHANA DEWAN and NATHAN FISHER, Wayne State University Recent research in compositional real-time systems has focused on determination of a component's real-time interface parameters. An important objective in interface-parameter determination is minimizing the bandwidth allocated to each component of the system while simultaneously guaranteeing component schedulability. With this goal in mind, in this article, we explore fixed-priority schedulability in compositional setting. First we derive an efficient exact test based on iterative convergence for sporadic task systems scheduled by fixed-priority (e.g., deadline monotonic, rate monotonic) upon an explicit-deadline periodic (EDP) resource. Then we address the time complexity of the exact test by developing a fully-polynomial-time approximation scheme (FPTAS) for allocating bandwidth to components. Our parametric algorithm takes the task system and an accuracy parameter > 0 as input and returns a bandwidth which is guaranteed to be at most a factor (1 + ) times the optimal minimum bandwidth required to successfully schedule the task system. We perform thorough simulation over synthetically generated task systems to compare the performance of our proposed efficient-exact and the approximate algorithm and observe a significant decrease in runtime and a very small relative error when comparing

Journal

ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery

Published: Feb 1, 2014

There are no references for this article.