论文信息 - On the complexity of fixed-priority scheduling of periodic, real-time tasks - 字舞流文

On the complexity of fixed-priority scheduling of periodic, real-time tasks

Joseph Y.-T. Leung | Jennifer Whitehead | J. Leung | J. Whitehead

[1] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[2] Charles U. Martel,et al. Scheduling Periodically Occurring Tasks on Multiple Processors , 1981, Inf. Process. Lett..

[3] J. Leung,et al. A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[4] Sudarshan K. Dhall,et al. On a Real-Time Scheduling Problem , 1978, Oper. Res..

[5] Omri Serlin,et al. Scheduling of time critical processes , 1899, AFIPS '72 (Spring).

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .