Scheduling malleable tasks with interdependent processing rates: Comments and observations

Authors:
Edmund K. Burke;Moshe Dror;James B. Orlin
Affiliations:
School of Computer Science and IT, The University of Nottingham, UK;MIS Department, University of Arizona & Operations Research Center, Massachusetts Institute of Technology, USA;Sloan School of Management, Massachusetts Institute of Technology, USA
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 14
Cited 1

Parallel machine scheduling: processing rates dependent on number of jobs in operation

Management Science
Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions

Mathematics of Operations Research
Approximate algorithms scheduling parallelizable tasks

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A Parallel Hash Join Algorithm for Managing Data Skew

IEEE Transactions on Parallel and Distributed Systems
A Hierarchical Approach to Parallel Multiquery Scheduling

IEEE Transactions on Parallel and Distributed Systems
Algorithms for scheduling malleable and nonmalleable parallel tasks

Algorithms for scheduling malleable and nonmalleable parallel tasks
Numerical Linear Algebra for High Performance Computers

Numerical Linear Algebra for High Performance Computers
Handbook on Parallel and Distributed Processing

Handbook on Parallel and Distributed Processing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Large Scale Simulation of Parallel Molecular Dynamics

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
The impact of load balancing to object-oriented query execution scheduling in parallel machine environment

Information Sciences—Informatics and Computer Science: An International Journal
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
A shelf-based Lagrangian relaxation algorithm to schedule parallelizable tasks

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Scheduling parallelizable tasks to minimize make-span and weighted response time

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Integrated staffing and scheduling for an aircraft line maintenance problem

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this short paper, we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation for a number of results for cases with convex and concave processing speed functions. The contribution of this paper is a new unified view of results described in several recent papers. We briefly discuss the implications of our observations on this important family of scheduling problems.