A stochastic model of a dedicated heterogeneous computing system for establishing a greedy approach to developing data relocation heuristics

Authors:
Min Tan;H. J. Siegel
Affiliations:
-;-
Venue:
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Year:
1997

Citing 4
Cited 3

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
A Distributed Heterogeneous Supercomputing Management System

Computer
Communication nets; stochastic message flow and delay

Communication nets; stochastic message flow and delay

A Stochastic Framework for Co-synthesis of Real-Time Systems

LCTES '00 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Statistical Prediction of Task Execution Times Through Analytic Benchmarking for Scheduling in a Heterogeneous Environment

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Comparison of DSP, RISC and transputer based systems for real time digital control implementation

Systems Analysis Modelling Simulation - Special issue: Digital signal processing and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. Subtask data relocation is defined as selecting the sources for their needed data items. This study focuses on theoretical issues for data relocation using a stochastic HC model. It is assumed that multiple independent subtasks of an application program can be executed concurrently on different machines whenever possible. A stochastic model for HC is proposed, in which the computation times of subtasks and communication times for inter-machine 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 optimization criteria and search space for the above optimization problem are described. It is proven that a greedy algorithm based approach will generate the optimal data relocation scheme with respect to any fixed matching and scheduling schemes. This result indicates that a greedy algorithm based approach is the best strategy for developing data relocation heuristics in practice.