Pages that link to "Item:Q5957575"
From MaRDI portal
The following pages link to Scheduling independent multiprocessor tasks (Q5957575):
Displaying 41 items.
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks (Q557669) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Scheduling independent 2-processor tasks to minimize schedule length (Q796987) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- On contiguous and non-contiguous parallel task scheduling (Q892906) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system (Q1315909) (← links)
- Multi-processor scheduling and expanders (Q1336770) (← links)
- Multiprocessor scheduling with machine allotment and parallelism constraints (Q1348915) (← links)
- Real-time scheduling of linear speedup parallel tasks (Q1350756) (← links)
- On multiprocessor system scheduling (Q1383800) (← links)
- Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
- Scheduling multiple variant programs under hard real-time constraints (Q1590048) (← links)
- Scheduling multiprocessor tasks on hypercubes (Q1892273) (← links)
- Scheduling independent tasks with multiple modes (Q1900136) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Processor bounding for an efficient non-preemptive task scheduling algorithm (Q2009223) (← links)
- Exact algorithms for scheduling programs with shared tasks (Q2156317) (← links)
- A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888) (← links)
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates (Q2459394) (← links)
- Open block scheduling in optical communication networks (Q2503353) (← links)
- On minimizing dataset transfer time in an acyclic network with four servers (Q2959189) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors (Q3806974) (← links)
- PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS (Q3830805) (← links)
- General multiprocessor task scheduling (Q4238573) (← links)
- Minimizing total completion time in two-processor task systems with prespecified processor allocations (Q4390599) (← links)
- Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques (Q4846485) (← links)
- APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS (Q5187850) (← links)
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← 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)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
- Scheduling independent multiprocessor tasks (Q6483867) (← links)
- Bounds and algorithms for a practical task allocation model (extended abstract) (Q6487459) (← links)
