Results 61 to 70 of about 11,256 (247)
Fine-Grain Iterative Compilation for WCET Estimation [PDF]
Compiler optimizations, although reducing the execution times of programs, raise issues in static WCET estimation techniques and tools. Flow facts, such as loop bounds, may not be automatically found by static WCET analysis tools after aggressive code ...
+4 more
core +3 more sources
This work presents a comparison of different software and hardware implementations of a traffic simulator using a fluid‐based mesoscopic model. The model represents Vehicular Traffic Networks (VTNs) based on the flow resulting by the interconnection of dynamical agents associated to street segments and intersections.
Felipe Morales-Torres +7 more
wiley +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
AutoWIG: automatic generation of python bindings for C++ libraries [PDF]
Most of Python and R scientific packages incorporate compiled scientific libraries to speed up the code and reuse legacy libraries. While several semi-automatic solutions exist to wrap these compiled libraries, the process of wrapping a large library is ...
Pierre Fernique, Christophe Pradal
doaj +2 more sources
FirmUSB: Vetting USB Device Firmware using Domain Informed Symbolic Execution
The USB protocol has become ubiquitous, supporting devices from high-powered computing devices to small embedded devices and control systems. USB's greatest feature, its openness and expandability, is also its weakness, and attacks such as BadUSB exploit
Butler, Kevin R. B. +4 more
core +1 more source
LLVM RISC-V RV32X Graphics Extension Support and Characteristics Analysis of Graphics Programs [PDF]
Peng Wang, Zhi-Bin Yu
openalex +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
Automatic Throughput and Critical Path Analysis of x86 and ARM Assembly Kernels
Useful models of loop kernel runtimes on out-of-order architectures require an analysis of the in-core performance behavior of instructions and their dependencies.
Hager, Georg +3 more
core +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
Artifact for the paper "Abstract Interpretation of LLVM with a Region-Based Memory Model"
Arie Gurfinkel, Jorge A. Navas
openalex +3 more sources

