Pages that link to "Item:Q1010955"
From MaRDI portal
The following pages link to Scheduling for parallel processing (Q1010955):
Displaying 38 items.
- Resource loading with time windows (Q319369) (← links)
- Reducing the solution space of optimal task scheduling (Q336912) (← links)
- Decentralized list scheduling (Q367649) (← links)
- On excessive index of certain networks (Q391312) (← links)
- On contiguous and non-contiguous parallel task scheduling (Q892906) (← links)
- Decentralized subcontractor scheduling with divisible jobs (Q892907) (← links)
- Heuristics for multi-round divisible loads scheduling with limited memory (Q991099) (← links)
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (Q1631999) (← links)
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (Q1652451) (← links)
- Task scheduling in distributed real-time systems (Q1745808) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Shared multi-processor scheduling (Q1753597) (← links)
- Scheduling divisible loads with time and cost constraints (Q2066693) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Minimizing total completion time in multiprocessor job systems with energy constraint (Q2117638) (← links)
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
- Approximation algorithms for energy-efficient scheduling of parallel jobs (Q2215201) (← links)
- Shared processor scheduling of multiprocessor jobs (Q2282535) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan (Q2338217) (← links)
- Split scheduling with uniform setup times (Q2341391) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems (Q2633602) (← links)
- Scheduling uniform machines with restricted assignment (Q2688627) (← links)
- On minimizing dataset transfer time in an acyclic network with four servers (Q2959189) (← links)
- Integrating Amdahl-like Laws and Divisible Load Theory (Q5087089) (← links)
- Optimizing Data Intensive Flows for Networks on Chips (Q5087092) (← links)
- Scheduling Multilayer Divisible Computations (Q5247698) (← links)
- Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
- Scheduling Massively Parallel Multigrid for Multilevel Monte Carlo Methods (Q5372658) (← links)
- Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource (Q6065637) (← links)
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs (Q6066713) (← links)
- Scheduling wagons to unload in bulk cargo ports with uncertain processing times (Q6068691) (← links)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)
- Optimising makespan and energy consumption in task scheduling for parallel systems (Q6164588) (← links)
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times (Q6547139) (← links)
- Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint (Q6653502) (← links)
