• DocumentCode
    2848816
  • Title

    A block algorithm for the algebraic path problem and its execution on a systolic array

  • Author

    Nunez, F.J. ; Valero, Mateo

  • Author_Institution
    Dept. de Arquitectura de Computadores, Univ. Politecnica de Cataluna, Barcelona, Spain
  • fYear
    1988
  • fDate
    25-27 May 1988
  • Firstpage
    265
  • Lastpage
    274
  • Abstract
    The solution of the algebraic path problem (APP) for arbitrarily sized graphs by a fixed-size systolic array processor (SAP) is addressed. The APP is decomposed into two subproblems, and SAP is designed for each one. Both SAPs combined produce a highly implementable versatile SAP. The proposed SAP has p×p processing elements (PEs) solving the APP of an N-vertex graph in N3/p2+N2/ p+3p-2 cycles. With slight modifications in the operations performed by the PEs, the problem is optimally solved in N3/p2+3p-2 cycles
  • Keywords
    cellular arrays; computational complexity; graph theory; parallel algorithms; algebraic path problem; arbitrarily sized graphs; block algorithm; systolic array; Algebra; Contracts; Design methodology; Gaussian processes; Iterative algorithms; Matrix decomposition; Partitioning algorithms; Synthetic aperture sonar; Systolic arrays;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systolic Arrays, 1988., Proceedings of the International Conference on
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    0-8186-8860-2
  • Type

    conf

  • DOI
    10.1109/ARRAYS.1988.18067
  • Filename
    18067
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2848816