Pages that link to "Item:Q1261479"
From MaRDI portal
The following pages link to Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479):
Displaying 12 items.
- The feasibility of general task systems with precedence constraints on multiprocessor platforms (Q842732) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
- Preemptive multiprocessor task scheduling with release times and time windows (Q1374419) (← links)
- Little-preemptive scheduling on unrelated processors (Q1868263) (← links)
- Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
- The maximum gain of increasing the number of preemptions in multiprocessor scheduling (Q2390934) (← links)
- Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650) (← links)
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness (Q3340134) (← links)
- Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors (Q4376737) (← links)
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness (Q5961604) (← links)
