English
Related papers

Related papers: The Influence of Malloc Placement on TSX Hardware …

200 papers

Recent innovations focused around {\em parallel} processing, either through systems containing multiple processors or processors containing multiple cores, hold great promise for enhancing the performance of the trigger at the LHC and…

Computational Physics · Physics 2015-06-17 V. Halyo , P. LeGresley , P. Lujan , V. Karpusenko , A. Vladimirov

Hardware design faces a fundamental challenge: raising abstraction to improve productivity while maintaining control over low-level details like cycle accuracy. Traditional RTL design in languages like SystemVerilog composes modules through…

Programming Languages · Computer Science 2025-11-20 Youwei Xiao , Zizhang Luo , Weijie Peng , Yuyang Zou , Yun Liang

Spin-Transfer Torque RAM (STT-RAM) is widely considered a promising alternative to SRAM in the memory hierarchy due to STT-RAM's non-volatility, low leakage power, high density, and fast read speed. The STT-RAM's small feature size is…

Hardware Architecture · Computer Science 2019-08-12 Kyle Kuan , Tosiron Adegbija

Modern cost-based DBMSs frequently exhibit execution instability and tail-latency amplification when high-dimensional relational operations trigger memory-regime transitions such as hash-table spilling and external materialization. We…

Databases · Computer Science 2026-02-26 Il-Sun Chang

Algorithms that use hardware transactional memory (HTM) must provide a software-only fallback path to guarantee progress. The design of the fallback path can have a profound impact on performance. If the fallback path is allowed to run…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-08-17 Trevor Brown

The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item. While the standard solution to such conflicts is to immediately abort one of the transactions, some…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-04-04 Dan Alistarh , Syed Kamran Haider , Raphael Kübler , Giorgi Nadiradze

Succinct trees, such as wavelet trees and those based on, for instance, range Min-Max trees (RMMTs), are a family of practical data structures that store information close to their information-theoretic space lower bound. These structures…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-03-21 Erick Elejalde , Jose Fuentes-Sepúlveda , Leo Ferres

Shared virtual memory (SVM) is key in heterogeneous systems on chip (SoCs), which combine a general-purpose host processor with a many-core accelerator, both for programmability and to avoid data duplication. However, SVM can bring a…

Hardware Architecture · Computer Science 2018-08-30 Andreas Kurth , Pirmin Vogel , Andrea Marongiu , Luca Benini

Large Language Models (LLMs) have achieved unprecedented success across various applications, but their substantial memory requirements pose significant challenges to current memory system designs, especially during inference. Our work…

Hardware Architecture · Computer Science 2025-12-02 Zhongchun Zhou , Chengtao Lai , Wei Zhang

As Mixed Criticality Systems (MCSs) evolve, they increasingly integrate heterogeneous computing platforms, combining general-purpose processors with specialized accelerators such as AI engines, GPUs, and high-speed networking interfaces.…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-28 Diogo Costa , Jose Martins , Sandro Pinto

While multi-GPU (MGPU) systems are extremely popular for compute-intensive workloads, several inefficiencies in the memory hierarchy and data movement result in a waste of GPU resources and difficulties in programming MGPU systems. First,…

Hardware Architecture · Computer Science 2020-07-09 Saiful A. Mojumder , Yifan Sun , Leila Delshadtehrani , Yenai Ma , Trinayan Baruah , José L. Abellán , John Kim , David Kaeli , Ajay Joshi

When verifying a concurrent program, it is usual to assume that memory is sequentially consistent. However, most modern multiprocessors depend on store buffering for efficiency, and provide native sequential consistency only at a…

Logic in Computer Science · Computer Science 2009-09-28 Ernie Cohen , Norbert Schirmer

Transactional Memory (TM) is an approach aiming to simplify concurrent programming by automating synchronization while maintaining efficiency. TM usually employs the optimistic concurrency control approach, which relies on transactions…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-11-21 Paweł T. Wojciechowski , Konrad Siek

As capacity and complexity of on-chip cache memory hierarchy increases, the service cost to the critical loads from Last Level Cache (LLC), which are frequently repeated, has become a major concern. The processor may stall for a…

Hardware Architecture · Computer Science 2016-08-09 Navid Khoshavi , Xunchao Chen , Jun Wang , Ronald F. DeMara

Writing concurrent programs is a hard task, even when using high-level synchronization primitives such as transactional memories together with a functional language with well-controlled side-effects such as Haskell, because the…

Logic in Computer Science · Computer Science 2013-12-11 Romain Demeyer , Wim Vanhoof

Emerging non-volatile memory (NVM) technologies promise memory speed byte-addressable persistent storage with a load/store interface. However, programming applications to directly manipulate NVM data is complex and error-prone. Applications…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-01 Pradeep Fernando , Irina Calciu , Jayneel Gandhi , Aasheesh Kolli , Ada Gavrilovska

Transactional Memory (TM) is an approach to concurrency control that aims to make writing parallel programs both effective and simple. The approach is started in non-distributed multiprocessor systems, but is gaining popularity in…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-03-31 Jan Baranowski , Paweł Kobyliński , Konrad Siek , Paweł T. Wojciechowski

We propose Atomic Active Messages (AAM), a mechanism that accelerates irregular graph computations on both shared- and distributed-memory machines. The key idea behind AAM is that hardware transactional memory (HTM) can be used for simple…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-11-02 Maciej Besta , Torsten Hoefler

The Total Store Order (TSO) is arguably the most widely used relaxed memory model in multiprocessor architectures, widely implemented, for example in Intel's x86 and x64 platforms. It allows processes to delay the visibility of writes…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-18 Raïssa Nataf , Yoram Moses

Smart contract transactions demonstrate issues of performance and correctness that application programmers must work around. Although the blockchain consensus mechanism approaches ACID compliance, use cases that rely on frequent state…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-05-30 Victor Cook , Zachary Painter , Christina Peterson , Damian Dechev