By Topic

Cyclo-static multiprocessor scheduling for the optimal realization of shift-invariant flow graphs

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
$31 $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)
Schwartz, D. ; Georgia Institute of Technology, Atlanta, GA ; Barnwell, T.P.

Cyclo-static processor solutions overcome the weaknesses of systolic processors and of SSIMD and PSSIMD solutions for the class of algorithms that can be described by cyclic shift-invariant flow graphs. Cyclo-static solutions are a broad family of processor (efficiency) optimal, synchronous, multiprocessor realizations that by appropriate design choices can be rate optimal, input-output delay optimal and communications optimal. For a given algorithm the cyclo-static family of solutions contains many classes which includes SSIMD and PSSIMD solutions as special cases, when they exist.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '85.  (Volume:10 )

Date of Conference:

Apr 1985