An Efficient Scheduling Algorithm for the Multiprocessor Platform


Given a task set T, determining the number of processors leading to a feasible schedule for T is an important problem in the real-time embedded systems community. For periodic and independent task sets, the utilization rate represents a lower bound on the number of processors. A multiprocessor platform with fewer processors than the utilization rate of a… (More)
DOI: 10.1109/SYNASC.2010.81


  • Presentations referencing similar topics