By Topic

Scheduling of DSP data flow graphs with processing times characterized by fuzzy sets

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 ; Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada ; M. O. Ahmad ; A. Shatnawi

In recent years a great deal of research has been conducted in the area of scheduling DSP data flow graphs onto multiprocessing systems. Most of the static scheduling techniques assume the worst case or the best case computational delay of the functional units used in the target architecture. This assumption is not realistic, since some of the computational times of the DSP tasks may be imprecise due to the fact that during early design phases, the characteristics of the final implementation of the functional units are not be known. In this paper, the impreciseness of the processing times of the functional units is taken into consideration by considering them as fuzzy sets, and then using fuzzy arithmetic to build the time schedule. The range of control steps (mobility) which represents the possible firing times of a task is determined, and a fuzzy rule base is employed to infer the degree of acceptability in selecting a certain control step within this range.

Published in:

Electrical and Computer Engineering, 2004. Canadian Conference on  (Volume:3 )

Date of Conference:

2-5 May 2004