An implementation of the SANE Virtual Processor using POSIX threads

2009 ◽  
Vol 55 (3) ◽  
pp. 162-169 ◽  
Author(s):  
M.W. van Tol ◽  
C.R. Jesshope ◽  
M. Lankamp ◽  
S. Polstra
Keyword(s):  
Posix Threads ◽  
Virtual Processor

POSIX Threads (Pthreads)

2011 ◽  
pp. 1592-1593
Author(s):  
Bruce Leasure ◽  
David J. Kuck ◽  
Sergei Gorlatch ◽  
Murray Cole ◽  
Gregory R. Watson ◽  
...  
Keyword(s):  
Posix Threads

scholarly journals Programowanie wielowątkowe w językach strukturalnych i obiektowych

2019 ◽  
Vol 10 ◽  
pp. 49-53
Author(s):  
Mateusz Wiśniewski
Keyword(s):  
Posix Threads

W artykule przedstawiono sposoby programowania wielowątkowego w wybranych językach programowania takich jak: C podejście strukturalne oraz obiektowe C++ przy użyciu bibliotek Posix Threads dla języka C oraz bibliotekę Boost dla języka C++. Opisano również charakterystykę wybranych bibliotek. Przedstawiono przykładowe rozwiązania typowych problemów programistycznych wykorzystujących wątki. Starano odpowiedzieć na pytanie czym kierować się przy wyborze języka do nauki programowania wielowątkowego oraz programowania w ogólnym tego słowa znaczeniu.

scholarly journals Parallel real-world LU decomposition: Gauss vs. Crout algorithm

2018 ◽  
Vol 8 (1) ◽  
pp. 210-217
Author(s):  
Marek Stabrowski
Keyword(s):  
Real World ◽  
Numerical Experiments ◽  
Matrix Decomposition ◽  
Decomposition Algorithms ◽  
Density Matrices ◽  
Hardware Platform ◽  
Posix Threads ◽  
Real World Applications ◽  
Matrix Decomposition Algorithms ◽  
Algorithm Implementation

Abstract This paper presents numerical experiments with assorted versions of parallel LU matrix decomposition algorithms (Gauss and Crout algorithm). The tests have been carried out on the hardware platform with fourcore Skylake processor featuring hyperthreading technology doubling virtually core number. Parallelization algorithms have been implemented with the aid of classic POSIX threads library. Experiments have shown that basic 4-thread acceleration of all parallel implementations is almost equal to the number of threads/processors. Both algorithms are worth considering in real-world applications (Florida University collection). Gauss algorithm is a better performer, with respect to timing, in the case of matrices with lower density of nonzeros, as opposed to higher density matrices. The latter are processed more efficiently with the aid of Crout algorithm implementation.

TOWARD AUTOMATIC DISTRIBUTION

1994 ◽  
Vol 04 (03) ◽  
pp. 233-244 ◽  
Author(s):  
PAUL FEAUTRIER
Keyword(s):  
Distributed Memory ◽  
Gaussian Elimination ◽  
Dataflow Analysis ◽  
Elementary Calculation ◽  
Virtual Processor ◽  
Source Program

This paper considers the problem of distributing data and code among the processors of a distributed memory supercomputer. Provided that the source program is amenable to detailed dataflow analysis, one may determine a placement function by an incremental analogue of Gaussian elimination. Such a function completely characterizes the distribution by giving the identity of the virtual processor on which each elementary calculation is done. One has then to “realize” the virtual processors on the PE. The resulting structure satisfies the “owner computes” rule and is reminiscent of two-level distribution schemes, like HPF’s [Formula: see text] and [Formula: see text] directives, or the CM-2 virtual processor system.

Sign in / Sign up

Export Citation Format

Share Document