A parallel algorithm for Lagrange interpolation on the star graph

Journal of Parallel and Distributed Computing

Volumn 62, Issue 4, 2002, Pages 605-621

  Sarbazi Azad, H ^a   Ould Khaoua, M ^a   Mackenzie, L M ^a   Akl, S G ^b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

Cost performance analysis; Hypercubes; Interconnection networks; Lagrange interpolation; Parallel algorithms; Speedup; Star graph; Tori

Indexed keywords

EID: 0036113979     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2001.1812     Document Type: Article

References (19)

1. The star graph: An attractive alternative to the n-cube
2. "Parallel Computation: Models and methods"
3. A novel routing scheme on the star and pancake networks and its applications
4. Fundamentals algorithms for the star and pancake interconnection networks with applications to computational geometry
5. Building Hamiltonian circuits and paths on star graphs
6. Parallel solution of dense linear systems on the k-ary n-cube networks
7. Optimal information dissemination in star and pancake networks
8. Systolic computation of interpolation polynomials
9. Speed versus efficiency in parallel systems
10. A parallel algorithm for computing Fourier transform on the star graph
11. Lagrange interpolation on a tree of processors with ring connections
12. Iterated interpolation using a systolic array
13. An efficient sorting algorithm for the star graph interconnection network
14. Embedding Hamiltonians and hypercubes in star inter-connection graphs
15. "Design Issues in High Performance Floating Point Arithmetic Units"
16. Load balancing, selection and sorting on the star and pancake interconnection networks
17. Employing K-ary n-cubes for parallel Lagrange interpolation
18. Parallel Lagrange interpolation on the star