A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
Explore this paper's citation graph
Summary
It is shown that for the cases studied here, the relatively simple Min?min heuristic performs well in comparison to the other techniques, and one even basis for comparison and insights into circumstances where one technique will out-perform another.
- Type
- article
- Published
- 2001-06-01
- Cited by
- 1,939
- References
- 56
- Access
- Open access
- OpenAlex
- https://openalex.org/W2025397485
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:1862163
Keywords
Heuristics, Computer science, Simulated annealing, Scheduling (production processes), Heuristic
References
- Guest Editor's Introduction: Heterogeneous Processing
- Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
- How to Solve It: Modern Heuristics
- Improving search by incorporating evolution principles in parallel Tabu Search
- Algorithms and Theory of Computation Handbook
- The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions
- Task scheduling algorithms for heterogeneous processors
- How Good is Recursive Bisection?
- Resource estimation for heterogeneous computing
- A distributed heterogeneous supercomputing management system
- Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems
- Special Issue on Parallel Evolutionary Computing: Guest Editor's Introduction
- Task Matching and Scheduling in Heterogenous Computing Environments Using a Genetic-Algorithm-Based Approach
- Real time pipelined system design through simulated annealing
- Scheduling Parallel Program Tasks onto Arbitrary Target Machines
- Genetic algorithms: a survey
- Optimization by Simulated Annealing
- On mapping signal processing algorithms to a heterogeneous multiprocessor system
- A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion
- The Grid 2: Blueprint for a New Computing Infrastructure
Cited by
- Cyber-Physical Multi-Core Optimization for Resource and Cache Effects (C2ORES)
- An Energy-Saving Task Scheduling Strategy Based on Vacation Queuing Theory in Cloud Computing
- On the Robustness of Resource Allocation for Parallel and Distributed Computing and Communications
- Efficient image processing in resource-constrained visual sensor networks
- An Indexed Bibliography of Genetic Algorithms Theory and Comparisons
- Automatic resource specification generation for resource selection in large-scale distributed environments
- Toward practical multi-workflow scheduling in cluster and grid environments
- Linear Regression Analysis of Trust Computation in Grid Resource Broker
- Resource Allocation and Scheduling in Heterogeneous Cloud Environments
- Latency modeling and minimization for large-scale scientific workflows in distributed network environments
- An Adaptive Approach to Task Scheduling Optimization in Dynamic Grid Environments
- Composite SaaS resource management in cloud computing using evolutionary computation
- Optimizing Grid Scheduling Based on Local Cluster Scheduling Policies and Resource Availability
- An Efficient Fault Tolerant Scheduling Approach for Computational Grid
- Energy Efficient Scheduling in Heterogeneous Systems with a Parallel Multiobjective Local Search
- On an integrated mapping and scheduling solution to large-scale scientific workflows in resource sharing environments
- Batch Mode Stochastic-Based Robust Dynamic Resource Allocation in a Heterogeneous Computing System
- Greedy Approaches to Static Stochastic Robust Resource Allocation for Periodic Sensor Driven Distributed Systems
- Scheduling algorithms for instance-intensive cloud workflows
- Adaptive Scheduling Using Support Vector Machine on Heterogeneous Distributed Systems
Related papers
- Heuristic unidirectional flowpath design approaches for automated guided vehicle systems
- LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions
- A Study on the G-Node and Disconnected Edges to Improve the Global and Local Locating Heuristic for GOSST Problem
- Fast and Frugal Heuristics1
- Fast Heuristics for Delay Management with Passenger Rerouting
- An Almost Perfect Heuristic for the N Nonattacking Queens Problem