Share Email Print

Proceedings Paper

Compilation time analysis to minimize run-time overhead in preemptive scheduling on multiprocessors
Author(s): Piet Wauters; Rudy Lauwereins; J. Peperstraete
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper describes a scheduling method for hard real-time Digital Signal Processing (DSP) applications, implemented on a multi-processor. Due to the very high operating frequencies of DSP applications (typically hundreds of kHz) runtime overhead should be kept as small as possible. Because static scheduling introduces very little run-time overhead it is used as much as possible. Dynamic pre-emption of tasks is allowed if and only if it leads to better performance in spite of the extra run-time overhead. We essentially combine static scheduling with dynamic pre-emption using static priorities. Since we are dealing with hard real-time applications we must be able to guarantee at compile-time that all timing requirements will be satisfied at run-time. We will show that our method performs at least as good as any static scheduling method. It also reduces the total amount of dynamic pre-emptions compared with run time methods like deadline monotonic scheduling.

Paper Details

Date Published: 28 October 1994
PDF: 10 pages
Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190878
Show Author Affiliations
Piet Wauters, Katholieke Univ. Leuven (Belgium)
Rudy Lauwereins, Katholieke Univ. Leuven (Belgium)
J. Peperstraete, Katholieke Univ. Leuven (Belgium)

Published in SPIE Proceedings Vol. 2296:
Advanced Signal Processing: Algorithms, Architectures, and Implementations V
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top