Search

Costs of a simplex or single-version system are compared with fault-tolerant software systems including N-version programming (NVP), recovery block (RB), and consensus recovery block (CRB). Assuming that failures are independent, CRB followed by RB are found to be the most cost-justifiable fault-tolerant techniques. NVP is not competitive with the other two methods in terms of costs.

Interactive three-dimensional graphics applications, such as terrain data representation and manipulation, require extensive arithmetic processing. Massively parallel machines are attractive for this application since they offer high computational rates, and grid connected architectures provide a natural mapping for grid based terrain models. Presented here are algorithms for data movement on the massive parallel processor (MPP) in support of pan and zoom functions over large data grids. It is an extension of earlier work that demonstrated real-time performance of graphics functions on grids that were equal in size to the physical dimensions of the MPP. When the dimensions of a data grid exceed the processing array size, data is packed in the array memory. Windows of the total data grid are interactively selected for processing. Movement of packed data is needed to distribute items across the array for efficient parallel processing. Execution time for data movement was found to exceed that for arithmetic aspects of graphics functions. Performance figures are given for routines written in MPP Pascal.

The cardinal spline approach to defining interpolatory curves is of interest in the application of computer graphics to modelling and animation problems. The formulation of this interpolation problem (C) a vector valued function V is obtained which forms a C1 map from 0,n into the plane in such a way that V(i) and V prime (i) attain prespecified (vector) values P sub i and T sub i for the integers i=0, 1,...n. The intent is that the planar curves V(s) pass through each point P sub i in the direction corresponding to T sub i. In actual practice it is common for only the interpolation points P sub i to be user specified. Suitable tangents T sub i are then provided by some heuristic to complete the specification of (C). A convex control polygon yields a convex interpolant. Examples exist where the interpolant fails to be convex if the tangents are left unbiased.