TY - GEN
T1 - Multiprocessor feasibility analysis of recurrent task systems with specified processor affinities
AU - Baruah, Sanjoy
AU - Brandenburg, Björn
PY - 2013
Y1 - 2013
N2 - In many current multiprocessor real-time operating systems, programmers have the ability to set affinity masks that pin a process to a specified subset of the processors in the system. Given a real-time task system consisting of a collection of implicit-deadline sporadic tasks with an affinity mask specified for each task that is to be implemented upon an identical multiprocessor platform, this paper addresses the question of determining whether the task system can be implemented upon the platform to always meet all deadlines, while respecting the affinity mask restrictions. An algorithm is derived that answers this question efficiently in run-time that is polynomial in the representation of the task system.
AB - In many current multiprocessor real-time operating systems, programmers have the ability to set affinity masks that pin a process to a specified subset of the processors in the system. Given a real-time task system consisting of a collection of implicit-deadline sporadic tasks with an affinity mask specified for each task that is to be implemented upon an identical multiprocessor platform, this paper addresses the question of determining whether the task system can be implemented upon the platform to always meet all deadlines, while respecting the affinity mask restrictions. An algorithm is derived that answers this question efficiently in run-time that is polynomial in the representation of the task system.
UR - https://www.scopus.com/pages/publications/84894334341
U2 - 10.1109/RTSS.2013.24
DO - 10.1109/RTSS.2013.24
M3 - Conference contribution
AN - SCOPUS:84894334341
SN - 9781479920075
T3 - Proceedings - Real-Time Systems Symposium
SP - 160
EP - 169
BT - Proceedings - IEEE 34th Real-Time Systems Symposium, RTSS 2013
T2 - IEEE 34th Real-Time Systems Symposium, RTSS 2013
Y2 - 3 December 2013 through 6 December 2013
ER -