By Topic

Optimal multiprocessor implementations from a serial algorithm specification

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)
Lee, S.H. ; PAR Gov. Syst. Corp., Rome, NY, USA ; Barnwell, T.P., III

Techniques are presented for the automatic generation of optimal synchronous multiprocessor implementations from a serial specification of an algorithm. Although a total system is described, two elements of the system are of particular interest. These are series of graph operations which transform the algorithm to be implemented from its initial serial form into an optimal graph form and the mapping techniques which transform the resulting graph into a fully defined synchronous multiprocessor schedule. The final multiprocessor implementations are often maximally fast, perfectly efficient, minimum-delay realizations which can operate using a limited class of communications networks. The algorithms addressed are all members of a class of iteratively applied numeric techniques which are specified using a constrained subset of FORTRAN

Published in:

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Date of Conference:

11-14 Apr 1988