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