Real-time hybrid task scheduling upon multiprocessor production stages

This paper deals with predictable real-time scheduling upon multiprocessor production stages in manufacturing systems underlying real-time constraints. The preemptive scheduling of systems consisting of hybrid (periodic and aperiodic) tasks on a platform comprised of several uniform multiprocessors is considered. A scheduling algorithm, the total bandwidth server on uniform multiprocessors, is developed. The scheduling algorithm is analyzed by considering its performance when it is allowed to run on faster machines. The predictability of the system is proved through schedulability analysis techniques. The performance of the system is analyzed through simulation studies.