Results 71 to 80 of about 31,177 (208)
An OpenMP-based tool for finding longest common subsequence in bioinformatics
BMC 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
HSTREAM: A directive-based language extension for heterogeneous stream computing
, 2018 Big data streaming applications require utilization of heterogeneous parallel computing systems, which may comprise multiple multi-core CPUs and many-core accelerating devices such as NVIDIA GPUs and Intel Xeon Phis.
Memeti, Suejb, Pllana, Sabri
core +1 more source
How Can the Master–Slave Elimination for Multi‐Point Constraints be Drastically Accelerated?
PAMM, Volume 25, Issue 4, December 2025.ABSTRACT Multi‐point constraints are essential in modeling various engineering problems, for example, in the context of joints undergoing large rotations or coupling of different element types in finite element analysis. The master–slave elimination is an efficient method for the numerical treatment of such constraints because it reduces the dimension ...
Jonas Boungard, Jens Wackerfuß
wiley +1 more source
Design of Image Matching Parallel Algorithm Based on Improved Minimum Distance Method [PDF]
Jisuanji 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
Quantum Transport in Nitrogen‐Doped Nanoporous Graphenes
Small, Volume 21, Issue 51, December 23, 2025.Nanoporous graphenes are 2D arrays of graphene nanoribbons. Here, the quantum transport properties of nitrogen (N) doped nanoporous graphenes, combining N‐doped GNRs and non‐doped GNRs, are studied for the first time via Green's functions simulations.
Gaetano Calogero +8 more
wiley +1 more source
Extending OpenMP for the Optimization of Parallel Component Applications
IEEE 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
Transactional Memory and OpenMP
, 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.
Milovanovic, Milos +7 more
openaire +3 more sources
Journal of Advances in Modeling Earth Systems, Volume 17, Issue 12, December 2025.Abstract A distributed multi‐architecture design for massively parallel hyperbolic solvers is herein introduced and benchmarked. A unified object‐oriented central processing unit (CPU) + graphics processing unit (GPU) approach is complemented with an inter‐device communication layer, enabling both coarse and fine‐grain parallelism on hyperbolic solvers.
Daniel A. S. Conde +4 more
wiley +1 more source
The HPCG benchmark: analysis, shared memory preliminary improvements and evaluation on an Arm-based platform [PDF]
, 2018 The High-Performance Conjugate Gradient (HPCG) benchmark complements the LINPACK benchmark in the performance evaluation coverage of large High-Performance Computing (HPC) systems. Due to its lower arithmetic intensity and higher memory pressure, HPCG is
Casas, Marc +4 more
core +1 more source
Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale
Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque +4 more
wiley +1 more source