Datatype (MAD) [Hud92], based on a functional construct called a Monad. This group has also developed a parallel programming model based on these constructs that allows explicitly parallel programs to be written that operate on these functional mutable data types [JH93]. This model uses a programming structure that is equivalent to our intermediate form to describe parallel computations in a re...

In this work we present eecient and practical randomized data structures on the Bulk-Synchronous Parallel (BSP) model of computation along with an experimental study of their performance. In particular, we study data structures for the realization of Parallel Priority Queues (PPQs) and Parallel Dictionaries (PDs). We show that our algorithms are communication eecient and achieve optimality to w...

Through the research of the parallel computational model based on the principal and subordinate mode and the basic theory of Gmres Algorithm in Krylov subspace, this essay raises a improvement parallel Predict-Correct Gmres(m) algorithm which posses Predict-Correct pattern, and shows the computing examples for linear equations. After the comparison with the result from the new parallel Predict-...

The Parallel Boost Graph Library (Parallel BGL) is a library of graph algorithms and data structures for distributed-memory computation on large graphs. Developed with the Generic Programming paradigm, the Parallel BGL is highly customizable, supporting various graph data structures, arbitrary vertex and edge properties, and different communication media. In this paper, we describe the implemen...