论文信息 - Maximizing the throughput of parallel jobs on hypercubes

Maximizing the throughput of parallel jobs on hypercubes

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.

Guochuan Zhang | Deshi Ye

[1] B. J. Lageweg,et al. Multiprocessor scheduling with communication delays , 1990, Parallel Comput..

[2] Prasoon Tiwari,et al. Scheduling malleable and nonmalleable parallel tasks , 1994, SODA '94.

[3] Maciej Drozdowski,et al. Scheduling multiprocessor tasks -- An overview , 1996 .

[4] Anja Feldmann,et al. Dynamic scheduling on parallel machines , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5] Guochuan Zhang,et al. Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes , 2003, ISAAC.

[6] Klaus Jansen,et al. Maximizing the Number of Packed Rectangles , 2004, SWAT.

[7] Peter Brucker,et al. Scheduling Algorithms , 1995 .

[8] Klaus Jansen,et al. On rectangle packing: maximizing benefits , 2004, SODA '04.

[9] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[10] Guochuan Zhang,et al. On Maximizing the Throughput of Multiprocessor Tasks , 2002, MFCS.

[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12] Joseph Y.-T. Leung,et al. Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

[13] Sartaj Sahni,et al. Programming a hypercube multicomputer , 1988, IEEE Software.

[14] Ten-Hwang Lai,et al. Scheduling Independent Jobs on Partitionable Hypercubes , 1991, J. Parallel Distributed Comput..