Parallel Address Setting Schemes for Complete-binary-tree-connected Machines

スポンサーリンク

概要

• 論文の詳細を見る

• The concept of processor address in parallel computer architectures sometimes plays an important role in the design of SIMD-type parallel algorithms. In this paper we consider an address setting problem on complete-binary-tree-connected cellular computers, consisting of many identical processors each with its own address. The problem is to design a parallel algorithm which can assign pre-specified binary address to each processor. Several time-efficient bit-wise address setting schemes with O(log_2 n) time complexities are developed for the complete-binary-tree-connected machines having O(n) processors.

• 一般社団法人情報処理学会の論文
• 1987-03-15

著者

• Umeo Hiroshi

  Dept.of Applied Electronic Engineering Faculty Of Engineering Osaka Electro-communication Univ.

関連論文

• Parallel Address Setting Schemes for Complete-binary-tree-connected Machines

スポンサーリンク