Pages that link to "Item:Q1152707"
From MaRDI portal
The following pages link to A note on preemptive scheduling of periodic, real-time tasks (Q1152707):
Displayed 18 items.
- Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling (Q554014) (← links)
- Feasibility problems for recurring tasks on one processor (Q688715) (← links)
- Analysis of window-constrained execution time systems (Q862987) (← links)
- Investigating the usability of real-time scheduling theory with the Cheddar project (Q1033676) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- A new algorithm for scheduling periodic, real-time tasks (Q1115592) (← links)
- Scheduling periodically occurring tasks on multiple processors (Q1149764) (← links)
- Pinwheel scheduling with two distinct numbers (Q1193627) (← links)
- Rate-monotonic scheduling for hard-real-time systems (Q1278515) (← links)
- Scheduling hard sporadic tasks with regular languages and generating functions. (Q1426168) (← links)
- On priority assignment in fixed priority scheduling (Q1603434) (← links)
- On a periodic maintenance problem (Q1837102) (← links)
- Minimal schedulability interval for real-time systems of periodic tasks with offsets (Q1884967) (← links)
- Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems (Q1918993) (← links)
- Schedulers for larger classes of pinwheel instances (Q2366229) (← links)
- WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model (Q2464934) (← links)
- The partitioned dynamic-priority scheduling of sporadic task systems (Q2642543) (← links)
- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Q3541088) (← links)