Introduction to algorithms
Utopia: a load sharing facility for large, heterogeneous distributed computer systems
Software—Practice & Experience
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
SmartNet: a scheduling framework for heterogeneous computing
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Stochastic Prediction of Execution Time for Dynamic Bulk Synchronous Computations
The Journal of Supercomputing
Characterization and enhancement of Static Mapping Heuristics for Heterogeneous Systems
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A High-Performance Mapping Algorithm for Heterogeneous Computing Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Stochastic Prediction of Execution Time for Dynamic Bulk Synchronous Computations
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
An Overview of MSHN: The Management System for Heterogeneous Networks
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
A Unified Resource Scheduling Framework for Heterogeneous Computing Environments
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
On the Design of Communication-Aware Task Scheduling Strategies for Heterogeneous Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Optimal periodic remapping of dynamic bulk synchronous computations
Journal of Parallel and Distributed Computing
Mapping subtasks with multiple versions on an ad hoc grid
Parallel Computing - Heterogeneous computing
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Some Compartmentalized Secure Task Assignment Models for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Stochastic modeling and analysis of hybrid mobility in reconfigurable distributed virtual machines
Journal of Parallel and Distributed Computing
A decentralized strategy for genetic scheduling in heterogeneous environments
Multiagent and Grid Systems - Grid Computing, high performance and distributed applications
Languages and Compilers for Parallel Computing
Journal of Parallel and Distributed Computing
Evaluation of multi-core scheduling mechanisms for heterogeneous processing architectures
Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video
Dynamic resource selection heuristics for a non-reserved bidding-based Grid environment
Future Generation Computer Systems
COSPIM: a program optimization system for tightly-coupled heterogeneous environments
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Job-scheduling via resource availability prediction for volunteer computational grids
International Journal of Grid and Utility Computing
International Journal of Grid and Utility Computing
Statistical measures for quantifying task and machine heterogeneities
The Journal of Supercomputing
Future Generation Computer Systems
Resource allocation robustness in multi-core embedded systems with inaccurate information
Journal of Systems Architecture: the EUROMICRO Journal
Computers & Mathematics with Applications
Bacteria foraging optimization for protein sequence analysis on the grid
Future Generation Computer Systems
A decentralized strategy for genetic scheduling in heterogeneous environments
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Scheduling in HC and Grids Using a Parallel CHC
Computational Intelligence
A New Grid Scheduler with Failure Recovery and Rescheduling Mechanisms: Discussion and Analysis
Journal of Grid Computing
Information Sciences: an International Journal
Resource Management in Real Time Distributed System with Security Constraints: A Review
International Journal of Distributed Systems and Technologies
Balanced Job Scheduling Based on Ant Algorithm for Grid Network
International Journal of Grid and High Performance Computing
Future Generation Computer Systems
| Hi-index | 0.00 |
In this paper we study the performance of four mapping algorithms. The four algorithms include two naive ones: Opportunistic Load Balancing (OLB), and Limited Best Assignment (LBA), and two intelligent greedy algorithms: an O(nm) greedy algorithm, and an O(n^2m) greedy algorithm. All of these algorithms, except OLB, use expected run-times to assign jobs to machines. As expected run-times are rarely deterministic in modern networked and server based systems, we first use experimentation to determine some plausible run-time distributions. Using these distributions, we next execute simulations to determine how the mapping algorithms perform.Performance comparisons show that the greedy algorithms produce schedules that, when executed, perform better than naive algorithms, even though the exact run-times are not available to the schedulers. We conclude that the use of intelligent mapping algorithms is beneficial, even when the expected time for completion of a job is not deterministic.