Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference14 articles.
1. A. A. Bertossi and M. A. Bonuccelli, Preemptive scheduling of periodic jobs in uniform multiprocessor systems,Inform. Process. Lett.,16 (1983), 3–6.
2. J. -Y. Chung, J. W. S. Liu, and K. -J. Lin, Scheduling periodic jobs that allow imprecise results,IEEE Trans. Comput.,39 (1990), 1156–1174.
3. J. S. Deogun and M. C. Kong, On periodic scheduling of time-critical tasks,Proc. IFIP 10th World Computer Congress, 1986, pp. 791–796.
4. S. K. Dhall and C. L. Liu, On a real-time scheduling problem,Oper. Res.,26 (1978), 127–140.
5. M. R. Garey and D. S. Johnson,Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献