• DocumentCode
    1151042
  • Title

    An Improved Distribution Algorithm for Shortest Paths Problem

  • Author

    Lakani

  • Author_Institution
    Department of Electrical Engineering and Computer Science, Texas Tech University
  • Issue
    9
  • fYear
    1984
  • Firstpage
    855
  • Lastpage
    857
  • Abstract
    The time complexity of a distributed algorithm [5] for all-pair shortest path problem is improved by a factor 0(n) by pipelining instructions. Its implementation using VLSI technology is proposed and area complexity is computed.
  • Keywords
    Distributed algorithms; VLSI layout; pipelining; shortest paths computation; systolic architecture; Computer architecture; Concurrent computing; Costs; Distributed algorithms; Distributed computing; Hardware; Pipeline processing; Read-write memory; Shortest path problem; Very large scale integration; Distributed algorithms; VLSI layout; pipelining; shortest paths computation; systolic architecture;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1984.1676503
  • Filename
    1676503
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1151042