No label defined (Q4728254)

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 4003535
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4003535

      Statements

      0 references
      0 references
      1986
      0 references
      hardware algorithms
      0 references
      parallel algorithms
      0 references
      Algebraic Path Problem
      0 references
      orthogonal systolic array
      0 references
      [For the entire collection see Zbl 0597.00031.] The Algebraic Path Problem is a general framework which unifies several algorithms arising from various fields of computer science. \textit{G. Rote} [Computing 34, 191-219 (1985; Zbl 0546.68047)] introduces a general algorithm to solve any instance of the APP, as well as a hexagonal systolic array of \((n+1)^ 2\) elementary processors which can solve the problem in 7n-2 time steps. We propose a new algorithm to solve the APP, and demonstrate its equivalence with Rote's algorithm. The new algorithm is more suitable to parallelization: we propose an orthogonal systolic array of \(n(n+1)\) processors which solves the APP within only 5n-2 steps.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references