Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints-Reference-Cited by-同舟云学术

Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints

Published:2021-01-18 Issue:1-2 Volume:57 Page:4-54
ISSN:0922-6443
Container-title:Real-Time Systems
language:en
Short-container-title:Real-Time Syst

Author:

Voronov Sergey^ORCID,Anderson James H.,Yang Kecheng

Funder

National Science Foundation

Army Research Office

General Motors

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

Link

http://link.springer.com/content/pdf/10.1007/s11241-020-09360-1.pdf

Reference30 articles.

1. Audsley N (1991) Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Citeseer

2. Baker T (2005) Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Tech. Rep. TR-050601, Department of Computer Science, Florida State University

3. Baker T, Baruah S (2009) An analysis of global EDF schedulability for arbitrary-deadline sporadic task systems. Real Time Syst 43(1):3–24

4. Baruah S, Baker T (2008) Schedulability analysis of global EDF. Real Time Syst 38(3):223–235

5. Baruah S, Fisher N (2008) Global fixed-priority scheduling of arbitrary-deadline sporadic task systems. In: Proceedings of the 9th international conference on distributed computing and networking, pp 215–226

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Work In Progress: A New Task Model for Real-Time DNNs over GPU;2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS);2023-05