| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428222 | Information Processing Letters | 2007 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
