Locally computable coding for unary operations

Hiroto Yasuura

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

Coding plays an important role in the design of parallel algorithms. When each digit of a result of a desired operation depends only on a part of digits of operands under a coding scheme, we say the operation is locally computable under the coding scheme. There is a closed relation between local computability and redundancy of codes. Several excellent algorithms utilizing local computability by redundant coding schemes are developed and used practically. The problem to examine the relation among coding schemes, local computability and algebraic structures of target operations is a basic problem on the design of parallel algorithms. In this paper, we discuss a relation between redundancy of coding schemes and local computability of unary operations defined on finite sets. We show that it is generally impossible to realize local computability by nonredundant coding schemes. If we introduce redundancy into coding, we can construct a coding under which every digit of a result depends only on 2 digits of an operand for any unary operations. These results are closely related with a state assignment problem of finite state machines. The above 2-locally computable coding derives a state assignment of a pipelined sequential circuit for an arbitrary sequential machine.

本文言語英語
ホスト出版物のタイトルConcurrency
ホスト出版物のサブタイトルTheory, Language, and Architecture - UK/Japan Workshop, Proceedings
編集者Takayasu Ito, Akinori Yonezawa
出版社Springer Verlag
ページ312-323
ページ数12
ISBN(印刷版)9783540464525
DOI
出版ステータス出版済み - 1 1 1991
外部発表はい
イベントUK/Japan Workshop on Concurrency Theory, 1989 - Oxford, 英国
継続期間: 9 25 19899 27 1989

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
491 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他UK/Japan Workshop on Concurrency Theory, 1989
Country英国
CityOxford
Period9/25/899/27/89

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Locally computable coding for unary operations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル