In this work we present a cost-based memory partitioning and management mechanism for Memcached, an in-memory key-value store used as Web cache, that is able to dynam-ically adapt to user requests and manage the memory ac-cording to both object sizes and costs. We then present a comparative analysis of the vanilla memory management scheme of Memcached and our approach, using real traces from a major content delivery network operator. Our results indicate that our scheme achieves near-optimal performance, striking a good balance between the performance perceived by end-users and the pressure imposed on back-end servers.
Cost-based Memory Partitioning and Management in Memcached
CARRA, DAMIANO;
2015-01-01
Abstract
In this work we present a cost-based memory partitioning and management mechanism for Memcached, an in-memory key-value store used as Web cache, that is able to dynam-ically adapt to user requests and manage the memory ac-cording to both object sizes and costs. We then present a comparative analysis of the vanilla memory management scheme of Memcached and our approach, using real traces from a major content delivery network operator. Our results indicate that our scheme achieves near-optimal performance, striking a good balance between the performance perceived by end-users and the pressure imposed on back-end servers.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
memcached_weight_cr.pdf
non disponibili
Tipologia:
Documento in Pre-print
Licenza:
Accesso ristretto
Dimensione
299.68 kB
Formato
Adobe PDF
|
299.68 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.