High performance computing is rapidly evolving towards parallel processing . Among various issues in applying parallel processing to computer cartography, a major concern is the compatibility between parallel computational models and existing cartographic data structures as well as algorithms . This paper assesses the suitability of topological data structures for Data Parallel Processing in co...

Distributed data structures are those that are shared by parallel processes. They provide a flexible and useful mechanism for parallel programming. This paper shows how distributed data structures can be programmed in a simple paradigm called 4P (short for procedures with preconditions as parallel programs). In the 4P paradigm, processes can specify different modes of access to the required par...

In this paper, a systematic methodology for enumeration of the kinematic structures of parallel manipulators is presented. Parallel manipulators are classified into planar, spherical, and spatial mechanisms. The classification is followed by an enumeration of the kinematic structures according to the degrees of freedom and connectivity listing. In particular, a class of parallel manipulators wi...

This paper considers the main algorithmic issues associated with developing parallel mesh adaptivity software for use with tetrahedral-based parallel nite element or nite volume solvers for transient computational mechanics problems in three space dimensions. Issues that are addressed include the use of diierent parallel data structures, the modiication of these data structures when adaptivity ...

PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs. Base on these theories we define a model of parallel computation with a very high level of abstraction – PARES (Parallel Recursive ...