Parallel operator schemes

Cybernetics ◽  
1973 ◽  
Vol 7 (1) ◽  
pp. 62-66
Author(s):  
V. E. Itkin
Keyword(s):  
Parallel Operator

scholarly journals A parallel operator splitting algorithm for solving constrained total-variation retinex

2020 ◽  
Vol 14 (6) ◽  
pp. 1135-1156
Author(s):  
Leyu Hu ◽  
◽  
Wenxing Zhang ◽  
Xingju Cai ◽  
Deren Han ◽  
...  
Keyword(s):  
Total Variation ◽  
Operator Splitting ◽  
Splitting Algorithm ◽  
Parallel Operator

NH-GOMO, an efficient and easily portable non-hydrostatic ocean model

2020 ◽  
Author(s):  
Qiang Tang ◽  
Xiaomeng Huang ◽  
Xing Huang
Keyword(s):  
Dynamic Pressure ◽  
Bottom Layer ◽  
Ocean Model ◽  
Test Cases ◽  
Fine Grid ◽  
Poisson Solver ◽  
Implicit Finite Difference Scheme ◽  
Terrain Following ◽  
Computing Platforms ◽  
Parallel Operator

<p>Numerical simulation of nonlinear gravity internal waves with non-hydrostatic ocean models, especially these which using the terrain-following sigma-coordinate, is challenging. The expensive computation cost, which is caused by the dynamic pressure Poisson solver in cases using fine grid resolution in both directions (horizontal and vertical), is the main reason. A non-hydrostatic ocean model named NH-GOMO is constructed based on a partially implicit finite difference scheme for the dynamic pressure and adopts an idea of “decimation and interpolation”. A significant optimization for the pressure Poisson solver, which brings no obvious accuracy loss, is obtained with these technologies. The automatic parallel operator library named OpenArray is used as the bottom layer of this model and make it easy to transport between different computing platforms. Accuracy and efficiency have been validated by several ideal test cases.</p>

A PARALLEL THINNING ALGORITHM USING THE BOUNDING BOXES TECHNIQUES

1993 ◽  
Vol 07 (05) ◽  
pp. 1103-1114 ◽  
Author(s):  
STÉPHANE UBEDA
Keyword(s):  
Parallel Machines ◽  
Strong Dependence ◽  
Processing Stage ◽  
Contour Tracing ◽  
Iterative Processes ◽  
Strongly Regular ◽  
Thinning Algorithms ◽  
Bounding Boxes ◽  
Original Picture ◽  
Parallel Operator

Thinning algorithms are widely used in pattern recognition. This processing stage is implemented on serial machines as well as on parallel machines. We can find two classes of thinning algorithms in the literature. The first class is composed of strongly sequential algorithms, based on contour tracing of the objects to be thinned. The second class is made of iterative processes in which fully parallel mask-based operators are used at each iteration. The weakness of the contour tracing based methods is its strong dependence upon the original picture. Particularly, in the case of very complex pictures, this algorithm becomes inefficient. The second thinning class of algorithms uses strongly regular operating processes. The general speed of those methods also depends upon the shapes to be thinned. The iteration number necessary to complete these iterative processes is proportional to the maximum thickness of the objects in the picture. The complexity of the contour of the objects does not influence the efficiency of the algorithm. The goal of this paper is to keep the regularity of the second class of thinning processes, but to reduce the amount of standard parallel-operations. We use a partition of the original picture and we dynamically reduce the range of the full-parallel operator in its sub-picture.

scholarly journals Topological Properties of Parallel Series Language

2019 ◽  
Vol 8 (2) ◽  
pp. 2267-2270
Keyword(s):  
Topological Space ◽  
Order Relation ◽  
Topological Properties ◽  
Closed Set ◽  
Open Set ◽  
Speed Up ◽  
Parallel Operator ◽  
Limit Sequence ◽  
Parallel Series

Parallelism is a process by which a sequential string is broken down into a number of alphabets and used to speed up the acceptance of a string. To identify the parallelisable string, we have used parallel operator || and defined the language as parallel series languages. Algebraic and recognition properties of series parallel posets have been studied by Lodaya in [8]. In this paper, we have introduced finite and infinite parallel series language (parallel strings are connected sequentially). We have considered the set of all parallel series language as topological space and prefix order relation (poset relation) has been used to relate two parallel series strings. Topological concepts like limit, sequence, open set, closed set and basis for parallel series languages and their properties have been derived

Sign in / Sign up

Export Citation Format

Share Document