An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Scheduling multiprocessor tasks on three dedicated processors
Information Processing Letters
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
An approximation algorithm for scheduling on three dedicated machines
Discrete Applied Mathematics
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Efficiency and effectiveness of normal schedules on three dedicated processors
Selected papers from the second Krakow conference on Graph theory
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Semi-normal Schedulings: Improvement on Goemans' Algorithm
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Approximability of Multiprocessor Task Scheduling Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
Multiprocessor job scheduling problem has become increasingly interesting, for both theoretical study and practical applications. Theoretical study of the problem has made significant progress recently, which, however, seems not to imply practical algorithms for the problem, yet. Practical algorithms have been developed only for systems with three processors and the techniques seem difficult to extend to systems with more than three processors. This paper offers new observations and introduces new techniques for the multiprocessor job scheduling problem on systems with four processors. A very simple and practical linear time approximation algorithm of ratio bounded by 1:5 is developed for the multi-processor job scheduling problem P4|fix|Cmax, which significantly improves previous results. Our techniques are also useful for multiprocessor job scheduling problems on systems with more than four processors.