Parallel alternating iterative algorithms with and without overlapping on multicore architectures

Parallel alternating iterative algorithms with and without overlapping on multicore architectures

We consider the problem of solving large sparse linear systems where the coefficient matrix is possibly singular but the equations are consistent. Block two-stage methods in which the inner iterations are performed using alternating methods are studied. These methods are ideal for parallel processing and provide a very general setting to study parallel block methods including overlapping. Conve...

An Evaluation of Parallel Knapsack Algorithms on Multicore Architectures

Emergence of chip multiprocessor systems has dramatically increased the performance potential of computer systems. Since the amount of exploited parallelism is directly influenced by the selection of the algorithm, algorithmic choice also plays a critical role in achieving high performance on modern architectures. Hence, in the era of multicore computing, it is important to re-evaluate algorith...

Parallel MLEM on Multicore Architectures

The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the maximum likelihood expectation maximization (MLEM) algorithm. When using MLEM for positron emission tomography (PET) image reconstruction, one requires a particularly large matrix. We present a new storage scheme for this type of...

Parallel Graph Partitioning on Multicore Architectures

Graph partitioning is a common and frequent preprocessing step in many high-performance parallel applications on distributedand shared-memory architectures. It is used to distribute graphs across memory and to improve spatial locality. There are several parallel implementations of graph partitioning for distributed-memory architectures. In this paper, we present a parallel graph partitioner tha...

Backprojection algorithms for multicore and GPU architectures