Pages that link to "Item:Q853598"
From MaRDI portal
The following pages link to The non-preemptive scheduling of periodic tasks upon multiprocessors (Q853598):
Displaying 27 items.
- Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems (Q283171) (← links)
- Line search method for solving a non-preemptive strictly periodic scheduling problem (Q310329) (← links)
- Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms (Q332516) (← links)
- Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917) (← links)
- Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints (Q666415) (← links)
- Delay composition in preemptive and non-preemptive real-time pipelines (Q842722) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- An optimal multiprocessor real-time scheduling algorithm (Q1369218) (← links)
- Priority-driven scheduling of periodic task systems on multiprocessors (Q1431365) (← links)
- Scheduling periodic tasks on uniform multiprocessors (Q1603357) (← links)
- Non-preemptive scheduling with setup times: a PTAS (Q1693204) (← links)
- Deadline-based scheduling of periodic task systems on multiprocessors. (Q1853117) (← links)
- Real-time supervisory control of a processor for non-preemptive execution of periodic tasks (Q1871065) (← links)
- Periodic scheduling in real-time multiprocessor automated control systems (Q1882036) (← links)
- On non-preemptive scheduling of recurring tasks using inserted idle times (Q1891163) (← links)
- Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems (Q1918993) (← links)
- Processor bounding for an efficient non-preemptive task scheduling algorithm (Q2009223) (← links)
- Polynomial time schedulability test for periodic non-preemptive 2-task system (Q2011036) (← links)
- Scheduling of hard real-time multi-phase multi-thread (MPMT) periodic tasks (Q2251373) (← links)
- Tardiness bounds under global EDF scheduling on a multiprocessor (Q2479886) (← links)
- Scheduling periodic and aperiodic tasks with time, energy harvesting and precedence constraints on multi-core systems (Q2660973) (← links)
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations (Q4319223) (← links)
- Scheduling Periodic Tasks (Q4367057) (← links)
- (Q5089127) (← links)
- From non-preemptive to preemptive scheduling using synchronization synthesis (Q5892421) (← links)
- A survey on real-time DAG scheduling, revisiting the Global-Partitioned Infinity War (Q6488823) (← links)
