Pages that link to "Item:Q3960458"
From MaRDI portal
The following pages link to On the complexity of fixed-priority scheduling of periodic, real-time tasks (Q3960458):
Displaying 50 items.
- Response time analysis for fixed priority real-time systems with energy-harvesting (Q258435) (← links)
- On fixed priority scheduling, offsets and co-prime task periods (Q293317) (← links)
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling (Q318911) (← links)
- Maintaining the feasibility of hard real-time systems with a reduced number of priority levels (Q326990) (← links)
- A new sufficient schedulability analysis for hybrid scheduling (Q328917) (← links)
- Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms (Q332516) (← links)
- Feasibility interval for the transactional event handlers of P-FRP (Q355499) (← links)
- Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling (Q436216) (← links)
- Maintaining data temporal consistency in distributed real-time systems (Q438209) (← links)
- Task partitioning and priority assignment for distributed hard real-time systems (Q494054) (← links)
- Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory (Q495922) (← links)
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms (Q497994) (← links)
- Graph-based models for real-time workload: a survey (Q497995) (← links)
- Feasibility analysis under fixed priority scheduling with limited preemptions (Q554013) (← links)
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems (Q617741) (← links)
- Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound (Q656084) (← links)
- Power efficient rate monotonic scheduling for multi-core systems (Q663432) (← links)
- Feasibility problems for recurring tasks on one processor (Q688715) (← links)
- Global control of robotic highway safety markers: a real-time solution (Q813130) (← links)
- Flexible hard real-time scheduling for deliberative AI systems (Q842724) (← links)
- Robust priority assignment for messages on Controller Area network (CAN) (Q844239) (← links)
- Optimal priority assignment in the presence of blocking (Q845683) (← links)
- Dynamic real-time scheduling of firm periodic tasks with hard and soft aperiodic tasks (Q853601) (← links)
- An engineering process for the verification of real-time systems (Q877159) (← links)
- Lowest priority first based feasibility analysis of real-time systems (Q897377) (← links)
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535) (← links)
- Improved multiprocessor global schedulability analysis (Q993508) (← links)
- Dynamic voltage scaling under EDF revisited (Q995822) (← links)
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling (Q1033671) (← links)
- On earliest deadline first scheduling for temporal consistency maintenance (Q1039295) (← links)
- A new algorithm for scheduling periodic, real-time tasks (Q1115592) (← links)
- A note on preemptive scheduling of periodic, real-time tasks (Q1152707) (← links)
- Rate-monotonic scheduling for hard-real-time systems (Q1278515) (← links)
- Rate monotonic scheduling in hard real-time systems (Q1313722) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Choosing task periods to minimise system utilisation in time triggered systems (Q1349956) (← links)
- On priority assignment in fixed priority scheduling (Q1603434) (← links)
- Exact speedup factors and sub-optimality for non-preemptive scheduling (Q1698782) (← links)
- Energy-aware real-time task scheduling for heterogeneous multiprocessors with particle swarm optimization algorithm (Q1718052) (← links)
- Vehicle minimization for periodic deliveries (Q1771353) (← 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)
- SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time (Q2177772) (← links)
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms (Q2251352) (← links)
- Interference-aware fixed-priority schedulability analysis on multiprocessors (Q2251414) (← links)
- Fault-tolerant and real-time scheduling for mixed-criticality systems (Q2251417) (← links)
- Schedulers for larger classes of pinwheel instances (Q2366229) (← links)
- DESH: Overhead reduction algorithms for deferrable scheduling (Q2379858) (← links)
- Optimal \((D - J)\)-monotonic priority assignment (Q2379982) (← links)
- Resource access control for dynamic priority distributed real-time systems (Q2432057) (← links)
