An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
The complexity of scheduling independent two-processor tasks on dedicated processors
Information Processing Letters
Scheduling multiprocessor tasks on three dedicated processors
Information Processing Letters
An approximation result for a duo-processor task scheduling problem
Information Processing Letters
Some models for scheduling parallel programs with communication delays
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Approximation of algorithms for scheduling trees with general communication delays
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Scheduling to Achieve Optimized Performance of Randomly Addressed Polling Protocol
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We study a multiprocessor task scheduling problem, in which each task requires a set of µ processors with consecutiveness constraints to be executed. This occurs, for example, when multiple processors are interconnected by communication means, and the minimization of communication time may require the processors to be physically adjacent and each multiprocessor task to use only one subset of adjacent processors. In particular, we consider the case in which we have m processors arranged in a ring, and we want to find a schedule with minimum makespan. We investigate problem complexity, showing that the problem is NP-hard in almost all the possible cases, and provide an approximation algorithm that finds a feasible schedule whose makespan is not greater than two times the optimal value.