This paper presents performance results for parallel algorithms that compute the longest common subsequence of two strings. This algorithm is a representative of a class of algorithms that compute string to string distances and has computational complexity O(n). The parallel algorithm uses a variable grid size, runs in O(p) supersteps (synchronization phases) and has linear communication costs....

The transcription factor Osf2/Cbfa1 is a key regulator of osteogenic differentiation while BSP, a major non-collagenous protein, is a marker of osteoblastic differentiation. To determine the relationship between Osf2/Cbfa1 and the formation of mineralized tissues in tooth development we have studied the temporal expression of Osf2/Cbfa1 and BSP mRNA using in situ hybridization. These studies sh...

The Bulk-Synchronous Parallel (BSP) model is a universal abstraction of parallel computation that can be used to design portable parallel software. Advances in processor architecture and network communication enable clusters of workstations to be used as parallel computers. This paper focuses on using the idle computing power of a network of workstations to run parallel programs. The transient ...

Bone sialoprotein (BSP) is a protein thought to be highly specific for bone. BSP contains an arginine-glycineaspartic acid (RGD) cell attachment sequence involved in osteoclast adhesion to bone matrix via the vitronectin receptor and plays an important role in the early process of bone mineralization and resorption. The study by Bellahcène et al1 in this issue of Circulation Research indicates ...

An orthogonal BSP (binary space partitioning) tree is a commonly used spatial subdivision data structure for ray tracing acceleration. While the construction of a BSP tree takes a relatively short time, the e ciency of a traversal algorithm signi cantly in uences the overall rendering time. We propose a new fast traversal algorithm based on statistical evaluation of all possible cases occurring...

A binary space partitioning (bsp) tree represents a recursive, hierarchical subdivision of d-dimensional space into convex subspaces. BSP trees provide a computational representation of space that provides both a search structure and a representation of geometry. Constructing a bsp tree consists of partitioning a subspace by means of a hyperplane, which intersects the interior of that subspace,...

The Paderborn University BSP (PUB) library is a C communication library based on the BSP model. The basic library supports buffered as well as unbuffered non-blocking communication between any pair of processors and a mechanism for synchronizing the processors in a barrier style. In addition, PUB provides non-blocking collective communication operations on arbitrary subsets of processors, the a...

We introduce a new BSP tree construction method for set of segments in the plane. Our algorithm is able to create BSP tree of linear size in the time O(n log n) for set of segments with low directional density (i.e. it holds for arbitrary segment si from such set, that a line created as extension of this segment doesn’t intersect too many other segments from the set in a near neighbourhood of s...

In this paper we discuss a CSG BSP algorithm to perform the conversion from the boundary to the interior of d dimensional polyhedra Both a d dimensional polyhedral point set and its boundary d faces are here represented as BSP trees In this approach no structure no ordering and even no orientation is required for such boundary BSP trees In particular it is shown that the interior point set may ...