Cover Image

MementoHash: A Stateful, Minimal Memory, Best Performing Consistent Hash Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Coluzzi, Massimo, Brocco, Amos, Antonucci, Alessandro, Leidi, Tiziano
Format:	Preprint
Published:	2023
Subjects:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Networking and Internet Architecture
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
by: Pourdamghani, Arash, et al.
Published: (2024)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
by: Bonomi, Silvia, et al.
Published: (2021)

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

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

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

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

Local Rendezvous Hashing: Bounded Loads and Minimal Churn via Cache-Local Candidates
by: Guan, Yongjie
Published: (2025)

Constitutional Consensus for Democratic Governance
by: Keidar, Idit, et al.
Published: (2025)

Accelerating Distributed Deep Learning using Lossless Homomorphic Compression
by: Li, Haoyu, et al.
Published: (2024)

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

Structured Gossip: A Partition-Resilient DNS for Internet-Scale Dynamic Networks
by: Sinha, Priyanka, et al.
Published: (2026)

Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks
by: Zhang, Yunqi, et al.
Published: (2024)

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

On Optimizing Locality of Graph Transposition on Modern Architectures
by: Esfahani, Mohsen Koohi, et al.
Published: (2025)

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

OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths
by: Gold, Leo, et al.
Published: (2024)

The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing
by: Weidner, Matthew, et al.
Published: (2023)

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

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

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

Shared-Memory Hierarchical Process Mapping
by: Schulz, Christian, et al.
Published: (2025)

GORGO: Maximizing KV-Cache Reuse While Minimizing Network Latency in Cross-Region LLM Load Balancing
by: Toniolo, Alessio Ricci, et al.
Published: (2026)

Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)

DAG-Inducing Problems and Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)

Eventually Lattice-Linear Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)

Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025)

Two-Fold Byzantine Fault Tolerance Algorithm: Byzantine Consensus in Blockchain
by: Shakournia, Mohammad R., et al.
Published: (2025)

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

Encoding Schemes for Parallel In-Place Algorithms
by: Hutton, Chase, et al.
Published: (2025)

Performance Evaluation of Brokerless Messaging Libraries
by: La Corte, Lorenzo, et al.
Published: (2025)

PSMOA: Policy Support Multi-Objective Optimization Algorithm for Decentralized Data Replication
by: Wang, Xi, et al.
Published: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
by: Dory, Michal, et al.
Published: (2024)

PASGAL: Parallel And Scalable Graph Algorithm Library
by: Dong, Xiaojun, et al.
Published: (2024)

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

Two Efficient Message-passing Exclusive Scan Algorithms
by: Träff, Jesper Larsson
Published: (2026)

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

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

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

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)