查詢結果分析
相關文獻
- Parallel Two-dimensional Prefix Computation on a Mesh-connected Computer
- A Study of Parallel Two-dimensional Prefix Computation on the PRAM
- 廣播通訊模式的階層概念與碰撞
- 動態批量平行演算法之探討
- An Efficient Parallel List Ranking Algorithm on Arrays with Reconfigurable Optical Buses
- An Inter-Iteration Parallel Algorithm for PET Image Reconstruction
- 多方格連接計算機求對稱矩陣特徵值之平行演算法
- Parallel Algorithm for Solving Hamiltonian Problems
- Another Efficient Systolic Algorithm for the Longest Common Subsequence Problem
- MULTIPROCESSOR之平行演算法
頁籤選單縮合
題 名 | Parallel Two-dimensional Prefix Computation on a Mesh-connected Computer=在網狀連結平行計算機上之平行二維前置計算 |
---|---|
作 者 | 吳博雅; | 書刊名 | 臺南師院學報 |
卷 期 | 32 1999.06[民88.06] |
頁 次 | 頁377-394 |
分類號 | 310.153 |
關鍵詞 | 網狀連結計算機; 平行演算法; 時間複雜度; 二維前置計算; Mesh-connected computer; Parallel algorithm; Time-complexity; Two-dimensional prefix computation; |
語 文 | 英文(English) |
中文摘要 | 本文提供在網狀連結平行計算機上之平行二維前置計算。二維前置計算是對一矩 陣求其所有含第一列第一行元素之左上子矩陣內所有元素之和。這種計算能用於碎形影像壓 縮中計算子影像灰階值的和及求具最大和之子矩陣。首先,我們設計一使用 O(n �� ) 個處 理器而時間複雜度為 O(n) 之平行二維前置計算。然後,再將其改良為一使用 O(n) 個處理 器而時間複雜度為 O(n) 之最佳價格演算法。 |
英文摘要 | This paper provides parallel two-dimensional prefix computation on a mesh-connected machine. To perform the two-dimensional prefix computation is to compute the values ΣΣ Xij for all up-left submatrices [Xij ] �d�X, which contain the first row and first column element, x, of a matrix. This computation can calculate grayscale sums of subimages for the fractal image compression and find the maximum sum submatrix. First, we design a two-dimensional prefix computation with time complexity O(n) using O(n �� ) processors. Then, improve this algorithm to obtain a cost-optimal algorithm which runs in O(n) time using O(n) processors. |
本系統中英文摘要資訊取自各篇刊載內容。