use of parallel level 3 blas in lu factorization on three vector multiprocessors the alliant fx/80, the cray-2, and the ibm 3090 vf
We show how to transform the B-spline curve and surface fitting problems into suffix computations of continued fractions. Then a parallel substitution scheme is introduced to compute the suffix values on a newly proposed mesh-of-unshuffle network. The derived parallel algorithm allows the curve interpolation through n points to be solved in &Ogr;(log n ) time using &THgr; n /log n ) processors and allows the surface interpolation through m x n points to be solved in &Ogr;(log m log n ) time using &THgr; ( mn /(log m log n )) processors. Both interpolation algorithms are cost-optimal for their respective problems. Besides, the surface fitting problem can be even faster solved in &Ogr;(log m + log n ) time if &THgr;( mn ) processors are used in the network.
use parallel factor vectorization processor transformation surface fit computation scheme values network parallel algorithm algorithm interpolation point log timing mesh optimality cost