By Topic

Parallel processor scheduling for digital signal processing

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

2 Author(s)
H. Kunieda ; Fac. of Eng., Tokyo Inst. of Technol., Japan ; S. Toyoshima

The authors study a method for deriving MIMD (multiple-instruction-stream, multiple-data-stream) multiprocessor scheduling with the shortest sampling duration, including processor communication time, for general signal processing algorithms. The method makes use of the repetitive nature of digital signal processing, which reduces the computational complexity of searching for the optimal assignment of operations to processors. The examples show that the proposed algorithm obtains the nearly optimum solution in most cases and works very efficiently

Published in:

Circuits and Systems, 1989., IEEE International Symposium on

Date of Conference:

8-11 May 1989