By Topic

A Processor Allocation of DSP Applications Onto Heterogeneous Multiprocessor Architectures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Itradat ; Concordia Univ., Montreal ; M. O. Ahmad ; A. Shatnawi

In recent years a great deal of research has been conducted in the area of scheduling of DSP data flow graphs (DFG) onto multiprocessing systems. In this paper, a new processor allocation technique is proposed. Both heterogeneous and general-purpose functional units are used during the resource allocation process. The proposed technique provides the designer with more flexibility to explore the design space by using different types of processing modules for the same task. The proposed allocation technique leads to different multiprocessor architectures for a given rate-optimal schedule of a DSP data flow graph. A satisfactory function is used to infer the quality of the obtained architectures in terms of the area and utilization of each of them. The proposed algorithm is applied to a well-known benchmark problem of DSP filter. It is seen that moving from a fully-homogenous to a fully-heterogeneous multiprocessor architecture results in decreasing the area of the design. However, a hybrid multiprocessor architecture brings about a trade off between the area and the utilization.

Published in:

2007 Canadian Conference on Electrical and Computer Engineering

Date of Conference:

22-26 April 2007