• DocumentCode
    1386339
  • Title

    A systolic array for the assignment problem

  • Author

    Schwiegelshohn, Uwe ; Thiele, Lothar

  • Author_Institution
    Inst. on Network Theory & Circuit Design, Technical Univ., Munich, West Germany
  • Volume
    37
  • Issue
    11
  • fYear
    1988
  • fDate
    11/1/1988 12:00:00 AM
  • Firstpage
    1422
  • Lastpage
    1425
  • Abstract
    A pure systolic realization of an algorithm for solving the n ×n assignment problem is presented. This systolic algorithm can be implemented on an homogeneous hexagonal processor array and requires O(n2) area complexity and O(n2) time complexity
  • Keywords
    cellular arrays; computational complexity; graph theory; optimisation; parallel processing; O(n2) area complexity; O(n2) time complexity; assignment problem; homogeneous hexagonal processor array; systolic array; Array signal processing; Computational geometry; Concurrent computing; Cost function; Graph theory; Linear algebra; Parallel processing; Signal processing algorithms; Systolic arrays; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.8709
  • Filename
    8709
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1386339