Results 41 to 50 of about 10,356 (199)
Scalable code clone detection tool based on semantic analysis
This article describes the methods of code clones detection. New approach of code clones detection is proposed for C/C++ languages based on analysis of existed methods.
Sevak Sargsyan +4 more
doaj +1 more source
Implementing implicit OpenMP data sharing on GPUs
OpenMP is a shared memory programming model which supports the offloading of target regions to accelerators such as NVIDIA GPUs. The implementation in Clang/LLVM aims to deliver a generic GPU compilation toolchain that supports both the native CUDA C/C++
Bataev, Alexey +8 more
core +1 more source
We introduce the range‐resident logistic model, an extension of the spatial logistic model that incorporates empirically supported range‐resident movement, showing that neglecting range residency can lead to under‐ or overestimating population carrying capacity.
Rafael Menezes +4 more
wiley +1 more source
Optimizing programs for given hardware architectures with static compilation: methods and tools
The paper describes the workflow for optimizing programs for performance targeting the fixed hardware architecture with static compilation using GCC and LLVM compilers as examples.
Dmitry Melnik +5 more
doaj +1 more source
goSLP: Globally Optimized Superword Level Parallelism Framework
Modern microprocessors are equipped with single instruction multiple data (SIMD) or vector instruction sets which allow compilers to exploit superword level parallelism (SLP), a type of fine-grained parallelism.
Amarasinghe, Saman, Mendis, Charith
core +1 more source
Table of Contents In the last article we lowered our custom poly dialect to standard MLIR dialects. In this article we’ll continue lowering it to LLVM IR, exporting it out of MLIR to LLVM, and then compiling to x86 machine code. The code for this article is in this pull request, and as usual the commits are organized to be read in order.
openaire +1 more source
Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale
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
Dynamic compilation of expressions in SQL queries for PostgreSQL
In recent years, as performance and capacity of main and external memory grow, performance of database management systems (DBMSes) on certain kinds of queries is more determined by raw CPU speed.
E. Y. Sharygin +4 more
doaj +1 more source
Register‐Based and Stack‐Based Virtual Machines: Which Perform Better in JIT Compilation Scenarios?
ABSTRACT Background Just‐In‐Time (JIT) compilation plays a critical role in optimizing the performance of modern virtual machines (VMs). While the architecture of VMs–register‐based or stack‐based–has long been a subject of debate, empirical analysis focusing on JIT compilation performance is relatively sparse. Objective In this study, we aim to answer
Bohuslav Šimek +2 more
wiley +1 more source
LLVM-based Static Analysis Tool Using Type and Effect Systems
The intention of this paper is to describe a static analysis tool under development. The principal idea behind the design of this tool is to use type and effect systems for static analysis of real programs. The tool uses LLVM bitcode files as input, thus
M. A. Belyaev, V. A. Tsesko
doaj

