The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%

Article type: Research Article

Authors: Andersson, Björn

Affiliations: Department of Computer Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden

Note: [] Corresponding author: IPP-Hurray! Research Group, Polytechnic Institute of Porto, Rua Dr. Antonio Bernardino de Almeida 431, 4200-072 Porto, Portugal. E-mail: [email protected]

Abstract: This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.

Keywords: Real-time scheduling, partitioning, bin-packing algorithms, static-priority scheduling, preemptive scheduling, multiprocessors

DOI: 10.3233/JEC-2009-0107

Journal: Journal of Embedded Computing, vol. 4, no. 2, pp. 47-54, 2010-2011