• DocumentCode
    2626823
  • Title

    Embedding between 2-D meshes of the same size

  • Author

    Shen, Xiaojun ; Liang, Weifa ; Hu, Qing

  • Author_Institution
    Comput. Sci. Telecommun. Program, Missouri Univ., Kansas City, MO, USA
  • fYear
    1993
  • fDate
    1-4 Dec 1993
  • Firstpage
    712
  • Lastpage
    719
  • Abstract
    It is shown how to embed an x1 × 11 mesh M1 into an s2 × t2 mesh M 2, where s1 × t2, s1 < ti (i = 1,2) such that the dilation is minimized. It is assumed that load = 1 and expansion = 1. For each case there is shown a lower bound on the dilation and a corresponding embedding method. The dilations by these embedding algorithms either match a lower bound or are very close to a lower bound
  • Keywords
    parallel algorithms; parallel architectures; 2D meshes; algorithms; dilation; embedding; embedding method; lower bound; minimized; Algorithm design and analysis; Binary trees; Cities and towns; Computer science; Hypercubes; Network topology; Parallel algorithms; Parallel processing; Upper bound; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
  • Conference_Location
    Dallas, TX
  • Print_ISBN
    0-8186-4222-X
  • Type

    conf

  • DOI
    10.1109/SPDP.1993.395463
  • Filename
    395463