Show simple item record

CPHash: A Cache-Partitioned Hash Table

dc.date.accessioned2011-11-28T18:30:04Z
dc.date.accessioned2018-11-26T22:26:45Z
dc.date.available2011-11-28T18:30:04Z
dc.date.available2018-11-26T22:26:45Z
dc.date.issued2011-11-26
dc.identifier.urihttp://hdl.handle.net/1721.1/67296
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/67296
dc.description.abstractCPHash is a concurrent hash table for multicore processors. CPHash partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partition. CPHash's message passing avoids the need for locks, pipelines batches of asynchronous messages, and packs multiple messages into a single cache line transfer. Experiments on a 80-core machine with 2 hardware threads per core show that CPHash has ~1.6x higher throughput than a hash table implemented using fine-grained locks. An analysis shows that CPHash wins because it experiences fewer cache misses and its cache misses are less expensive, because of less contention for the on-chip interconnect and DRAM. CPServer, a key/value cache server using CPHash, achieves ~5% higher throughput than a key/value cache server that uses a hash table with fine-grained locks, but both achieve better throughput and scalability than memcached. Finally, the throughput of CPHash and CPServer scales near-linearly with the number of cores.en_US
dc.format.extent10 p.en_US
dc.titleCPHash: A Cache-Partitioned Hash Tableen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2011-051.pdf439.1Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record