Scheduling independent 2-processor tasks to minimize schedule length
Information Processing Letters - Lecture Notes in Computer Science, no. 173
Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
ACM Transactions on Mathematical Software (TOMS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Preemptive scheduling under time and resource constraints
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Generalised multiprocessor scheduling using optimal control
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Scheduling pipelined communication in distributed memory multiprocessors for real-time applications
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
On satisfying timing constraints in hard-real-time systems
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
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
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
On-line scheduling of parallel jobs with runtime restrictions
Theoretical Computer Science
Generalized multiprocessor scheduling for directed acylic graphs
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Optimal Processor Assignment for a Class of Pipelined Computations
IEEE Transactions on Parallel and Distributed Systems
A Framework for Mapping Periodic Real-Time Applications on Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Generalized Multiprocessor Scheduling and Applications to Matrix Computations
IEEE Transactions on Parallel and Distributed Systems
Optimizing Computing Costs Using Divisible Load Analysis
IEEE Transactions on Parallel and Distributed Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Pre-Run-Time Scheduling to Reduce Schedule Length in the FieldBus Environment
IEEE Transactions on Software Engineering
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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
Approximation Algorithms for Scheduling Independent Malleable Tasks
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Scheduling Fault-Tolerant Programs on Multiple Processors to Maximize Schedule Reliability
SAFECOMP '99 Proceedings of the 18th International Conference on Computer Computer Safety, Reliability and Security
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms
A Multistage Load Distribution Strategy for Three-Dimensional Meshes
Cluster Computing
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks
Journal of Scheduling
On the Complexity of Adjacent Resource Scheduling
Journal of Scheduling
Preemptable Malleable Task Scheduling Problem
IEEE Transactions on Computers
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Journal of Scheduling
International Journal of Computer Applications in Technology
Scheduling Parallel Tasks with Communication Overhead in an Environment with Multiple Machines
IEICE - Transactions on Information and Systems
Scheduling multiprocessor UET tasks of two sizes
Theoretical Computer Science
The ant colony in par-synthesis of computer system
ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Energy-efficient scheduling for parallel real-time tasks based on level-packing
Proceedings of the 2011 ACM Symposium on Applied Computing
Workload balancing and throughput optimization for heterogeneous systems subject to failures
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Fast approximation algorithms for scheduling independent multiprocessor tasks
Proceedings of the 19th High Performance Computing Symposia
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit
Computers and Industrial Engineering
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem
Journal of Parallel and Distributed Computing
Scheduling linear chain streaming applications on heterogeneous systems with failures
Future Generation Computer Systems
| Hi-index | 14.99 |
The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its impact on the complexity of minimizing schedule length is studied. First we concentrate on the problem of nonpreemptive scheduling. In this case, polynomial-time algorithms exist only for unit processing times. We present two such algorithms of complexity O(n) for scheduling tasks requiring an arbitrary number of processors between 1 and k at a time where k is a fixed integer. The case for which k is not fixed is shown to be NP-complete. Next, the problem of preemptive scheduling of tasks of arbitrary length is studied. First an algorithm for scheduling tasks requiring one or k processors is presented. Its complexity depends linearly on the number of tasks. Then, the possibility of a linear programming formulation for the general case is analyzed.