Mercury: Bringing efficiency to key-value stores

ACM International Conference Proceeding Series

Volumn , Issue , 2013, Pages

  Gandhi, Rohan ^a   Gupta, Aayush ^b   Povzner, Anna ^b   Belluomini, Wendy ^b   Kaldewey, Tim ^b  

^a PURDUE UNIVERSITY   (United States)

^b IBM RESEARCH   (United States)

Author keywords

Cache; Concurrency; Key value

Indexed keywords

BOTTOM UP APPROACH; CACHE; CONCURRENCY; DESIGN PRINCIPLES; HIGH CONCURRENCIES; KEY VALUES; MEMORY SUBSYSTEMS; PERFORMANCE BOTTLENECKS;

DIGITAL STORAGE; MERCURY (METAL);

DYNAMIC RANDOM ACCESS STORAGE;

EID: 84882393149     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2485732.2485746     Document Type: Conference Paper

References (23)

1. Class concurrenthashmap. http://gee.cs.oswego.edu/dl/jsr166/dist/docs/ java/util/concurrent/ConcurrentHashMap.html.
2. Cuckoo hashing expansion. http://users.cis.fiu.edu/~weiss/dsaajava3/code.
3. High performance at massive scale - Lessons learned at Facebook. http://tinyurl.com/ygvkpet.
4. Java theory and practice: Building a better hashmap. http://www.ibm.com/ developerworks/library/j-jtp08223/.
5. Memcached. http://memcached.org.
6. Memcached multiget hole. http://tinyurl.com/yz5wyvc.
7. Network bandwidth growth. http://tinyurl.com/9hx23su.
8. Network bandwidth growth. http://tinyurl.com/9n4g34u.
9. "papi". http://icl.cs.utk.edu/papi/.
10. Redis. redis.io.
11. B. Atikoglu, Y. Xu, E. Frachtenberg, et al. Workload analysis of a large-scale key-value store. SIGMETRICS '12, pages 53-64, 2012.
12. S. Boyd-Wickizer, A. T. Clements, Y. Mao, A. Pesterev, M. F. Kaashoek, R. Morris, and N. Zeldovich. An analysis of linux scalability to many cores. OSDI'10, pages 1-8, 2010.
13. B. Cooper, A. Silberstein, E. Tam, et al. Benchmarking cloud serving systems with ycsb. In Proceedings of the 1st ACM symposium on Cloud computing, pages 143-154, 2010.
14. B. Fan, D. G. Andersen, and M. Kaminsky. MemC3: Compact and concurrent memcache with dumber caching and smarter hashing. In Proc. 10th USENIX NSDI, Lombard, IL, Apr. 2013.
15. G. D. Knott. Expandable open addressing hash table storage and retrieval. SIGFIDET '71, pages 187-206, 1971.
16. H. Lim, B. Fan, D. G. Andersen, et al. Silt: A memory-efficient, high-performance key-value store. SOSP '11, 2011.
17. Y. Mao, E. Kohler, and R. T. Morris. Cache craftiness for fast multicore key-value storage. EuroSys '12, pages 183-196, 2012.
18. W. D. Maurer and T. G. Lewis. Hash table methods. ACM Comput. Surv., pages 5-19, 1975.
19. Z. Metreveli, N. Zeldovich, et al. Cphash: A cache-partitioned hash table. PPoPP '12, pages 319-320, 2012.
20. R. Nishtala, H. Fugal, S. Grimm, M. Kwiatkowski, H. Lee, H. C. Li, R. McElroy, M. Paleczny, D. Peek, P. Saab, D. Stafford, T. Tung, and V. Venkataramani. Scaling memcache at facebook. In Proc. 10th USENIX NSDI, Lombard, IL, Apr. 2013.
21. J. Ousterhout, P. Agrawal, D. Erickson, C. Kozyrakis, J. Leverich, D. Mazières, S. Mitra, A. Narayanan, G. Parulkar, M. Rosenblum, et al. The case for ramclouds: scalable high-performance storage entirely in dram. ACM SIGOPS Operating Systems Review, 43(4):92-105, 2010.
22. O. Shalev and N. Shavit. Split-ordered lists: lock-free extensible hash tables. PODC '03, pages 102-111, 2003.
23. D. Zhang and P.-A. Larson. Lhlf: lock-free linear hashing (poster paper). PPoPP '12, 2012.