Imagen de Portada

Shared-Memory Hierarchical Process Mapping

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Schulz, Christian, Woydt, Henning
Formato:	Preprint
Publicado:	2025
Materias:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
por: Rodriguez, Matthew, et al.
Publicado: (2024)

Parallel Algorithms for Hierarchical Nucleus Decomposition
por: Shi, Jessica, et al.
Publicado: (2023)

Bounded Memory in Distributed Networks
por: Basat, Ran Ben, et al.
Publicado: (2025)

Memory Bounds for Concurrent Bounded Queues
por: Aksenov, Vitaly, et al.
Publicado: (2021)

Scalable Fault-Tolerant MapReduce
por: Hespe, Demian, et al.
Publicado: (2024)

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
por: Coluzzi, Massimo, et al.
Publicado: (2024)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
por: Wu, Hanjiang, et al.
Publicado: (2024)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
por: Blin, Lelia, et al.
Publicado: (2026)

Auditable Shared Objects: From Registers to Synchronization Primitives
por: Attiya, Hagit, et al.
Publicado: (2025)

DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
por: Islam, Abdullah Al Raqibul, et al.
Publicado: (2024)

Balls and Bins and the Infinite Process with Random Deletions
por: Berenbrink, Petra, et al.
Publicado: (2025)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions
por: Bateni, MohammadHossein, et al.
Publicado: (2025)

Efficient Dynamic MaxFlow Computation on GPUs
por: Kannappan, Shruthi, et al.
Publicado: (2025)

Towards Optimal Distributed Edge Coloring with Fewer Colors
por: Jakob, Manuel, et al.
Publicado: (2025)

Perfect Matching with Few Link Activations
por: Mirault, Hugo, et al.
Publicado: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
por: Feist, Dankrad, et al.
Publicado: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
por: Li, Fuhuan, et al.
Publicado: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
por: Gil, Yuval, et al.
Publicado: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
por: McCoy, Hunter, et al.
Publicado: (2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
por: Baumecker, Malte, et al.
Publicado: (2025)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
por: Dindoost, Mohammad, et al.
Publicado: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
por: Dufoulon, Fabien, et al.
Publicado: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
por: Mordacchini, Matteo, et al.
Publicado: (2025)

Constrained Cuts, Flows, and Lattice-Linearity
por: Streit, Robert, et al.
Publicado: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
por: Meir, Shachar, et al.
Publicado: (2025)

BLEST: Blazingly Efficient BFS using Tensor Cores
por: Elbek, Deniz, et al.
Publicado: (2025)

Weighted Matching in a Poly-Streaming Model
por: Ullah, Ahammed, et al.
Publicado: (2025)

Computing in a Faulty Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
por: Dufoulon, Fabien, et al.
Publicado: (2025)

Distributed Interactive Proofs for Planarity with Log-Star Communication
por: Gil, Yuval, et al.
Publicado: (2025)

Optimal Distributed Replacement Paths
por: Chang, Yi-Jun, et al.
Publicado: (2025)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
por: Shovan, S. M., et al.
Publicado: (2025)

Big Atomics
por: Anderson, Daniel, et al.
Publicado: (2025)

Parallel Algorithms for the One Sided Crossing Minimization Problem
por: Popa, Bogdan-Ioan, et al.
Publicado: (2025)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
por: Chakraborty, Srijan, et al.
Publicado: (2025)

Optimal local certification on graphs of bounded pathwidth
por: Baterisna, Dan Alden, et al.
Publicado: (2025)

Fully Scalable MPC Algorithms for Euclidean k-Center
por: Czumaj, Artur, et al.
Publicado: (2025)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
por: Boneh, Itai, et al.
Publicado: (2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
por: Khoury, Seri, et al.
Publicado: (2025)