Please use this identifier to cite or link to this item:
Title: Optimal assignment with guaranteed confidence probability for trees on heterogeneous DSP systems
Authors: Qiu, M
Liu, M
Chun, X
Shao, Z 
Zhuge, Q
Sha, EHM
Issue Date: 2005
Source: The 17th IASTED International Conference on Parallel and Distributed Computing Systems, Phoenix, Arizona, U.S.A., 14-16 Nov. 2005, p. 295-300
Abstract: In real-time digital signal processing (DSP) architectures using heterogeneous functional units (FUs), it is critical to select the best FU for each task. However, some tasks may not have fixed execution times. This paper models each var ied execution time as a probabilistic random variable and solves heterogeneous assignment with probability (HAP) problem. The solutions to the HAP problem are useful for both hard real time and soft real time systems. We propose optimal algorithms for the HAP problem when the input is a tree or a simple path. The experiments show that our algorithms can effectively obtain the optimal solutions to simple paths and trees. For example, with our algorithms, we can obtain an average reduction of 32.5% on total cost with 90% confidence probability compared with the previ ous work using worst-case scenario.
Keywords: Assignment
Real time
Appears in Collections:Conference Paper

Show full item record

Page view(s)

Last Week
Last month
Citations as of Sep 21, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.