TY - JOUR
T1 - Safety-critical Java with cyclic executives on chip-multiprocessors
AU - Ravn, Anders Peter
AU - Schoeberl, Martin
PY - 2012/6/12
Y1 - 2012/6/12
N2 - Chip-multiprocessors offer increased processing power at a low cost. However, in order to use them for real-time systems, tasks have to be scheduled efficiently and predictably. It is well known that finding optimal schedules is a computationally hard problem. In this paper we present a solution that uses model checking to find a static schedule, if one exists at all, which gives an implementation of a table driven multiprocessor scheduler. Mutual exclusion to access shared resources is guaranteed by including access constraints in the schedule generation. To evaluate the proposed cyclic executive for multiprocessors, we have implemented it in the context of safety-critical Java on a Java processor.
AB - Chip-multiprocessors offer increased processing power at a low cost. However, in order to use them for real-time systems, tasks have to be scheduled efficiently and predictably. It is well known that finding optimal schedules is a computationally hard problem. In this paper we present a solution that uses model checking to find a static schedule, if one exists at all, which gives an implementation of a table driven multiprocessor scheduler. Mutual exclusion to access shared resources is guaranteed by including access constraints in the schedule generation. To evaluate the proposed cyclic executive for multiprocessors, we have implemented it in the context of safety-critical Java on a Java processor.
UR - http://www.scopus.com/inward/record.url?scp=84861192023&partnerID=8YFLogxK
U2 - 10.1002/cpe.1754
DO - 10.1002/cpe.1754
M3 - Journal article
SN - 1532-0626
VL - 24
SP - 772
EP - 788
JO - Concurrency and Computation: Practice & Experience
JF - Concurrency and Computation: Practice & Experience
IS - 8
ER -