The efficient multiprocessor implementation of synchronous reactive components

Model-based design methodologies based on the synchrony assumption are widely used in many safety-critical application domains. The synchrony assumption asserts that actions (such as the execution of code) occur instantaneously; however, physical platforms obviously do not possess this property. This paper considers a scheduling problem that arises when one seeks to implement programs that are written under the synchrony assumption upon actual multiprocessor platforms, and shows that existing results from scheduling theory can be adapted to solve this scheduling problem.Synchronous programming, Multiprocessor scheduling, Deadlines, Makespan minimization, Processor speedup factor.