scientific article; zbMATH DE number 3974298
From MaRDI portal
Publication:3740238
[For the entire collection see Zbl 0578.00003.] In this paper we consider an address setting problem on tree-structured 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 addresses to each processor. Several time- efficient bit-wise address setting schemes with \(0([\log_ 2n])\) time complexities, all suitable for VLSI implementations, are developed for the depth \([\log_ 2n]\) binary tree-connected machines.
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740238)