• DocumentCode
    3348714
  • Title

    A tight bound on the diameter of one dimensional PEC networks

  • Author

    Lin, Cho-Chin ; Prasanna, Viktor K.

  • Author_Institution
    Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    1992
  • fDate
    1-4 Dec 1992
  • Firstpage
    368
  • Lastpage
    375
  • Abstract
    The diameter of a packed exponential connections (PEC) network on N nodes is shown to be θ(√log N×2√(2log/ N)<sup>, where log N denotes log to the base 2. The present results can be extended to the case of two-dimensional PEC networks
  • Keywords
    computer networks; one dimensional PEC networks; packed exponential connections; tight bound; Broadcasting; Computer networks; Hardware; Large-scale systems; Multiprocessor interconnection networks; Nearest neighbor searches; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
  • Conference_Location
    Arlington, TX
  • Print_ISBN
    0-8186-3200-3
  • Type

    conf

  • DOI
    10.1109/SPDP.1992.242722
  • Filename
    242722
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3348714