Image de couverture de livre

A Hybrid Vectorized Merge Sort on ARM NEON

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhou, Jincheng, Zhang, Jin, Zhang, Xiang, Xiao, Tiaojie, Ma, Di, Gong, Chunye
Format:	Preprint
Publié:	2024
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fine-Grained Vectorized Merge Sorting on RISC-V: From Register to Cache
par: Zhang, Jin, et autres
Publié: (2024)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
par: Dang'ana, Michael
Publié: (2026)

Parallel Integer Sort: Theory and Practice
par: Dong, Xiaojun, et autres
Publié: (2024)

Sorting in One and Two Rounds using $t$-Comparators
par: Gelles, Ran, et autres
Publié: (2024)

Evaluation of Dynamic Vector Bin Packing for Virtual Machine Placement
par: Lee, Zong Yu, et autres
Publié: (2026)

Zarr-Based Chunk-Level Cumulative Sums in Reduced Dimensions
par: Zhang, Hailiang, et autres
Publié: (2025)

A Randomised Approach to Distributed Sorting
par: Olesker-Taylor, Sam
Publié: (2025)

Efficient Enumeration of Large Maximal k-Plexes
par: Cheng, Qihao, et autres
Publié: (2024)

Fast Concurrent Primitives Despite Contention
par: Bender, Michael A., et autres
Publié: (2026)

A Simple and Robust Protocol for Distributed Counting
par: Cohen, Edith, et autres
Publié: (2025)

A Simple Distributed Deterministic Planar Separator
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2026)

A Scalable and Unified Framework to Weighted Rank Aggregation
par: Carmel, Amir, et autres
Publié: (2026)

A Distributed Conductance Tester Without Global Information Collection
par: Batu, Tugkan, et autres
Publié: (2023)

A Parallel Scan Algorithm in the Tensor Core Unit Model
par: Zouzias, Anastasios, et autres
Publié: (2024)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
par: Fokkink, Wan, et autres
Publié: (2026)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
par: Gil, Yuval, et autres
Publié: (2025)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
par: Li, Qian, et autres
Publié: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
par: Cambus, Mélanie, et autres
Publié: (2022)

Can Like Attract Like? A Study of Homonymous Gathering in Networks
par: Devismes, Stéphane, et autres
Publié: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
par: McCoy, Hunter, et autres
Publié: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
par: Mordacchini, Matteo, et autres
Publié: (2025)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
par: Hsieh, Chou-Ying, et autres
Publié: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
par: Almeida, Paulo Sérgio, et autres
Publié: (2024)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
par: Rodriguez, Matthew, et autres
Publié: (2024)

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
par: Coluzzi, Massimo, et autres
Publié: (2024)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
par: Sahu, Abhijeet, et autres
Publié: (2026)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
par: Chakraborty, Srijan, et autres
Publié: (2025)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
par: Manor, Daniel, et autres
Publié: (2025)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
par: Assadi, Sepehr
Publié: (2023)

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

Towards Optimal Distributed Edge Coloring with Fewer Colors
par: Jakob, Manuel, et autres
Publié: (2025)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
par: Feist, Dankrad, et autres
Publié: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
par: Li, Fuhuan, et autres
Publié: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
par: Chang, Yi-Jun, et autres
Publié: (2022)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
par: Bui, Hong Duc, et autres
Publié: (2024)