Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
Optimal selection theory for superconcurrency
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Introduction to algorithms
Internetworking with TCP/IP (2nd ed.), vol. I
Internetworking with TCP/IP (2nd ed.), vol. I
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
IEEE Transactions on Parallel and Distributed Systems
Estimating the execution time distribution for a task graph in a heterogeneous computing system
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Scheduling Resources in Multi-User, Heterogeneous, Computing Environments with SmartNet
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Loop scheduling for heterogeneity
HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
Modeling and characterizing parallel computing performance on heterogeneous networks of workstations
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Graph Theory With Applications
Graph Theory With Applications
IEEE Transactions on Parallel and Distributed Systems
Web-Based System Configuration and Performance Evaluation Using a Knowledge-Based Methodology
EC-WEB '02 Proceedings of the Third International Conference on E-Commerce and Web Technologies
An Overview of MSHN: The Management System for Heterogeneous Networks
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
A Systematic Approach for Configuring Web-Based Information Systems
Distributed and Parallel Databases
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In a dedicated, mixed-machine, heterogeneous computing (HC) system, an application program may be decomposed into subtasks, then each subtask assigned to the machine where it is best suited for execution. Data relocation is defined as selecting the sources for needed data items. It is assumed that multiple independent subtasks of an application program can be executed concurrently on different machines whenever possible. A theoretical stochastic model for HC is proposed, in which the computation times of subtasks and communication times for intermachine data transfers can be random variables. The optimization problem for finding the optimal matching, scheduling, and data relocation schemes to minimize the total execution time of an application program is defined based on this stochastic HC model. The global optimization criterion and search space for the above optimization problem are described. It is validated that a greedy algorithm-based approach can establish a local optimization criterion for developing data relocation heuristics. The validation is provided by a theoretical proof based on a set of common assumptions about the underlying HC system and application program. The local optimization criterion established by the greedy approach, coupled with the search space defined for choosing valid data relocation schemes, can help developers of future practical data relocation heuristics.