• No results found

shared-memory parallel architectures

Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures

Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures

... transactional memory (STM) provides a generic implementation of optimistic concurrency ...groups shared- memory operations into transactions that appear to succeed or fail ...simple parallel ...

18

Survey on Pure Parallel Programming Models: OpenMP and MPI

Survey on Pure Parallel Programming Models: OpenMP and MPI

... a shared memory Application Programming Interface (API) whose aim is to ease Shared Memory parallel ...across Shared Memory ...

5

A survey on real time processing with 
		spiking neural networks

A survey on real time processing with spiking neural networks

... massively parallel million core architecture that aims to model real time large-scale spiking neural networks [29] ...processor architectures because it uses the same memory hierarchies and ...

9

Distributed shared memory architectures and global performance state estimation

Distributed shared memory architectures and global performance state estimation

... or parallel OpenGL application may be executed on one or more of the cluster’s commodity PCs and the resulting OpenGL commands may be distributed over the available ...

199

Parallel performance prediction for multigrid
codes on distributed memory architectures

Parallel performance prediction for multigrid codes on distributed memory architectures

... state-of-the-art parallel numerical soft- ware is now increasingly incorporating multigrid implementation in a variety of application domains [6, 9, ...typical parallel multigrid codes on distributed ...

14

Time-stamp Incremental Checkpointing and Its Application for an Optimization of Execution Model to Improve Performance of CAPE

Time-stamp Incremental Checkpointing and Its Application for an Optimization of Execution Model to Improve Performance of CAPE

... distributed memory architectures and make them ready for ...the parallel jobs and their data to other processes (the fork phase of OpenMP), and collect the results after the execution of the jobs ...

12

Parallel K Means Algorithm for Shared Memory Multiprocessors

Parallel K Means Algorithm for Shared Memory Multiprocessors

... on shared-nothing ...on shared memory architectures recently start to attract some ...on shared memory multiprocessors is done in the ...a shared memory ...

9

FPGA message passing cluster architectures

FPGA message passing cluster architectures

... solving parallel algorithms show what happens, how an application can use these features needs to be ...developed parallel programming models should abstract the programmer from the underlying complexities ...

298

Fine grained Parallel Ant Colony System for Shared Memory Architectures

Fine grained Parallel Ant Colony System for Shared Memory Architectures

... We have optimized the algorithm’s overall speed by reviewing the thread-management overheads and skipping neutral thread-safety locks. By relaxing the synchronization mechanisms that is used for consistency, we have ...

6

Optimization of 3-D Wavelet Decomposition on Multiprocessors

Optimization of 3-D Wavelet Decomposition on Multiprocessors

... a shared memory MIMD ...data parallel implementation and is additionally able to take advantage of the architecture of virtual shared memory ...

10

Enhanced computation method of topological smoothing on shared memory parallel machines

Enhanced computation method of topological smoothing on shared memory parallel machines

... Indeed there are two main types of scheduler. There are those designed for real-time systems (RTS). In this case, the most commonly approaches used to schedule real-time task system are: Clock-Driven, Processor- Sharing ...

17

Chain Multiplication of Dense Matrices: Proposing a Shared Memory based Parallel Algorithm

Chain Multiplication of Dense Matrices: Proposing a Shared Memory based Parallel Algorithm

... Similarly for orders 2, 3, 4 and 5, NoM will be 14350000, 4975000, 7650000 and 6475000. So, ordered parenthesization-3 requiring lesser multiplications to compute the multiplication of given matrix sequence. In this ...

6

Modeling of Communication Complexity in Parallel Computing

Modeling of Communication Complexity in Parallel Computing

... Modeling of communication latency as a discipline has repeatedly proved to be critical for design and successful use of parallel computers and parallel algorithms too. At the early stage of design, ...

14

A unified programming system for a multi paradigm parallel architecture

A unified programming system for a multi paradigm parallel architecture

... By comparison the private memory systems, where each thread has its own local data (Occam, Ada, Linda e tc.), are simple to program in, because as each thread has its own local data the synchronisation problem ...

247

Optimization of Machine Learning Process Using Parallel Computing

Optimization of Machine Learning Process Using Parallel Computing

... In this paper it was proven that PC can be efficiently used for the improvement of reaching good quality results of supervised learning. The experiments on image recognition, run on five sets of empirical data, clearly ...

7

Parallelization of formal concept analysis algorithms

Parallelization of formal concept analysis algorithms

... new, shared memory and distributed memory parallel FCA ...The parallel algorithms presented in this thesis are parallel variants of the fastest serial FCA ...the parallel ...

151

Parallel architectures for image analysis

Parallel architectures for image analysis

... Connected component labelling consists of associating a single label with each connected set o f pixels in an image. Two pixels are connected if there is a complete path between them consisting of pixels with the same ...

255

Shared Memory Multiprocessor

Shared Memory Multiprocessor

... the memory con- troller without invalidate shared copy in processor ...specified memory location, updates the shared cop- ies in processor caches with the new value, and returns the old ...of ...

6

A multicore numerical framework for assessing the permeability of reservoir rocks

A multicore numerical framework for assessing the permeability of reservoir rocks

... regions between nodes. These ghost regions correspond to neighboring sections of the problem domain (resident in memory on other cluster nodes) which are required on a cluster node for the processing of its own ...

6

Complex Performance Modeling of Parallel Algorithms

Complex Performance Modeling of Parallel Algorithms

... performed parallel computations while the overhead function h(s, p) represents latency times attributed to communication of parallel processes, synchronization, waiting to shared resources ...fixed ...

14

Show all 10000 documents...

Related subjects