Multiprocessor scheduling in a genetic paradigm
Parallel Computing
A task duplication based scalable scheduling algorithm for distributed memory systems
Journal of Parallel and Distributed Computing
Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs
IEEE Transactions on Parallel and Distributed Systems
Worst-case analysis of scheduling heuristics of parallel systems
Parallel Computing
On Exploiting Task Duplication in Parallel Program Scheduling
IEEE Transactions on Parallel and Distributed Systems
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues
IEEE Transactions on Parallel and Distributed Systems
Scheduling Multiprocessor Tasks with Genetic Algorithms
IEEE Transactions on Parallel and Distributed Systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Scheduling preemptable tasks on parallel processors with limited availability
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
A comparison of list schedules for parallel processing systems
Communications of the ACM
Effect of task duplication on the assignment of dependency graphs
Parallel Computing
Discrete Applied Mathematics
Scheduling periodic tasks on uniform multiprocessors
Information Processing Letters
Grain Size Determination for Parallel Processing
IEEE Software
A Genetic Algorithm for Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
On Exploiting Heterogeneity for Cluster Based Parallel Multithreading Using Task Duplication
The Journal of Supercomputing
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Optimization of Data Distribution and Processor Allocation Problem Using Simulated Annealing
The Journal of Supercomputing
Optimal task assignment in heterogeneous computing systems
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Mapping of Parallel Tasks to Multiprocessors with Duplication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
Analyzing Fixed-Priority Global Multiprocessor Scheduling
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
A note on scheduling multiprocessor tasks with identical processing times
Computers and Operations Research
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Static task scheduling and grain packing in parallel processing systems
Static task scheduling and grain packing in parallel processing systems
Multi-heuristic list scheduling genetic algorithm for task scheduling
Proceedings of the 2003 ACM symposium on Applied computing
An accurate parallel genetic algorithm to schedule tasks on a cluster
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Computers and Operations Research
On multiprocessor task scheduling using efficient state space search approaches
Journal of Parallel and Distributed Computing
A New Approach to Scheduling Parallel Programs Using Task Duplication
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
IEEE Transactions on Computers
Performance of critical path type algorithms for scheduling on parallel processors
Operations Research Letters
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special issue on the 2009 ACM/IEEE international symposium on networks-on-chip
Metaheuristic methods in hybrid flow shop scheduling problem
Expert Systems with Applications: An International Journal
Computers & Mathematics with Applications
A systematic approach to classify design-time global scheduling techniques
ACM Computing Surveys (CSUR)
Task graph pre-scheduling, using Nash equilibrium in game theory
The Journal of Supercomputing
Static statistical MPSoC power optimization by variation-aware task and communication scheduling
Microprocessors & Microsystems
Reducing the solution space of optimal task scheduling
Computers and Operations Research
Hi-index | 0.00 |
Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between the quality of the solution and the computational complexity and scalability of the algorithm. Previous comparison studies have frequently operated with simplifying assumptions, such as independent tasks, artificially generated problems or the assumption of zero communication delay. In this paper, we propose a comparison study with realistic assumptions. Our target problems are two well known problems of linear algebra: LU decomposition and Gauss---Jordan elimination. Both algorithms are naturally parallelizable but have heavy data dependencies. The communication delay will be explicitly considered in the comparisons. In our study, we consider nine scheduling algorithms which are frequently used to the best of our knowledge: min---min, chaining, A*, genetic algorithms, simulated annealing, tabu search, HLFET, ISH, and DSH with task duplication. Based on experimental results, we present a detailed analysis of the scalability, advantages and disadvantages of each algorithm.