Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
Radix Exchange—An Internal Sorting Method for Digital Computers
Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Segmented Min-Min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
QoS guided min-min heuristic for grid task scheduling
Journal of Computer Science and Technology - Grid computing
Journal of Parallel and Distributed Computing
Batch mode scheduling in grid systems
International Journal of Web and Grid Services
Incorporating data movement into grid task scheduling
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Structured Parallel Programming: Patterns for Efficient Computation
Structured Parallel Programming: Patterns for Efficient Computation
Solving very large instances of the scheduling of independent tasks problem on the GPU
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
Min-Min is a popular heuristic for scheduling tasks to heterogeneous computational resources, which has been applied either directly or as part of more sophisticated heuristics. However, for large scenarios such as grid computing platforms, the time complexity of a straightforward implementation of Min-Min, which is quadratic in the number of tasks, may be prohibitive. This has motivated the development of high performance computing (HPC) implementations, and the use of simpler heuristics for the sake of acceptable execution times. We propose a simple algorithm that implements Min-Min requiring only O(mn) operations for scheduling n tasks on m machines. Our experiments show, in practice, that a straightforward sequential implementation of this algorithm significantly outperforms other state of the art implementations of Min-Min, even compared to HPC implementations. In addition, the proposed algorithm is at least as suitable for parallelization as a direct implementation of Min-Min.