Premium
Safety‐critical Java with cyclic executives on chip‐multiprocessors
Author(s) -
Ravn Anders P.,
Schoeberl Martin
Publication year - 2011
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1754
Subject(s) - computer science , multiprocessing , schedule , java , mutual exclusion , parallel computing , context (archaeology) , chip , operating system , distributed computing , paleontology , telecommunications , biology
SUMMARY 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. Copyright © 2011 John Wiley & Sons, Ltd.