This article presents a comprehensive performance evaluation of Phytium 2000+, an ARMv8-based 64-core architecture. We focus on the cache and memory subsystems, analyzing characteristics that impact high-performance computing applications. provide insights into memory-relevant behaviours 2000+ system through micro-benchmarking. With help well-known rooine model, we analyze system, taking both a...

Actual trend set by CPU manufacturers and recent developement in the field of graphical processing units (GPUs) offered us the computational power of multi-core and many-core architectures. Database applications can benefit greatly from parallelism; however, many algorithms need to be redesigned and many technical issues need to be solved. In this paper, we have focused on standard relational j...

In astrophysical N -body simulations, Dehnen’s algorithm, implemented in the serial falcON code and based on a dual tree traversal, is faster than serial Barnes-Hut tree-codes, but outperformed by parallel CPU and GPU tree-codes. In this paper, we present a parallel dual tree traversal, implemented in the pfalcON code, targeting multi-core CPUs and manycore architectures (Xeon Phi). We focus he...

Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The total run time of a coloring algorithm adds to the overall parallel overhead of the application whereas the number of colors used determines the amount of ex...

Non-negative matrix factorization (NMF) has been successfully used in audio source separation and parts-based analysis; however, iterative NMF algorithms are computationally intensive, and therefore, time to convergence is very slow on typical personal computers. In this paper, we describe high performance parallel implementations of NMF developed using OpenMP for shared-memory multicore system...

Deconvolution algorithms are commonly used to remove optical distortion from fluorescence microscopy images. Many such algorithms have been proposed, but those that produce the best image restoration results are iterative. Typically, each iteration involves one or more 3D convolutions, resulting in execution times of tens of seconds to several minutes for common image sizes on single-core compu...

Publisher rights © 2014 The Authors This is the pre-peer reviewed version of the following article: Burke, N., Rau-Chaplin, A., and Varghese, B. (2016) Computing probable maximum loss in catastrophe reinsurance portfolios on multi-core and many-core architectures. Concurrency Computat.: Pract. Exper., 28: 836–847., which has been published in final form at : 10.1002/cpe.3695. This article may b...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii