Embedding of Hypercube into Fractal Cubic Network

Rajan R. S., Reji R. M., Sadagopan N., CANGÜL İ. N.

PARALLEL PROCESSING LETTERS, 2024 (ESCI) identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 2024
  • Doi Numarası: 10.1142/s0129626424500087
  • Dergi Adı: PARALLEL PROCESSING LETTERS
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, Academic Search Premier, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Compendex, Computer & Applied Sciences, zbMATH
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

The implementation of parallel algorithms and the simulation of interconnection networks can be modeled into a graph embedding problem. Several cost parameters are used to assess the quality of an embedding. The wirelength is one of these factors that is frequently taken into account. A fractal cubic network is a new variant of the hypercube graph. In this study, we compute the wirelength of an embedding of the hypercube Q2r into the fractal cubic network FCN(r - 1) using Theta(& lowast;)-partition.