Parallel hermite interpolation on the pyramid

Author

Larijani, E. ; Sarbazi-Azad, H.

Author_Institution

Inst. for Studies in Theor. Phys. & Math. (IPM), Tehran

fYear

2007

fDate

7-9 Nov. 2007

Firstpage

1

Lastpage

5

Abstract

The pyramid network is one of the most important interconnection topologies used as hardware architecture or software data structure. It has a combined tree-mesh structure making it suitable for solving many parallel problems and applications. This paper proposes a parallel algorithm for Hermite Interpolation on the Pyramid network which has at least N nodes. The proposed algorithm has 3 phases: initialization, main, and final. The algorithm is optimal with a time complexity of O(N) for an appoint interpolation.

Keywords

Hermitian matrices; computational complexity; interpolation; multiprocessor interconnection networks; parallel algorithms; telecommunication network topology; tree data structures; appoint interpolation; hardware architecture; interconnection topology; parallel Hermite interpolation; parallel algorithm; pyramid network; software data structure; time complexity; tree-mesh structure; Application software; Bismuth; Computer architecture; Computer science; Data structures; Hardware; Interpolation; Network topology; Parallel algorithms; Scientific computing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and information sciences, 2007. iscis 2007. 22nd international symposium on

Conference_Location

Ankara

Print_ISBN

978-1-4244-1363-8

Electronic_ISBN

978-1-4244-1364-5

Type

conf

DOI

10.1109/ISCIS.2007.4456896

Filename

4456896