Schedule-carrying code Conference Paper

Author(s): Henzinger, Thomas A; Kirsch, Christoph M; Matic, Slobodan
Title: Schedule-carrying code
Title Series: LNCS
Abstract: We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time tasks of the program. Traditionally, a scheduler determines the existence of a feasible schedule according to some scheduling strategy. With SCC, a compiler proves the existence of a feasible schedule by generating executable code that is attached to the program and represents its schedule. An SCC executable is a real-time program that carries its schedule as code, which is produced once and can be revalidated and executed with each use. We evaluate SCC both in theory and practice. In theory, we give two scenarios, of nonpreemptive and distributed scheduling for Giotto programs, where the generation of a feasible schedule is hard, while the validation of scheduling instructions that are attached to the programs is easy. In practice, we implement SCC and show that explicit scheduling instructions can reduce the scheduling overhead up to 35% and can provide an efficient, flexible, and verifiable means for compiling Giotto programs on complex architectures, such as the TTA.
Conference Title: EMSOFT: Embedded Software
Volume: 2855
Conference Dates: October 13-15, 2003
Conference Location: Philadelphia, PA, USA
ISBN: 978-145034485-2
Publisher: ACM  
Location: Berlin, Heidelberg
Date Published: 2003-09-29
Start Page: 241
End Page: 256
Sponsor: This work was supported by the AFOSR MURI grant F49620-00-1-0327, the California MICRO grant 01-037, the DARPA grant F33615-C-98-3614, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875, CCR-0085949, and CCR-0225610.
DOI: 10.1007/978-3-540-45212-6_16
Open access: no
IST Austria Authors
  1. Thomas A. Henzinger
    415 Henzinger
Related IST Austria Work