Search Results - "shared‐memory algorithms"

PATSMA: Parameter Auto-tuning for Shared Memory Algorithms by Fernandes, Joao B., Santos-da-Silva, Felipe H., Barros, Tiago, Assis, Italo A.S., Xavier-de-Souza, Samuel

“…Programs with high levels of complexity often face challenges in adjusting execution parameters, particularly when the ideal value for these parameters may…”
Get full text

Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs by Bader, David A., Cong, Guojing

“…Minimum spanning tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and…”
Get full text

Formal Analysis of Distributed Shared Memory Algorithms by Atif, Muhammad, Mudassar Naseer, Ahmad Salman Khan

“…The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocesses setup. Memory is considered coherent if a read…”
Get full text

Mutable locks: Combining the best of spin and sleep locks by Marotta, Romolo, Tiriticco, Davide, Di Sanzo, Pierangelo, Pellegrini, Alessandro, Ciciani, Bruno, Quaglia, Francesco

“…Summary In this article, we present mutable locks, a synchronization construct with the same semantic of traditional locks (such as spin locks or sleep locks),…”
Get full text

PATSMA: Parameter Auto-tuning for Shared Memory Algorithms by Fernandes, Joao B, Felipe H S da Silva, Xavier-de-Souza, Samuel, Assis, Italo A S

“…Programs with high levels of complexity often face challenges in adjusting execution parameters, particularly when these parameters vary based on the execution…”
Get full text

PowerRTF: Power Diagram based Restricted Tangent Face for Surface Remeshing by Yao, Yuyou, Liu, Jingjing, Fei, Yue, Wu, Wenming, Zhang, Gaofeng, Yan, Dong‐Ming, Zheng, Liping

“…Triangular meshes of superior quality are important for geometric processing in practical applications. Existing approximative CVT‐based remeshing methodology…”
Get full text

qblaze: An Efficient and Scalable Sparse Quantum Simulator by Venev, Hristo, Udomsrirungruang, Thien, Dimitrov, Dimitar, Gehr, Timon, Vechev, Martin

“…Classical simulation of quantum circuits is critical for the development of implementations of quantum algorithms: it does not require access to specialized…”
Get full text

NBBS: A Non-Blocking Buddy System for Multi-Core Machines by Marotta, Romolo, Ianni, Mauro, Pellegrini, Alessandro, Quaglia, Francesco

“…Common implementations of core memory allocation components handle concurrent allocation/release requests by synchronizing threads via spin-locks. This…”
Get full text

A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation by Nikolaev, Ruslan, Ravindran, Binoy

“…Historically, memory management based on lock-free reference counting was very inefficient, especially for read-dominated workloads. Thus, approaches such as…”
Get full text

Making Formulog Fast: An Argument for Unconventional Datalog Evaluation by Bembenek, Aaron, Greenberg, Michael, Chong, Stephen

“…With its combination of Datalog, SMT solving, and functional programming, the language Formulog provides an appealing mix of features for implementing…”
Get full text

Dynamic Buffer Management in Massively Parallel Systems: The Power of Randomness by Pham, Minh, Yuan, Yongke, Li, Hao, Mou, Chengcheng, Tu, Yicheng, Xu, Zichen, Meng, Jinghan

“…Massively parallel systems, such as Graphics Processing Units (GPUs), play an increasingly crucial role in today's data-intensive computing. The unique…”
Get more information

Max-PIM: Fast and Efficient Max/Min Searching in DRAM by Zhang, Fan, Angizi, Shaahin, Fan, Deliang

“…Recently, in-DRAM computing is becoming one promising technique to address the notorious 'memory-wall' issue for big data processing. In this work, for the…”
Get full text

Concurrent size by Sela, Gal, Petrank, Erez

“…The size of a data structure (i.e., the number of elements in it) is a widely used property of a data set. However, for concurrent programs, obtaining a…”
Get full text

Mat2Stencil: A Modular Matrix-Based DSL for Explicit and Implicit Matrix-Free PDE Solvers on Structured Grid by Cao, Huanqi, Tang, Shizhi, Zhu, Qianchao, Yu, Bowen, Chen, Wenguang

“…Partial differential equation (PDE) solvers are extensively utilized across numerous scientific and engineering fields. However, achieving high performance and…”
Get full text

Fully Anonymous Shared Memory Algorithms by Raynal, Michel, Taubenfeld, Gadi

“…Process anonymity has been studied for a long time. Memory anonymity is more recent. In an anonymous memory system, there is no a priori agreement among the…”
Get full text

SplitSync: Bank Group-Level Split-Synchronization for High-Performance DRAM PIM by Yoon, Byungkuk, Han, Sanghyeok, Park, Gyeonghwan, Kim, Jae-Joon

“…Processing in Memory (PIM) architectures enhance memory bandwidth by utilizing bank-level parallelism, typically implemented with a SIMD structure where all…”
Get full text

3D Tiled Code Generation for Nussinov’s Algorithm by Bielecki, Włodzimierz, Błaszyński, Piotr, Pałkowski, Marek

“…Current state-of-the-art parallel codes used to calculate the maximum number of pairs for a given RNA sequence by means of Nussinov’s algorithm do not allow…”
Get full text

PIMDup: An Optimized Deduplication Design on a Real Processing-in-Memory System by Yeh, Chun-Le, Chen, Liang-Chi, Ho, Chien-Chung, Chang, Yu-Ming, Chang, Da-Wei

“…Data deduplication enhances storage efficiency through non-destructive compression but is often hindered by the chunking process, which requires scanning the…”
Get full text

Migration in Hardware Transactional Memory on Asymmetric Multiprocessor by Sustran, Zivojin, Protic, Jelica

“…In this paper, a system is presented which implements transactions migration to an asymmetric multiprocessor in order to decrease the probability of conflicts…”
Get full text

A Shared-Memory Algorithm for Updating Tree-Based Properties of Large Dynamic Networks by Srinivasan, Sriram, Pollard, Samuel D., Norris, Boyana, Das, Sajal K., Bhowmick, Sanjukta

“…This paper presents a network-based template for analyzing large-scale dynamic data. Specifically, we propose a novel shared-memory parallel algorithm for…”
Get full text