Scheduling for parallel processing

From MaRDI portal
Publication:1010955

zbMath1187.68090MaRDI QIDQ1010955

Maciej Drozdowski

Publication date: 7 April 2009

Published in: Computer Communications and Networks (Search for Journal in Brave)




Related Items (37)

Minimizing the total weighted late work in scheduling of identical parallel processors with communication delaysApproximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systemsResource loading with time windowsSpeed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterionReducing the solution space of optimal task schedulingSatisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delayParallel batch scheduling with nested processing set restrictionsDecentralized list schedulingIntegrating Amdahl-like Laws and Divisible Load TheoryOptimizing Data Intensive Flows for Networks on ChipsOn excessive index of certain networksProject scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resourceBranch‐and‐bound approach for optima localization in scheduling multiprocessor jobsOn contiguous and non-contiguous parallel task schedulingDecentralized subcontractor scheduling with divisible jobsScheduling wagons to unload in bulk cargo ports with uncertain processing timesAn improved approximation algorithm for scheduling monotonic moldable tasksOn minimizing dataset transfer time in an acyclic network with four serversApproximation algorithms for scheduling monotonic moldable tasks on multiple platformsOptimising makespan and energy consumption in task scheduling for parallel systemsOn the complexity of scheduling problems with a fixed number of parallel identical machinesScheduling uniform machines with restricted assignmentScheduling Massively Parallel Multigrid for Multilevel Monte Carlo MethodsApproximation algorithms for energy-efficient scheduling of parallel jobsTask scheduling in distributed real-time systemsParallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespanShared multi-processor schedulingHeuristics for multi-round divisible loads scheduling with limited memoryShared processor scheduling of multiprocessor jobsMalleable scheduling for flows of jobs and applications to MapReduceScheduling divisible loads with time and cost constraintsScheduling Multilayer Divisible ComputationsScheduling 2-dimensional grids with large communication delaysPacking-based branch-and-bound for discrete malleable task schedulingPreemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespanSplit scheduling with uniform setup timesMinimizing total completion time in multiprocessor job systems with energy constraint




This page was built for publication: Scheduling for parallel processing