Towards high-quality, high-speed numerical computation

This paper discusses parallel processing of numerical problems via interval constraints. We first give a brief sketch of interval arithmetic, as this is the basis for interval constraints. Next we discuss the difficulties in exploiting the potential of parallel computers. The stage is then set for the introduction of interval constraints. This has the advantage that only two algorithms, search and constraint propagation, need to be parallelized, whatever the application. We discuss a version of a constraint propagation algorithm and comment on its parallelization.