Loading...

Parallel Lagrange interpolation on k-ary n-cubes with maximum channel utilization

Mahabadi, A ; Sharif University of Technology | 2008

271 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s11227-008-0179-z
  3. Publisher: 2008
  4. Abstract:
  5. This paper proposes an efficient parallel algorithm for computing Lagrange interpolation on k-ary n-cube networks. This is done using the fact that a k-ary n-cube can be decomposed into n link-disjoint Hamiltonian cycles. Using these n link-disjoint cycles, we interpolate Lagrange polynomial using full bandwidth of the employed network. Communication in the main phase of the algorithm is based on an all-to-all broadcast algorithm on the n link-disjoint Hamiltonian cycles exploiting all network channels, and thus, resulting in high-efficiency in using network resources. A performance evaluation of the proposed algorithm reveals an optimum speedup for a typical range of system parameters used in current state-of-the-art implementations. © 2008 Springer Science+Business Media, LLC
  6. Keywords:
  7. Boolean functions ; Computer networks ; Hamiltonians ; Interpolation ; Lagrange multipliers ; Interconnection networks ; K-ary n-cubes ; Lagrange interpolation ; Link-disjoint Hamiltonian cycles ; Multicomputers ; Performance analysis ; Parallel algorithms
  8. Source: Journal of Supercomputing ; Volume 46, Issue 1 , 2008 , Pages 1-14 ; 09208542 (ISSN)
  9. URL: https://link.springer.com/article/10.1007/s11227-008-0179-z