A conservative scheme for parallel interval narrowing

Abstract An efficient parallel interval narrowing algorithm for solving numerical problems is designed, implemented and tested. Differences with the corresponding sequential algorithm are clearly stated. The algorithm's performance is analyzed in the Bulk-Synchronous Parallel (BSP) cost model which suggests speed-ups on high-bandwidth architectures. Experimental results on a massively parallel machine Cray T3E-1200 validate the model and show the parallel algorithm's efficiency as well as its limitations.

[1]  G. Hains,et al.  Towards high-quality, high-speed numerical computation , 1997, 1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-1997.

[2]  Frédéric Goualard,et al.  Box consistency through weak box consistency , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

[3]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[4]  Frédéric Benhamou,et al.  Heterogeneous Constraint Solving , 1996, ALP.

[5]  Torsten Suel,et al.  BSPlib: The BSP programming library , 1998, Parallel Comput..

[6]  Eric Monfroy,et al.  Chaotic iteration for distributed constraint propagation , 1999, SAC '99.

[7]  Michel Cosnard,et al.  Numerical Solution of Nonlinear Equations , 1979, TOMS.

[8]  Ansi Ieee,et al.  IEEE Standard for Binary Floating Point Arithmetic , 1985 .

[9]  Guido D. Salvucci,et al.  Ieee standard for binary floating-point arithmetic , 1985 .

[10]  Laurent Granvilliers.  Consistances locales et transformations symboliques de contraintes d'intervalles , 1998 .

[11]  Arnaud Gotlieb,et al.  Dynamic Optimization of Interval Narrowing Algorithms , 1998, J. Log. Program..

[12]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.