Imagen de Portada

Hash & Adjust: Competitive Demand-Aware Consistent Hashing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pourdamghani, Arash, Avin, Chen, Sama, Robert, Shiran, Maryam, Schmid, Stefan
Formato:	Preprint
Publicado:	2024
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

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

History-Independent Concurrent Hash Tables
por: Attiya, Hagit, et al.
Publicado: (2025)

MementoHash: A Stateful, Minimal Memory, Best Performing Consistent Hash Algorithm
por: Coluzzi, Massimo, et al.
Publicado: (2023)

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

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

JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets
por: Ertl, Otmar
Publicado: (2024)

Competitive Capacitated Online Recoloring
por: Rajaraman, Rajmohan, et al.
Publicado: (2024)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
por: Yang, Mingqi
Publicado: (2024)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
por: Lechowicz, Adam, et al.
Publicado: (2023)

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

Fully Scalable MPC Algorithms for Clustering in High Dimension
por: Czumaj, Artur, et al.
Publicado: (2023)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
por: Chang, Yi-Jun, et al.
Publicado: (2024)

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

On the Resilience of Fast Failover Routing Against Dynamic Link Failures
por: Dai, Wenkai, et al.
Publicado: (2024)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
por: Bui, Hong Duc, et al.
Publicado: (2024)

On Distributed Computation of the Minimum Triangle Edge Transversal
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
por: Wang, Letong, et al.
Publicado: (2024)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
por: Hsieh, Chou-Ying, et al.
Publicado: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
por: Liu, Quanquan C., et al.
Publicado: (2024)

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
por: Prokopenko, Andrey, et al.
Publicado: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Parallel Integer Sort: Theory and Practice
por: Dong, Xiaojun, et al.
Publicado: (2024)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
por: Akker, Erik van den, et al.
Publicado: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
por: Polyanskii, Nikita, et al.
Publicado: (2024)

Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
por: Ngo, Vinh Quang, et al.
Publicado: (2024)

Distributed Maximum Flow in Planar Graphs
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2024)

Dynamic Maximal Matching in Clique Networks
por: Li, Minming, et al.
Publicado: (2024)

Massively Parallel Ruling Set Made Deterministic
por: Giliberti, Jeff, et al.
Publicado: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
por: Almeida, Paulo Sérgio, et al.
Publicado: (2024)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
por: Sanders, Peter, et al.
Publicado: (2024)

Efficient Enumeration of Large Maximal k-Plexes
por: Cheng, Qihao, et al.
Publicado: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
por: Gil, Yuval
Publicado: (2024)

Deterministic Expander Routing: Faster and More Versatile
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Distributed Lovász Local Lemma under Bandwidth Limitations
por: Halldórsson, Magnús M., et al.
Publicado: (2024)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
por: Bai, Sirui, et al.
Publicado: (2024)

History Trees and Their Applications
por: Viglietta, Giovanni
Publicado: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
por: Latypov, Rustam, et al.
Publicado: (2024)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
por: Li, Qian, et al.
Publicado: (2024)

Distributed Download from an External Data Source in Faulty Majority Settings
por: Augustine, John, et al.
Publicado: (2024)