Scalable shared-memory multiprocessor architectures

Computer ◽  
1990 ◽  
Vol 23 (6) ◽  
pp. 71-74 ◽  
Author(s):  
S. Thakkar ◽  
M. Dubois ◽  
A.T. Laundrie ◽  
G.S. Sohi
Keyword(s):  
Shared Memory ◽  
Multiprocessor Architectures ◽  
Shared Memory Multiprocessor

scholarly journals Beliefs propagation in log domain: a neural inspired algorithm for machine learning

2016 ◽  
Author(s):  
Osama Ashfaq
Keyword(s):  
Shared Memory ◽  
Graphical Model ◽  
Belief Propagation ◽  
Marginal Distribution ◽  
Iteration Algorithm ◽  
Multiprocessor Architectures ◽  
Jacobi Iteration ◽  
Shared Memory Multiprocessor ◽  
Belief Propagation Algorithm ◽  
Log Domain

In this paper, we consider a variant of belief propagation algorithm in a tree graphical model where computations are carried out in the negative log-likelihood domain. Unlike the min-product algorithm, our goal is not limited to estimating the mode of the marginal distribution. We would like to obtain the entire marginal distribution as the sum-product algorithm does. We applied the algorithm to learn effective users features for A/B testing. We discussed scalable extension to the proposed algorithm for processing large amount of data.The primary goal of a parallel program is to reduce running time comparing to the sequential program by taking full advantage of computing power of multiprocessors. Threads are widely used in the implementation of parallelism in shared memory multiprocessor architectures. For UNIX/LINUX systems, pthread is the POSIX standard threading interface, which provides support a standardized way for creating and synchronizing threads. Here we presents how pthreads can be used successfully in parallelizing real scientific problems. We will illustrate it by implementing the shared memory parallel version of Jacobi iteration algorithm. Results of performance tests showed that the speedups can be up to p where p is the number of processors.

scholarly journals Beliefs propagation in log domain: a neural inspired algorithm for machine learning

2016 ◽  
Author(s):  
Osama Ashfaq
Keyword(s):  
Shared Memory ◽  
Graphical Model ◽  
Belief Propagation ◽  
Marginal Distribution ◽  
Iteration Algorithm ◽  
Multiprocessor Architectures ◽  
Jacobi Iteration ◽  
Shared Memory Multiprocessor ◽  
Belief Propagation Algorithm ◽  
Log Domain

In this paper, we consider a variant of belief propagation algorithm in a tree graphical model where computations are carried out in the negative log-likelihood domain. Unlike the min-product algorithm, our goal is not limited to estimating the mode of the marginal distribution. We would like to obtain the entire marginal distribution as the sum-product algorithm does. We applied the algorithm to learn effective users features for A/B testing. We discussed scalable extension to the proposed algorithm for processing large amount of data.The primary goal of a parallel program is to reduce running time comparing to the sequential program by taking full advantage of computing power of multiprocessors. Threads are widely used in the implementation of parallelism in shared memory multiprocessor architectures. For UNIX/LINUX systems, pthread is the POSIX standard threading interface, which provides support a standardized way for creating and synchronizing threads. Here we presents how pthreads can be used successfully in parallelizing real scientific problems. We will illustrate it by implementing the shared memory parallel version of Jacobi iteration algorithm. Results of performance tests showed that the speedups can be up to p where p is the number of processors.

Restructuring a parallel simulation to improve cache behavior in a shared-memory multiprocessor

1993 ◽  
Vol 23 (1) ◽  
pp. 159-162
Author(s):  
David R. Cheriton ◽  
Hendrik A. Goosen ◽  
Hugh Holbrook ◽  
Philip Machanick
Keyword(s):  
Shared Memory ◽  
Parallel Simulation ◽  
Shared Memory Multiprocessor
Sign in / Sign up

Export Citation Format

Share Document