Determining objective functions in systolic array designs

Zhang, C.N.; Weston, J. H.; Yan, Yujin

doi:10.1109/92.311644

Cited by 12 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Among them only one, belonging to Class I has minimal number of PEs for the given matrix dimensions. This can be proved according to the following corollary as given in [23]. …”

Section: Modification Of the Design Proceduresmentioning

confidence: 96%

Forty-three ways of systolic matrix multiplication

Milovanovic

Bekakos

Tselepis

et al. 2010

International Journal of Computer Mathematics

View full text Add to dashboard Cite

“…Among them only one, belonging to Class I has minimal number of PEs for the given matrix dimensions. This can be proved according to the following corollary as given in [23]. …”

Section: Modification Of the Design Proceduresmentioning

confidence: 96%

Forty-three ways of systolic matrix multiplication

Milovanovic

Bekakos

Tselepis

et al. 2010

International Journal of Computer Mathematics

View full text Add to dashboard Cite

“…One from hexagonal group SAs, which also belong to planar SAs and that have all components of projection direction which have only value ±1, only the SA given for projection direction µ = [1 1 1] T enables the calculation of high dependability, therefore it has t p = 3. This SA has been much studied in the literature as one fault tolerant design (see [5,7,10]). …”

Section: Case (I)mentioning

confidence: 99%

Calculations of High Dependability on Flowing Systolic Arrays for Two Matrix Multiplication

Ranđelović¹

2011

Discrete Math. Algorithm. Appl.

View full text Add to dashboard Cite

The objective of this paper is to discuss systolic arrays (SAs) that are suitable for regular three-nested loop algorithms implementation and which enable the possibility of high dependability calculations for the SAs obtained in this way. This is made by considering the different possible values of flow period of processor for SAs synthesized on adaptable algorithms. Therefore, the algorithm for two matrix multiplication is one typical adaptable algorithm obtained results illustrated in the end of this paper by the examples of two rectangular matrix multiplication realized with the so called flowing and hexagonal two dimensional 2D SAs of planar SAs group.

show abstract

“…The communication links between the PEs are obtained by mapping dependency matrix Q, defined in (3), using the same matrix S. However, the obtained BLSA is not optimal with respect to the number of PEs for a given problem size. According to Theorem defined in [13], it can be concluded that number of PEs in this BLSA is Ω = 2n − 1. In order to obtain SA with optimal number of PEs, i.e.…”

Section: The Systolic Algorithmmentioning

confidence: 99%

Finding minimum cost spanning tree on bidirectional linear systolic array

Milovanovic

Randjelovic

et al. 2009

Filomat

View full text Add to dashboard Cite

In this paper a bidirectional linear systolic array (BLSA) that computes minimum cost spanning tree (MCST) of a given graph is designed. We present a synthesis procedure, based on data dependencies and space-time transformations of index space, to design BLSA with optimal number of processing elements (PEs) for a given problem size. The execution time is minimized for that number of PEs. Explicit mathematical formulas for systolic array synthesis are derived. We compare performances of the BLSA with the unidirectional linear systolic array (ULSA).

show abstract

Determining objective functions in systolic array designs

Cited by 12 publications

References 10 publications

Forty-three ways of systolic matrix multiplication

Forty-three ways of systolic matrix multiplication

Calculations of High Dependability on Flowing Systolic Arrays for Two Matrix Multiplication

Finding minimum cost spanning tree on bidirectional linear systolic array

Contact Info

Product

Resources

About