Pages that link to "Item:Q1172385"
From MaRDI portal
The following pages link to Preemptive scheduling of periodic jobs in uniform multiprocessor systems (Q1172385):
Displaying 9 items.
- Line search method for solving a non-preemptive strictly periodic scheduling problem (Q310329) (← links)
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource (Q328919) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- Preemptive multiprocessor task scheduling with release times and time windows (Q1374419) (← links)
- Scheduling periodic tasks on uniform multiprocessors (Q1603357) (← links)
- Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems (Q1918993) (← links)
- Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints (Q3706490) (← links)