Rate-Based Resource Allocation Models for Embedded Systems

K. Jeffay and S.M. Goddard
in: Embedded Software, Proceedings of the First International Workshop on Embedded Software (EMSOFT 2001)
Tahoe City, CA, October 2001
Lecture Notes in Computer Science, Volume 2211, T. Henzinger, C. Kirsch, editors,
Springer Verlag, Berlin, 2001, pages 204-222.

Abstract: Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other correctness conditions are met. Static priority scheduling is easy to understand and support but it suffers from a number of significant shortcomings such as the complexity of simultaneously mapping timing and importance constraints onto priority values. Rate-based resource allocation schemes offer an attractive alternative to traditional static priority scheduling as they offer flexibility in specifying and managing timing and criticality constraints. This paper presents a taxonomy of rate-based resource allocation and summarizes the results of some recent experiments evaluating the real-time performance of three allocation schemes for a suite of intra-kernel and application-level scheduling problems encountered in supporting a multimedia workload on FreeBSD UNIX.

Get a PostScript - or - a PDF copy of this paper.

(A copy of the slides for the talk presented at the conference is also available.)

Back to Real-Time Systems Research at UNC page.