Results 71 to 80 of about 31,764 (209)

Transactional Memory and OpenMP

open access: yes, 2008
Future generations of Chip Multiprocessors (CMP) will provide dozens or even hundreds of cores inside the chip. Writing applications that benefit from the massive computational power offered by these chips is not going to be an easy task for mainstream programmers who are used to sequential algorithms rather than parallel ones.
Milos Milovanovic   +7 more
openaire   +3 more sources

Linking Model Parameter Sensitivities With Hydrological Process Behavior Along Elevation Gradients in Alpine Terrain

open access: yesWater Resources Research, Volume 62, Issue 4, April 2026.
Abstract Analyzing process interactions in hydrological systems typically requires catchment‐scale hydrological models, where greater model complexity enhances the representation of physical process behavior but also poses challenges related to parameter equifinality.
A. Herzog   +4 more
wiley   +1 more source

HYBRID MPI/OPEN-MP ACCELERATION APPROACH FOR HIGH-ORDER SCHEMES FOR CFD

open access: yesTASK Quarterly, 2018
The paper presents a hybrid MPI+ OpenMP (Message Passing Interface/Open Multi-Processor) algorithm used for parallel programs based on the high-order compact method.
MICHAL SACZEK   +3 more
doaj   +1 more source

Experiences with OpenMP in tmLQCD [PDF]

open access: yesProceedings of 31st International Symposium on Lattice Field Theory LATTICE 2013 — PoS(LATTICE 2013), 2014
An overview is given of the lessons learned from the introduction of multi-threading using OpenMP in tmLQCD. In particular, programming style, performance measurements, cache misses, scaling, thread distribution for hybrid codes, race conditions, the overlapping of communication and computation and the measurement and reduction of certain overheads are
Albert Deuzeman   +3 more
openaire   +4 more sources

Efficient Scheduling Algorithms for Multicore Cyclic Executives With Precedence and Exclusion Relations

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 5, March 2026.
ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira   +4 more
wiley   +1 more source

Применение высокопроизводительных вычислений для решения задачи Коши с дробным уравнением Риккати по нелокальной неявной конечно-разностной схеме

open access: yesVestnik KRAUNC: Fiziko-Matematičeskie Nauki
В статье представлено исследование вычислительной эффективности параллельной версии численного алгоритма для решения уравнения Риккати с производной дробного перменного порядка типа Герасимова-Капуто.
Твёрдый, Д.А.   +1 more
doaj   +1 more source

An OpenMP-based tool for finding longest common subsequence in bioinformatics

open access: yesBMC Research Notes, 2019
Objective Finding the longest common subsequence (LCS) among sequences is NP-hard. This is an important problem in bioinformatics for DNA sequence alignment and pattern discovery.
Rayhan Shikder   +3 more
doaj   +1 more source

Extending OpenMP for the Optimization of Parallel Component Applications

open access: yesIEEE Access, 2020
Motivated by the promotion of development efficiency and performance, we research on the common performance optimization technology for parallel component applications.
Yunfeng Peng, Hai Liu
doaj   +1 more source

Design of Image Matching Parallel Algorithm Based on Improved Minimum Distance Method [PDF]

open access: yesJisuanji gongcheng, 2018
In order to take advantage of multi-core computing resources to improve the real-time performance of image matching identification,image matching parallel algorithm based on improved minimum distance method is designed.The standard euclidean distance is ...
ZOU Guoliang,ZHANG Shiming,CHEN Changji,WANG Zhenhua
doaj   +1 more source

DPP-PMRF: Rethinking Optimization for a Probabilistic Graphical Model Using Data-Parallel Primitives

open access: yes, 2018
We present a new parallel algorithm for probabilistic graphical model optimization. The algorithm relies on data-parallel primitives (DPPs), which provide portable performance over hardware architecture.
Bethel, E. Wes   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy