Author:
Baruah Sanjoy K.,Rosier Louis E.,Howell Rodney R.
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Control and Optimization,Computer Networks and Communications,Computer Science Applications,Modeling and Simulation,Control and Systems Engineering
Reference17 articles.
1. Blazewicz, J. 1987. Selected Topics in Scheduling Theory.Annals of Discrete Mathematics, 31: 1–60.
2. Baruah, S., Mok, A. and Rosier, L. 1990. Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor. To be presented at the11th Real-Time Systems Symposium, Orlando, Florida, December.
3. Baruah, S., Rosier, L., Tulchinsky, I. and Varvel, D. 1990. The Complexity of Periodic Maintenance. To be presented at the International Computer Symposium, Hsinchu, Taiwan. Also, submitted for publication.
4. Coffman, E., Jr. (ed.).Computer and Job-Shop Scheduling Theory. New York: Wiley.
5. Cook, S. 1971. The Complexity of Theorem-Proving Procedures. InProc. of the 3rd Ann. ACM Symp. on Theory of Computing, pp. 151–158.
Cited by
272 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Rethinking Tractability for Schedulability Analysis;2023 IEEE Real-Time Systems Symposium (RTSS);2023-12-05
2. Handling Overload Conditions;Hard Real-Time Computing Systems;2023-09-25
3. Periodic Task Scheduling;Hard Real-Time Computing Systems;2023-09-25
4. A Distributed Task Scheduling Framework for Edge Computing and Cyber-Physical Systems;2023 49th Euromicro Conference on Software Engineering and Advanced Applications (SEAA);2023-09-06
5. Cutting-plane algorithms for preemptive uniprocessor scheduling problems;Real-Time Systems;2023-08-28