Maximizing the throughput of parallel jobs on hypercubes

Authors:
Deshi Ye;Guochuan Zhang
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou 310027, China;Department of Mathematics, Zhejiang University, Hangzhou 310027, China
Venue:
Information Processing Letters
Year:
2007

Citing 9
Cited 2

Complexity of scheduling parallel task systems

SIAM Journal on Discrete Mathematics
Scheduling independent jobs on partitionable hypercubes

Journal of Parallel and Distributed Computing
Dynamic scheduling on parallel machines

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling malleable and nonmalleable parallel tasks

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms

Scheduling Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Programming a Hypercube Multicomputer

IEEE Software
On maximizing the throughput of multiprocessor tasks

Theoretical Computer Science
On rectangle packing: maximizing benefits

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Online scheduling of parallel jobs on hypercubes: maximizing the throughput

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Open problems in throughput scheduling

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study a problem of scheduling n independent parallel jobs on hypercubes. A parallel job is required to be scheduled on a subcube of processors. All jobs are available at the beginning, each of which is associated with a due date. The objective is to maximize the total number of early jobs. We provide an optimal polynomial time algorithm for the unit processing time job system.