Parallel Algorithm for Hermite Interpolation on Hypercube Inter Connection Network

Abstract

The paper focuses on a faster and more parallel algorithm for N-point. Hermite interpolation on a dimensional hypercube with P = 2(n) processors. The algorithm is adapted to the scenario when the number of processors P < N and N is divisible by P. The paper focuses on the parallel Hermite interpolation algorithm for the hypercube network. The algorithm exhibits (N −1)O(logN ) time for execution.