• Publications
  • Influence
Design of Efficient Regular Arrays for Matrix Multiplication by Two-Step Regularization
TLDR
A two-step regularization method in which first permutation sequences and then broadcast planes are selected is proposed to design various regular iterative algorithms for matrix multiplication. Expand
  • 15
  • 1
  • PDF
A Systolic Design for Generating Permutations in Lexicographic Order
TLDR
We design a systolic algorithm for generating all N! permutations of N objects. Expand
  • 8
  • 1
Fully static processor-optimal assignment of data-flow graphs
  • Y. Ho, J. Tsay
  • Computer Science
  • IEEE Signal Process. Lett.
  • 1 May 1997
TLDR
The data-flow graph (DFG) is an important graph-theoretic model for multiprocessor implementation of real-time digital signal processing (DSP) algorithms. Expand
  • 3
  • 1
A Family of Efficient Regular Arrays for Algebraic Path Problem
TLDR
The method of decomposing a dependence graph into multiple phases with an appropriate m-phase schedule function is useful for designing faster regular arrays for matrix multiplication and transitive closure. Expand
  • 10
  • PDF
A systolic generation of combinations
TLDR
A parallel algorithm for generating all combinations ofm (m fixed) items out of anyn given items in lexicographic order is presented. Expand
  • 11
  • PDF
Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure
TLDR
We present some new regular iterative algorithms for matrix multiplication and transitive closure based on spacetime mapping the 2-D arrays with 2-1 and upper bound [(3N-1)/2] execution rime. Expand
  • 14
  • PDF
Some Combinatorial Aspects of Parallel Algorithm Design for Matrix Multiplication
  • J. Tsay, Sy Yuan
  • Mathematics, Computer Science
  • IEEE Trans. Computers
  • 1 March 1992
TLDR
Some combinatorial characteristics of matrix multiplication on regular two-dimensional arrays are studied. Expand
  • 7
  • PDF
Design of Space-Optimal Regular Arrays for Algorithms with Linear Schedules
TLDR
The problem of designing space-optimal 2D regular arrays for N/spl times/N/spl Times/N cubical mesh algorithms with linear schedule ai+bj+ck, 1/Spl les/a/spl les/b/ spl les/c, and N=nc, is studied. Expand
  • 9
  • PDF
An Optimal Parallel Algorithm for Generating Permutations in Minimal Change Order
TLDR
We present an optimal parallel algorithm to generate all N! permutations of N objects on a linear array with N identical processors. Expand
  • 4
...
1
2
3
4
...