Parallel and Distributed Processing Symposium, International (2001)
San Francisco, California, USA
Apr. 23, 2001 to Apr. 27, 2001
In this paper, we study the problem of mapping a set of independent paths onto a heterogeneous real-time system. Each path is a pipeline of several stages where each stage consists of one application. Each path has latency and throughput requirements that have to be satisfied. The general goal of this problem is to find an initial static mapping of all applications onto available system resources to maximize the allowable increase in input load, until dynamic re-mapping is required to avoid Quality of Service (QoS) violations on any path. The objective function considered in this paper is to find a static mapping such that the sum of the latencies of all paths is minimized, while satisfying all latency and throughput requirements. The motivation behind it is to give more room for each path to accommodate additional load at run-time. We develop an integer programming (IP) formulation for modeling this mapping problem. By solving the formulation, a feasible mapping can be found that satisfies latency and throughput requirements of all paths and optimizes the objective function. Two heuristics are given along with the IP formulation to provide efficient solutions. Experimental results show the correctness of the IP formulation and the effectiveness of our heuristics.
Sethavidh Gertphol, Yang Yu, Ammar Alhusaini, Viktor K. Prasanna, "An Integer Programming Approach for Static Mapping of Paths onto Heterogeneous Real-Time Systems", Parallel and Distributed Processing Symposium, International, vol. 03, no. , pp. 30095a, 2001, doi:10.1109/IPDPS.2001.925055