OUTSTANDING PAPER: Optimal and Adaptive Multiprocessor Real-Time Scheduling: The Quasi-Partitioning Approach

@article{Massa2014OUTSTANDINGPO,
  title={OUTSTANDING PAPER: Optimal and Adaptive Multiprocessor Real-Time Scheduling: The Quasi-Partitioning Approach},
  author={Ernesto Massa and George Lima and Paul Regnier and Greg Levin and Scott A. Brandt},
  journal={2014 26th Euromicro Conference on Real-Time Systems},
  year={2014},
  pages={291-300}
}
We describe a new algorithm, called Quasi-Partitioned Scheduling (QPS), capable of scheduling any feasible system composed of independent implicit-deadline sporadic tasks on identical processors. QPS partitions the system tasks into subsets, each of which is either scheduled by EDF on a single processor or by a set of servers on two or more processors. More precisely, QPS uses an efficient scheme to switch between partitioned EDF and global-like scheduling rules in response to system load… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Private communication

  • G. Nelissen
  • 2013. 277 300
  • 2013
1 Excerpt

Techniques for the synthesis of multiprocessor tasksets

  • P. Emberson, R. Stafford, R. I. Davis
  • Workshop on Analysis Tools and Methodologies for…
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…