One benefit of partitionable parallel processing systems is their ability to execute multiple, independent tasks simultaneously. Previous work has identified conditions such that, when there are k tasks to be processed, partitioning the system such that ...

Multistage networks for large-scale shared-memory multiprocessors are buffered to increase the throughput and hide the latency. This is achieved by pipelining consecutive memory requests from the same processor. However, unrestrictive pipelining may ...

The utilization of reusable software components can help to reduce the complexity of developing and maintaining parallel programs, but can lead to inefficiencies. The potential inefficiencies are addressed by providing a model of parallel execution (...

Presents parallel NC algorithms for all pair shortest path problem with optimal processor time product and single source shortest path problem with near optimal processor time product in k-chordal graphs. The algorithm for all pair problem runs in O(log/...

Parallel machines interconnecting up to thousands of processors have been proposed and recently built. One of the earliest and the most prominent one is a complete binary tree machine. The authors propose a family of tree machines called generalized ...

Studies the problem of parallel implementation of divide-and-conquer algorithms on binary de Bruijn network using a temporal binomial tree (rather than the usual binary tree) computation structure. Two cases of message volumes are considered: (i) ...

Parallel algorithms for more general versions of the well known selection and searching problems are formulated. The authors look at these problems when the set of elements can be represented as an n*n matrix with sorted rows and columns. The selection ...

Presents a parallel algorithm for verifying that a string X is formed by the shuffle of two strings Y and Z. The algorithm runs in O(log/sup 2/n) time with O(n/sup 2//log/sup 2/n) processors on the EREW-PRAM model.

A large number of the permutations realized by interconnection networks in parallel processing systems and digital arithmetic circuits, fall in the class of bit-permute-complement (BPC) permutations. The paper presents a methodology for routing this ...

Recently, the author has studied two important classes of algorithms requiring +or-2/sup b/ communications: +or-2/sup b/-descend, and +or-2/sup b/-ascend. Let N=2/sup n/ be the number of PEs in a SIMD hypercube which restricts all communications to a ...

Presents a fast parallel solution to the convex hull problem on a two dimensional reconfigurable mesh. The parallel algorithm computes the convex hull of N/sup 1/2/ planar points on a N/sup 1/2/*N/sup 1/2/ reconfigurable mesh. The algorithm is very ...

The authors design an efficient parallel algorithm for constructing a breadth-first spanning tree of an interval graph. Their novel approach is based on elegantly capturing the structure of a given collection of intervals. This structure reveals ...

Presents a formal derivation of a highly efficient parallel implementation of the 2-D Gauss-Seidel method for machines based on the two-dimensional mesh of processors. A methodology is illustrated which formalizes the process of mapping and scheduling a ...

The paper discusses an optimal parallel algorithm for tree form generation of arithmetic expressions on an SIMD-SM EREW model. The main idea is how to avoid the read conflict posted by Bar-On and Vishkin's algorithm (1985) by modifying their parenthesis ...

The article presents a parallel EREW PRAM algorithm that runs in O(log/sup 2/n) time using n/logn processors to optimally color the edges of an outerplanar graph. The algorithm improves the best known algorithm in both time, and number of processors. ...

The vertex updating problem for a minimum spanning tree (MST) is defined as follows: Given a graph G=(V,E/sub G/) and its MST T, update T when a new vertex z is introduced along with weighted edges that connect z with the vertices of G. The authors ...

The authors present parallel algorithms for heap operations on an EREW PRAM. They first present a parallel heap construction algorithm with p processors running in O(n/p+logp) time. It takes 3.625n/p+4log p time in the worst case. The algorithm is ...

Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. The paper presents an algorithm for a concurrent distributed B-tree that can be implemented on message passing parallel ...

The authors develop an O(n/sup 2/) time serial algorithm to obtain the medial axis transform (MAT) of an n*n image. An O(logn) time CREW PRAM algorithm and an O(log/sup 2/n) time SIMD hypercube parallel algorithm for the MAT are also developed. Both of ...