By Topic

Optimal automatic periodic multiprocessor compiler for multi-bus networks

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)
Gelabert, P.R. ; Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Barnwell, T.P., III

The theory and performance of a deterministic, optimal synchronous compiler for multiprocessor systems with a multibus interconnection network are presented. This compiler takes an algorithm described by a flow graph and produces realizations that meet traditional optimality criteria. These realizations are implemented on a multiprocessor system with the minimum number of buses possible. The compiler consists of three elements: flow graph analysis, scheduler, and processor assignment. The processor assignment module is discussed in detail. This module computes the bus communication bound from the schedule produced by the scheduler module. Based on this bound, the processor assignment module rearranges the schedule to use the minimum multibus interconnection network. The experimental study of the performance of this compiler emphasizes several adaptive and nonadaptive digital filters

Published in:

Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on  (Volume:5 )

Date of Conference:

23-26 Mar 1992