Suchergebnisse - Theory of computation → Concurrent algorithms
-
1
Separating Mechanism from Policy in STM
Veröffentlicht: IEEE 21.10.2023Veröffentlicht in 2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT) (21.10.2023)“… When designing concurrent data structures (CDSs), it can feel like programmers must choose between performance and convenience …”
Volltext
Tagungsbericht -
2
Hardware Support for Durable Atomic Instructions for Persistent Parallel Programming
Veröffentlicht: IEEE 09.07.2023Veröffentlicht in 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“… Persistent memory is emerging as an attractive main memory fabric capable of hosting persistent data. However, its programmability is hampered by the lack of …”
Volltext
Tagungsbericht -
3
HADES: Hardware-Assisted Distributed Transactions in the Age of Fast Networks and SmartNICs
Veröffentlicht: IEEE 29.06.2024Veröffentlicht in 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) (29.06.2024)“… Transactional-based distributed storage applications such as key-value stores and databases are widely used in the cloud. Recently, the hardware on which these …”
Volltext
Tagungsbericht -
4
BLOwing Trees to the Ground: Layout Optimization of Decision Trees on Racetrack Memory
Veröffentlicht: IEEE 05.12.2021Veröffentlicht in 2021 58th ACM/IEEE Design Automation Conference (DAC) (05.12.2021)“… Modern distributed low power systems tend to integrate machine learning algorithms, which are directly executed on the distributed devices (on the edge …”
Volltext
Tagungsbericht -
5
Unfair Scheduling Patterns in NUMA Architectures
ISSN: 2641-7936Veröffentlicht: IEEE 01.09.2019Veröffentlicht in Proceedings / International Conference on Parallel Architectures and Compilation Techniques (01.09.2019)“… Lock-free algorithms are typically designed and analyzed with adversarial scheduling in mind …”
Volltext
Tagungsbericht -
6
Optimizing Persistent Memory Transactions
ISSN: 2641-7936Veröffentlicht: IEEE 01.09.2019Veröffentlicht in Proceedings / International Conference on Parallel Architectures and Compilation Techniques (01.09.2019)“… We show how to build concurrent persistent transactional memory from traditional software transactional memories …”
Volltext
Tagungsbericht -
7
DRPTM: A Decoupled Read-efficient High-scalable Persistent Transactional Memory
Veröffentlicht: IEEE 09.07.2023Veröffentlicht in 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“… Persistent transactional memory (PTM) exploits transactions to provide an easy crash-consistent interface for persistent memory (PM). However, because of the …”
Volltext
Tagungsbericht -
8
Enforcing Crash Consistency of Evolving Network Analytics in Non-Volatile Main Memory Systems
ISSN: 2641-7936Veröffentlicht: IEEE 01.09.2019Veröffentlicht in Proceedings / International Conference on Parallel Architectures and Compilation Techniques (01.09.2019)“… Evolving graph processing has enabled the modeling of many complex network systems, e.g., online social networks and gene networks. Existing in-memory graph …”
Volltext
Tagungsbericht -
9
Forgive-TM: Supporting Lazy Conflict Detection In Eager Hardware Transactional Memory
ISSN: 2641-7936Veröffentlicht: IEEE 01.09.2019Veröffentlicht in Proceedings / International Conference on Parallel Architectures and Compilation Techniques (01.09.2019)“… Commercial hardware transactional memory (TM) systems commonly use coherence messages to detect data conflicts. When a core inside a transaction receives a …”
Volltext
Tagungsbericht -
10
Toward High-Performance Blockchain System by Blurring the Line between Ordering and Execution
Veröffentlicht: IEEE 17.11.2024Veröffentlicht in SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“… The primary bottleneck of blockchain is shifting from consensus to execution due to recent advances in DAGbased consensus algorithms supporting over 100k TPS …”
Volltext
Tagungsbericht -
11
An Adaptive Asynchronous Approach for the Single-Source Shortest Paths Problem
Veröffentlicht: IEEE 17.11.2024Veröffentlicht in SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“… Large-scale graphs with billions and trillions of vertices and edges require efficient parallel algorithms for common graph problems, one of which is single-source shortest paths (SSSP …”
Volltext
Tagungsbericht -
12
Exploring Memory Persistency Models for GPUs
ISSN: 2641-7936Veröffentlicht: IEEE 01.09.2019Veröffentlicht in Proceedings / International Conference on Parallel Architectures and Compilation Techniques (01.09.2019)“… Given its high integration density, high speed, byte addressability, and low standby power, non-volatile or persistent memory is expected to supplement/replace …”
Volltext
Tagungsbericht -
13
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
ISSN: 0096-3003, 1873-5649Veröffentlicht: Amsterdam Elsevier Inc 15.10.2009Veröffentlicht in Applied mathematics and computation (15.10.2009)“… A synchronous concurrent algorithm (SCA) is a parallel deterministic algorithm based on a network of modules and channels, computing and communicating data in parallel, and synchronised by a global clock with discrete time …”
Volltext
Journal Article Tagungsbericht -
14
Modes, Persistence and Orthogonality: Blowing MPI Up
Veröffentlicht: IEEE 17.11.2024Veröffentlicht in SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“… The Message-Passing Interface (MPI) specification provides a restricted form of persistence in point-to-point and collective communication operations that …”
Volltext
Tagungsbericht -
15
Pure quadratization and solution of ordinary differential equations by probabilistic evolution theory with concurrent computation of coefficients using exact arithmetic
ISSN: 0259-9791, 1572-8897Veröffentlicht: Cham Springer International Publishing 01.03.2024Veröffentlicht in Journal of mathematical chemistry (01.03.2024)“… A novel algorithm for concurrent computation of the coefficients of the series expansion is designed and implemented …”
Volltext
Journal Article -
16
Late Breaking Results: An Efficient and Scalable Track Assignment with GPU Parallelism
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… Based on the independence and divisibility of track assignment, we propose a GPU-accelerated parallel track assignment algorithm …”
Volltext
Tagungsbericht -
17
pSyncPIM: Partially Synchronous Execution of Sparse Matrix Operations for All-Bank PIM Architectures
Veröffentlicht: IEEE 29.06.2024Veröffentlicht in 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) (29.06.2024)“… Sparse matrix processing is another critical computation that can significantly benefit from the PIM architecture, but the current all-bank PIM control cannot support diverging executions due to the random sparsity …”
Volltext
Tagungsbericht -
18
PairGraph: An Efficient Search-space-aware Accelerator for High-performance Concurrent Pairwise Queries
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… suffer from irregular memory access and fragmented data sharing when processing Concurrent Pairwise Queries (CPQ …”
Volltext
Tagungsbericht -
19
Gluon-Async: A Bulk-Asynchronous System for Distributed and Heterogeneous Graph Analytics
ISSN: 2641-7936Veröffentlicht: IEEE 01.09.2019Veröffentlicht in Proceedings / International Conference on Parallel Architectures and Compilation Techniques (01.09.2019)“… Distributed graph analytics systems for CPUs, like D-Galois and Gemini, and for GPUs, like D-IrGL and Lux, use a bulk-synchronous parallel (BSP) programming …”
Volltext
Tagungsbericht -
20
Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines
ISSN: 0162-8828, 1939-3539Veröffentlicht: Los Alamitos, CA IEEE 01.10.2008Veröffentlicht in IEEE transactions on pattern analysis and machine intelligence (01.10.2008)“… We propose a parallel algorithm which achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings and thickenings, based on Salembier's …”
Volltext
Journal Article