Pages that link to "Item:Q1039310"
From MaRDI portal
The following pages link to Approximation techniques for response-time analysis of static-priority tasks (Q1039310):
Displaying 9 items.
- Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling (Q436216) (← links)
- Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917) (← links)
- Efficient implementation of tight response-times for tasks with offsets (Q944003) (← links)
- Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption (Q1039302) (← links)
- Improved response-time bounds in fixed priority scheduling with arbitrary deadlines (Q1698773) (← links)
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems (Q1698775) (← links)
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement (Q1698776) (← links)
- Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance Protocol (Q3390115) (← links)
- Research and Development of an Algorithm for the Response Time Estimation in Multiprocessor Systems Under the Interval Uncertainty of the Tasks Execution Times (Q5060066) (← links)
