No label defined (Q3740238)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3974298
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3974298

      Statements

      0 references
      1986
      0 references
      tree-structured cellular computers
      0 references
      identical processors
      0 references
      parallel algorithm
      0 references
      VLSI implementations
      0 references
      binary tree-connected machines
      0 references
      [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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references