Scheduling for parallel processing
From MaRDI portal
Publication:1010955
zbMath1187.68090MaRDI QIDQ1010955
Publication date: 7 April 2009
Published in: Computer Communications and Networks (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (37)
Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays ⋮ 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 ⋮ Reducing the solution space of optimal task scheduling ⋮ Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Decentralized list scheduling ⋮ Integrating Amdahl-like Laws and Divisible Load Theory ⋮ Optimizing Data Intensive Flows for Networks on Chips ⋮ On excessive index of certain networks ⋮ Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource ⋮ Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs ⋮ On contiguous and non-contiguous parallel task scheduling ⋮ Decentralized subcontractor scheduling with divisible jobs ⋮ Scheduling wagons to unload in bulk cargo ports with uncertain processing times ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ On minimizing dataset transfer time in an acyclic network with four servers ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems ⋮ On the complexity of scheduling problems with a fixed number of parallel identical machines ⋮ Scheduling uniform machines with restricted assignment ⋮ Scheduling Massively Parallel Multigrid for Multilevel Monte Carlo Methods ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs ⋮ Task scheduling in distributed real-time systems ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Shared multi-processor scheduling ⋮ Heuristics for multi-round divisible loads scheduling with limited memory ⋮ Shared processor scheduling of multiprocessor jobs ⋮ Malleable scheduling for flows of jobs and applications to MapReduce ⋮ Scheduling divisible loads with time and cost constraints ⋮ Scheduling Multilayer Divisible Computations ⋮ Scheduling 2-dimensional grids with large communication delays ⋮ Packing-based branch-and-bound for discrete malleable task scheduling ⋮ Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan ⋮ Split scheduling with uniform setup times ⋮ Minimizing total completion time in multiprocessor job systems with energy constraint
This page was built for publication: Scheduling for parallel processing
