By Topic

On the hierarchical design of VLSI processor arrays

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

1 Author(s)
Thiele, L. ; Univ. des Saarlandes, Saarbrucken, West Germany

The author investigates systematic methods for the design of processor arrays. The proposed concept enables the efficient realization of more general classes of algorithms than the systolic concept. In particular, instance-dependent branching, instance-dependent processor configurations, and hierarchical formulations of imperative programs can be taken into account. The concept of a piecewise-regular dependence graph and that of its reduced description is given. The definition of piece-wise regular algorithms leads to their mapping onto piecewise regular systolic arrays using piecewise linear transformations. The hierarchical description of algorithms and dependence graphs and the corresponding transformations such as condensation, unfolding, clustering and unclustering are applied to partitioning problems (assignment, schedule segmentation, multidimensional mapping)

Published in:

Circuits and Systems, 1988., IEEE International Symposium on

Date of Conference:

7-9 Jun 1988