Pages that link to "Item:Q6483867"
From MaRDI portal
The following pages link to Scheduling independent multiprocessor tasks (Q6483867):
Displaying 26 items.
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Algorithms for solving minimax scheduling problem (Q734231) (← links)
- Scheduling independent 2-processor tasks to minimize schedule length (Q796987) (← links)
- A new approach for scheduling independent tasks with multiple modes (Q835753) (← links)
- A general bound on schedule length for independent tasks (Q919804) (← links)
- A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems (Q1285548) (← links)
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system (Q1315909) (← links)
- A two-pass scheduling algorithm for parallel programs (Q1334867) (← links)
- Multiprocessor scheduling with machine allotment and parallelism constraints (Q1348915) (← links)
- Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← links)
- On multiprocessor system scheduling (Q1383800) (← links)
- Scheduling chained multiprocessor tasks onto large multiprocessor system (Q1700868) (← links)
- Non-preemptive scheduling to maximize the minimum global inter-completion time (Q1810562) (← links)
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis (Q1866998) (← links)
- Scheduling multiprocessor tasks on hypercubes (Q1892273) (← links)
- Scheduling independent tasks with multiple modes (Q1900136) (← links)
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (Q1904737) (← links)
- Deadline scheduling of multiprocessor tasks (Q1917262) (← links)
- Exact algorithms for scheduling programs with shared tasks (Q2156317) (← links)
- A class of generalized multiprocessor scheduling problems (Q2721956) (← links)
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors (Q3806974) (← links)
- General multiprocessor task scheduling (Q4238573) (← links)
- Minimizing total completion time in two-processor task systems with prespecified processor allocations (Q4390599) (← links)
- Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times (Q5943828) (← links)
- New applications of the Muntz and Coffman algorithm (Q5946720) (← links)
- Scheduling independent multiprocessor tasks (Q5957575) (← links)
