<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

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

Subject: search.filters.subject.PARALLEL ALGORITHM

Search Results

Now showing 1 - 6 of 6
  • Thumbnail Image
    Item type:Item,
    AN OPTIMAL PARALLEL ALGORITHM FOR GENERATING PERMUTATIONS IN MINIMAL CHANGE ORDER
    (1994-03-01)
    TSAY, JC
    ;
    LEE, WP
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processors. Because of the simplicity and regularity of the processors, the model is very suitable for VLSI implementation. Another advantageous characteristic of this design is that it can generate all the permutations in minimal change order.
  • Thumbnail Image
    Item type:Item,
    PARALLEL PERMUTATION GENERATION ON LINEAR-ARRAY
    (1991)
    LIN, CJ
    ;
    交大名義發表
    ;
    應用數學系
    ;
    National Chiao Tung University
    ;
    Department of Applied Mathematics
  • Thumbnail Image
    Item type:Item,
    A SYSTOLIC ALGORITHM FOR SOLVING KNAPSACK-PROBLEMS
    (1994)
    LIN, CJ
    ;
    CHEN, SJ
    ;
    應用數學系
    ;
    Department of Applied Mathematics
    A systolic algorithm for solving the O/1-knapsack problems with n items is presented. The computational model used is a tree structure which consists of 2(n) identical processing elements (PEs). Each PE executes the same program at any time step. The time complexity varies from n to 3n - 2 steps which includes all the input/output data communication time. The design process and the correctness verification of this algorithm are considered in detail.
  • Thumbnail Image
    Item type:Item,
    AN OPTIMAL PARALLEL ALGORITHM FOR GENERATING PERMUTATIONS IN MINIMAL CHANGE ORDER
    (1994-03-01)
    TSAY, JC
    ;
    LEE, WP
    ;
    交大名義發表
    ;
    工學院
    ;
    National Chiao Tung University
    Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processors. Because of the simplicity and regularity of the processors, the model is very suitable for VLSI implementation. Another advantageous characteristic of this design is that it can generate all the permutations in minimal change order.
  • Thumbnail Image
    Item type:Item,
    AN OPTIMAL PARALLEL PERCEPTRON LEARNING ALGORITHM FOR A LARGE TRAINING SET
    (1994-03-01)
    HONG, TP
    ;
    TSENG, SS
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In [2], a parallel perceptron learning algorithm on the single-channel broadcast communication model was proposed to speed up the learning of weights of perceptrons [3]. The results in [2] showed that given n training examples, the average speedup is 1.48*n0.91/log n by n processors. Here, we explain how the parallelization may be modified so that it is applicable to any number of processors. Both analytical and experimental results show that the average speedup can reach nearly O(r) by r processors if r is much less than n.
  • 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.