<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.TSAY, JCSubject: search.filters.subject.CYLINDRICAL ARRAY

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item type:Item,
    SOME COMBINATORIAL ASPECTS OF PARALLEL ALGORITHM DESIGN FOR MATRIX MULTIPLICATION
    (1992-03-01)
    TSAY, JC
    ;
    SY, Y
    ;
    工學院
    ;
    College of Engineering
    In this paper, some combinatorial characteristics of matrix multiplication on regular two-dimensional arrays are studied. From the studies, we are able to design many efficient varieties of the cylindrical array and the two-layered mesh array for matrix multiplication. To design a cylindrical array for matrix multiplication, a systematic design procedure is proposed. In this design procedure, Latin square (a special type of matrix) plays an important role. To design a two-layered mesh array, we find that there is a transformation procedure to transform a cylindrical array to a two-layered mesh array.
  • Thumbnail Image
    Item type:Item,
    UNIFIED APPROACH TO DESIGNING PARALLEL WINOGRAD ALGORITHMS
    (1994-05-01)
    YUAN, S
    ;
    TSAY, JC
    ;
    交大名義發表
    ;
    工學院
    ;
    National Chiao Tung University
    Although the recurrence equation for the Winograd algorithm is uniform, no unified approach has been proposed to design parallel Winograd algorithms. In the paper the authors propose a unified approach to designing parallel Winograd algorithms. Using this approach, several parallel algorithms are designed. These algorithms are executed on regular arrays including conventional systolic arrays and nonplanar regular arrays. A comparison of their performance is given.
  • Thumbnail Image
    Item type:Item,
    A FAMILY OF EFFICIENT REGULAT ARRAYS FOR ALGEBRAIC PATH PROBLEM
    (1994-07-01)
    CHANG, PY
    ;
    TSAY, JC
    ;
    交大名義發表
    ;
    工學院
    ;
    National Chiao Tung University
    It has been shown that the method of decomposing a dependence graph into multiple phases with appropriate m-phase schedule function is useful for designing faster regular arrays for matrix multiplication and transitive closure. In this paper, we will further apply this method to design several parallel algorithms for Algebraic Path Problem and derive N x N 2-D regular arrays with execution time [9N/2] - 2 (cylindrical array and orthogonal one) and 4N - 2 (spherical one).
  • Thumbnail Image
    Item type:Item,
    DESIGN OF EFFICIENT REGULAR ARRAYS FOR MATRIX MULTIPLICATION BY 2-STEP REGULARIZATION
    (1995-02-01)
    TSAY, JC
    ;
    CHANG, PY
    ;
    交大名義發表
    ;
    工學院
    ;
    National Chiao Tung University
    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. The regular iterative algorithms are then spacetime mapped to regular arrays, such as mesh, cylindrical, two-layered mesh, and orbital arrays. The proposed method can be used to design regular arrays with execution time of less than N (problem size).