Loading...
Please wait, while we are loading the content...
Similar Documents
Schedule-Carrying Code
| Content Provider | CiteSeerX |
|---|---|
| Author | Henzinger, Thomas A. Matic, Slobodan Kirsch, Christoph M. |
| Abstract | 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. 1 |
| File Format | |
| Publisher Date | 2003-01-01 |
| Publisher Institution | In Proc. EMSOFT, LNCS 2855 |
| Access Restriction | Open |
| Subject Keyword | Distributed Scheduling Scc Executable Executable Code Scheduling Strategy Schedule-carrying Code Giotto Program Verifiable Mean Real-time Program Complex Architecture Real-time Task Feasible Schedule Hard Real-time Program Explicit Scheduling Instruction |
| Content Type | Text |
| Resource Type | Article |
