Sciweavers

Share
ECRTS
2009
IEEE

Approximate Bandwidth Allocation for Compositional Real-Time Systems

9 years 4 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-time or pseudo-polynomial-time techniques for exact allocation, or linear-time, utilization-based techniques which may over-provision bandwidth. In this paper, we develop a fully-polynomial-time approximation scheme (FPTAS) for allocating bandwidth for sporadic task systems scheduled by earliest-deadline first (EDF) upon an ExplicitDeadline Periodic (EDP) resource. Our algorithm takes, as parameters, the task system and an accuracy parameter > 0, and returns a bandwidth which is guaranteed to be at most a factor (1 + ) more than the optimal minimum bandwidth required to successfully schedule the task system. Furthermore, the algorithm has time complexity that is polynomial in the number of tasks and 1/. Via simulations over randomly-generated task systems, we have observed a several orders of magnitude decre...
Nathan Fisher, Farhana Dewan
Added 17 Feb 2011
Updated 17 Feb 2011
Type Journal
Year 2009
Where ECRTS
Authors Nathan Fisher, Farhana Dewan
Comments (0)
books