scholarly journals A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine

1994 ◽  
Vol 21 (1) ◽  
pp. 160-168 ◽  
Author(s):  
N. Copty ◽  
S. Ranka ◽  
G. Fox ◽  
R.V. Shankar
Keyword(s):  
Parallel Algorithm ◽  
Region Growing ◽  
Data Parallel ◽  
Connection Machine

Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2

1995 ◽  
Vol 7 (4) ◽  
pp. 402-416 ◽  
Author(s):  
Jonathan Eckstein ◽  
İ. İlkay Boduroğlu ◽  
Lazaros C. Polymenakos ◽  
Donald Goldfarb
Keyword(s):  
Data Parallel ◽  
Parallel Implementations ◽  
Connection Machine ◽  
Simplex Methods

scholarly journals Implementation of a parallel algorithm of image segmentation based on region growing

2020 ◽  
Vol 1 (9 (103)) ◽  
pp. 6-11
Author(s):  
Jesús Antonio Álvarez-Cedillo ◽  
Mario Aguilar-Fernández ◽  
Teodoro Álvarez-Sánchez ◽  
Raúl Junior Sandoval-Gómez
Keyword(s):  
Image Segmentation ◽  
Parallel Algorithm ◽  
Region Growing

Parallel algorithm of region growing based on multi-level queue

2008 ◽  
Vol 28 (2) ◽  
pp. 446-447
Author(s):  
Ke-zhong LU ◽  
Rong PENG ◽  
Xiao-hui LIN
Keyword(s):  
Parallel Algorithm ◽  
Region Growing ◽  
Multi Level

scholarly journals CELLULAR AUTOMATON FOR THE FRACTURE OF ELASTIC MEDIA

1993 ◽  
Vol 04 (01) ◽  
pp. 127-136 ◽  
Author(s):  
PETER OSSADNIK
Keyword(s):  
Fractal Dimension ◽  
Cellular Automaton ◽  
Elastic Medium ◽  
Fast Algorithm ◽  
Large Scale ◽  
Parallel Computer ◽  
Elastic Media ◽  
Data Parallel ◽  
Connection Machine ◽  
Large Scale Simulations

We study numerically the growth of a crack in an elastic medium under the influence of a travelling shockwave. We describe the implementation of a fast algorithm which is perfectly suited for a data parallel computer. Using large scale simulations on the Connection Machine we generate cracks with more than 10000 sites on a 1024 × 1024 lattice. We show that the resulting patterns are fractal with a fractal dimension that depends on the chosen breaking criterion and varies between 1. and 2.

MASSIVELY DATA-PARALLEL MOLECULAR DYNAMICS

1992 ◽  
Vol 03 (04) ◽  
pp. 709-731
Author(s):  
ERNESTO BONOMI ◽  
MARCO TOMASSINI
Keyword(s):  
Molecular Dynamics ◽  
Heat Bath ◽  
Hard Core ◽  
Parallel Computers ◽  
Particle Systems ◽  
Data Parallel ◽  
Connection Machine ◽  
Large N ◽  
Parallel Molecular Dynamics ◽  
Dynamics Simulations

In light of present day data-parallel computers, an appraisal of molecular dynamics simulations of large N-particle systems, isolated or in contact with a heat-bath, is given. Special attention is focused 011 the Connection Machine CM-2. Particularly the cases of long-range potentials and impulsive hard-core interactions are discussed in detail. Data-parallel strategies including data distribution, communications and computation are presented and compared with well-known sequential approaches. The conclusion offered is that the methods described here are easy to design and offer the possibility of reasonably fast implementations for the reliable simulation of macroscopic samples of matter.

STEALTH TERRAIN NAVIGATION FOR MULTI-VEHICLE PATH PLANNING

1992 ◽  
Vol 06 (02n03) ◽  
pp. 395-415 ◽  
Author(s):  
Y. ANSEL TENG ◽  
DANIEL DEMENTHON ◽  
LARRY S. DAVIS
Keyword(s):  
Path Planning ◽  
Communication Complexity ◽  
Parallel Machines ◽  
Solution Space ◽  
Planning System ◽  
Data Parallel ◽  
Temporal Sampling ◽  
Connection Machine ◽  
Vehicle Path ◽  
Using Data

In this paper, we propose a method for solving visibility-based terrain path planning problems for groups of vehicles using data parallel machines. The discussion focuses on path planning for two groups of vehicles so that they move in a bounding overwatch manner. Furthermore, the planned paths for the vehicles themselves are subject to intervisibility constraints, configuration constraints, and different terrain traversabilities due to variations in terrain type and slope. A spatial-temporal sampling approach is adopted to discretize the solution space and facilitate fast computation on a data parallel machine. One of the key computations in the planning is the region-to-region visibility analysis, which is computationally expensive but essential to the choice of subgoals to carry out reconnaissance activities. A parallel algorithm for this analysis is developed. By reducing the communication complexity, our algorithm achieves much faster running time than traditional methods. The algorithms are implemented on a Connection Machine CM-2, and the experimental results show that the planning system effectively generates good paths.

Sign in / Sign up

Export Citation Format

Share Document