CPHASH : a cache-partitioned hash table with LRU eviction
Name
755725088-MIT.pdf
Description
Full printable version
Size
3.15 MB
Format
Adobe PDF
Checksum (MD5)
ffd8394008897d5652c97fe0e0c8158d
Author(s)
Metreveli, Zviad
Advisor(s)
M. Frans Kaashoek and Nickolai Zeldovich.
Alternative Title
Multi-core hash table
Cache-partitioned hash table with LRU eviction
Date Issued
2011
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis we introduce CPHASH - a scalable fixed size hash table that supports eviction using an LRU list, and CPSERVER - a scalable in memory key/value cache server that uses CPHASH to implement its hash table. CPHASH uses computation migration to avoid transferring data between cores. Experiments on a 48 core machine show that CPHASH has 2 to 3 times higher throughput than a hash table implemented using scalable fine-grained locks. CPSERVER achieves 1.2 to 1.7 times higher throughput than a key/value cache server that uses a hash table with scalable fine-grained locks and 1.5 to 2.6 times higher throughput than MEMCACHED.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.
In title on title page,"ASH" appears as subscript upper case letters. Cataloged from PDF version of thesis.
Includes bibliographical references (p. 45-47).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
