Strategy and algorithms for the parallel solution of the nearest neighborhood problem in shared-memory processors

2021 ◽  
Author(s):  
Santiago Tapia-Fernández ◽  
Pablo Hiroshi Alonso-Miyazaki ◽  
Ignacio Romero ◽  
Angel García-Beltrán
Keyword(s):  
Shared Memory ◽  
Parallel Solution ◽  
Neighborhood Problem ◽  
Nearest Neighborhood

SOLVING DISCRETE-TIME LYAPUNOV EQUATIONS FOR THE CHOLESKY FACTOR ON A SHARED MEMORY MULTIPROCESSOR

1996 ◽  
Vol 06 (03) ◽  
pp. 365-376 ◽  
Author(s):  
JOSE M. CLAVER ◽  
VICENTE HERNANDEZ ◽  
ENRIQUE S. QUINTANA
Keyword(s):  
Parallel Algorithms ◽  
Shared Memory ◽  
Discrete Time ◽  
Lyapunov Equation ◽  
Lyapunov Equations ◽  
Parallel Solution ◽  
Cholesky Factor ◽  
Large Order ◽  
Shared Memory Multiprocessor

In this paper we study the parallel solution of the discrete-time Lyapunov equation. Two parallel fine and medium grain algorithms for solving dense and large order equations [Formula: see text] on a shared memory multiprocessor are presented. They are based on Hammarling’s method and directly obtain the Cholesky factor of the solution. The parallel algorithms work following an antidiagonal wavefront. In order to improve the performance, column-block-oriented and wrap-around algorithms are used. Finally, combined fine and medium grain parallel algorithms are presented.

Shared-memory parallel multi-target tracking

2009 ◽  
Vol 28 (9) ◽  
pp. 2303-2305
Author(s):  
Xiao-gang WANG ◽  
Xiao-juan WU ◽  
Xin ZHOU ◽  
Xiao-yan ZHANG
Keyword(s):  
Target Tracking ◽  
Shared Memory ◽  
Multi Target Tracking

Atomic Snapshots of Shared Memory

1990 ◽  
Author(s):  
Yehunda Afek ◽  
Hagit Attiya ◽  
Danny Dolev ◽  
Eli Gafni ◽  
Michael Merritt
Keyword(s):  
Shared Memory
Sign in / Sign up

Export Citation Format

Share Document