• DocumentCode
    794641
  • Title

    Optimization of computation time for systolic arrays

  • Author

    Wong, Yiwan ; Delosme, Jean-Marc

  • Author_Institution
    Yale Univ., New Haven, CT, USA
  • Volume
    41
  • Issue
    2
  • fYear
    1992
  • fDate
    2/1/1992 12:00:00 AM
  • Firstpage
    159
  • Lastpage
    177
  • Abstract
    This work deals with the general case of processors with multiple, possibly pipelined, functional units that operate concurrently and presents a method for the minimization of the actual computation time nsys×tsys. The selection of a linear scheduling function, which minimizes nsys×tsys is formulated as a combinatorial optimization problem, which is shown to have a bounded search space. An efficient branch-and-bound method for the solution of that problem is proposed and applied to several examples
  • Keywords
    minimisation; multiprocessor interconnection networks; parallel algorithms; systolic arrays; bounded search space; branch-and-bound method; combinatorial optimization problem; computation time minimization; concurrency; linear scheduling function; multiple functional units; pipelined functional units; systolic arrays; Algorithm design and analysis; Computed tomography; Concurrent computing; Costs; Hardware; Parallel architectures; Processor scheduling; Scheduling algorithm; Systolic arrays; Time measurement;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.123393
  • Filename
    123393
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=794641