2026-09-19T05:51:18Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/664452022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
M. Frans Kaashoek and Nickolai Zeldovich.
Metreveli, Zviad
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2011-10-17T21:26:49Z
2011-10-17T21:26:49Z
2011
2011
http://hdl.handle.net/1721.1/66445
755725088
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).
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.
by Zviad Metreveli.
M.Eng.
47 p.
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
CPHASH : a cache-partitioned hash table with LRU eviction
Multi-core hash table
Cache-partitioned hash table with LRU eviction
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="924c2d92-fe95-4c51-988c-579f4521acd6">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>CPHASH : a cache-partitioned hash table with LRU eviction</Title>
<Subtitle>Multi-core hash table</Subtitle>
<Subtitle>Cache-partitioned hash table with LRU eviction</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2011</PublicationDate>
<Authors>
<Author>
<DisplayName>Metreveli, Zviad</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>