On high‐speed parallel algorithms using redundant coding

Hiroto Yasuura, Naofumi Takagi, Shuzo Yajima

研究成果: Contribution to journalArticle査読

抄録

We introduce a concept of local computability for designing high‐speed parallel algorithms on fan‐in restricted models. A function is k‐locally computable if each subfunction sepends on only at most k input variables. If k is a constant independent of n, the number of input variables, we can construct an O(1) time parallel algorithm for F on a fan‐in restricted computation model. In order to realize the local computability, we use a redundant coding scheme. We show that a binary operation of any finite Abelian group is k‐locally computable under a redundant coding scheme, where k is a constant independent of the order of the group. We also show that we can design a redundant coding scheme for a residue ring Zm of integers under which addition and multiplication can be performed in O(1) and O(log log log m) time, respectively, in parallel, when m is the product of the smallest r primes.

本文言語英語
ページ(範囲)72-80
ページ数9
ジャーナルSystems and Computers in Japan
18
12
DOI
出版ステータス出版済み - 1987
外部発表はい

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 情報システム
  • ハードウェアとアーキテクチャ
  • 計算理論と計算数学

フィンガープリント

「On high‐speed parallel algorithms using redundant coding」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル