Scheduling for parallel processing
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Recommendations
Cited in
(52)- Packing-based branch-and-bound for discrete malleable task scheduling
- Scheduling 2-dimensional grids with large communication delays
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- Performance driven distributed scheduling of parallel hybrid computations
- Scheduling Interval Ordered Tasks in Parallel
- On excessive index of certain networks
- Scheduling multilayer divisible computations
- Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint
- Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource
- Scheduling divisible loads with time and cost constraints
- Minimizing total completion time in multiprocessor job systems with energy constraint
- Scheduling uniform machines with restricted assignment
- Decentralized subcontractor scheduling with divisible jobs
- On contiguous and non-contiguous parallel task scheduling
- A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays
- Malleable scheduling for flows of jobs and applications to MapReduce
- Scheduling Sequential Loops on Parallel Processors
- Parallel batch scheduling with nested processing set restrictions
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
- Heuristics for multi-round divisible loads scheduling with limited memory
- Integrating Amdahl-like Laws and Divisible Load Theory
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Scheduling massively parallel multigrid for multilevel Monte Carlo methods
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
- scientific article; zbMATH DE number 1517474 (Why is no real title available?)
- On minimizing dataset transfer time in an acyclic network with four servers
- Task scheduling in distributed real-time systems
- Optimizing Data Intensive Flows for Networks on Chips
- Decentralized list scheduling
- An improved approximation algorithm for scheduling monotonic moldable tasks
- Programming support and scheduling for communicating parallel tasks
- The influence of platform models on scheduling techniques
- Task scheduling for multi-core and parallel architectures. Challenges, solutions and perspectives
- Shared multi-processor scheduling
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
- Approximation algorithms for energy-efficient scheduling of parallel jobs
- Optimising makespan and energy consumption in task scheduling for parallel systems
- Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- scientific article; zbMATH DE number 5049925 (Why is no real title available?)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
- Resource loading with time windows
- On the complexity of scheduling problems with a fixed number of parallel identical machines
- scientific article; zbMATH DE number 836623 (Why is no real title available?)
- Shared processor scheduling of multiprocessor jobs
- Scheduling parallel applications on heterogeneous distributed systems
- Split scheduling with uniform setup times
- Scheduling in Distributed Computing Systems
- Reducing the solution space of optimal task scheduling
- scientific article; zbMATH DE number 1503713 (Why is no real title available?)
- Scheduling wagons to unload in bulk cargo ports with uncertain processing times
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
This page was built for publication: Scheduling for parallel processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010955)
