The Space of Feasible Execution Times for Asynchronous Periodic Task Systems Using Definitive Idle Times
 Mathieu Grenier,et al. Pushing the limits of CAN - scheduling frames with offsets provides a major performance boost , 2008 .
 Sanjoy K. Baruah,et al. Generalized Multiframe Tasks , 2004, Real-Time Systems.
 Joseph Y.-T. Leung,et al. On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Performance evaluation (Print).
 Giuseppe Lipari,et al. On the Average Complexity of the Processor Demand Analysis for Earliest Deadline Scheduling , 2013 .
 Donald E. Knuth. The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .
 Emmanuel Grolleau,et al. Minimal schedulability interval for real-time systems of periodic tasks with offsets , 2004, Theor. Comput. Sci..
 Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
 Giorgio C. Buttazzo,et al. Measuring the Performance of Schedulability Tests , 2005, Real-Time Systems.
 Giorgio C. Buttazzo,et al. Schedulability analysis of periodic fixed priority systems , 2004, IEEE Transactions on Computers.
 Ted K. Ralphs,et al. Integer and Combinatorial Optimization , 2013 .
 James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
 Sanjoy K. Baruah,et al. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 2005, Real-Time Systems.
 Laurent George,et al. Characterization of the Space of Feasible Worst-Case Execution Times for Earliest-Deadline-First Scheduling , 2009, J. Aerosp. Comput. Inf. Commun..