Scheduling for parallel processing
From MaRDI portal
Publication:1010955
zbMATH Open1187.68090MaRDI QIDQ1010955FDOQ1010955
Authors: M. Drozdowski 
Publication date: 7 April 2009
Published in: Computer Communications and Networks (Search for Journal in Brave)
Recommendations
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)
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
- Title not available (Why is that?)
- 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
- 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
- Scheduling parallel applications on heterogeneous distributed systems
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- 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
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Resource loading with time windows
- Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
- An improved approximation algorithm for scheduling monotonic moldable tasks
- The influence of platform models on scheduling techniques
- Scheduling in Distributed Computing Systems
- Scheduling multilayer divisible computations
- On minimizing dataset transfer time in an acyclic network with four servers
- Scheduling uniform machines with restricted assignment
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling Interval Ordered Tasks in Parallel
- Decentralized subcontractor scheduling with divisible jobs
- On contiguous and non-contiguous parallel task scheduling
- Title not available (Why is that?)
- Approximation algorithms for energy-efficient scheduling of parallel jobs
- Reducing the solution space of optimal task scheduling
- Scheduling wagons to unload in bulk cargo ports with uncertain processing times
- Shared multi-processor scheduling
- Scheduling massively parallel multigrid for multilevel Monte Carlo methods
- Task scheduling for multi-core and parallel architectures. Challenges, solutions and perspectives
- Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint
- Parallel batch scheduling with nested processing set restrictions
- Programming support and scheduling for communicating parallel tasks
- Shared processor scheduling of multiprocessor jobs
- Task scheduling in distributed real-time systems
- Scheduling divisible loads with time and cost constraints
- Decentralized list scheduling
- 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
- Optimizing Data Intensive Flows for Networks on Chips
- Split scheduling with uniform setup times
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
- Packing-based branch-and-bound for discrete malleable task scheduling
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)
