{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:42:31Z","timestamp":1743090151318,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708581"},{"type":"electronic","value":"9789819708598"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0859-8_26","type":"book-chapter","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:02:20Z","timestamp":1708963340000},"page":"436-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["THRCache: DRAM-NVM Multi-level Cache with\u00a0Thresholded Heterogeneous Random Choices"],"prefix":"10.1007","author":[{"given":"Tao","family":"Tao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7814-5790","authenticated-orcid":false,"given":"Zhiwen","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Jibin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Zhihui","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., Paleczny, M.: Workload analysis of a large-scale key-value store. In: Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, pp. 53\u201364 (2012)","DOI":"10.1145\/2254756.2254766"},{"key":"26_CR2","unstructured":"Memcached (2023). http:\/\/memcached.org\/. Accessed 17 May 2023"},{"key":"26_CR3","unstructured":"Redis (2023). http:\/\/redis.io\/. Accessed 17 May 2023"},{"key":"26_CR4","unstructured":"Manes, B.: A high performance caching library for Java 8 (2016). https:\/\/github.com\/ben-manes\/caffeine"},{"key":"26_CR5","unstructured":"Luck, G., Suravarapu, S., King, G., Talevi, M.: Ehcache distributed cache system. http:\/\/www.ehcache.org\/. Accessed 17 May 2023"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Fan, B., Lim, H., Andersen, D.G., Kaminsky, M.: Small cache, big effect: provable load balancing for randomly partitioned cluster services. In: Proceedings of the 2nd ACM Symposium on Cloud Computing, pp. 1\u201312 (2011)","DOI":"10.1145\/2038916.2038939"},{"key":"26_CR7","unstructured":"Liu, Z., et al.: DistCache: provable load balancing for large-scale storage systems with distributed caching. In: FAST. vol. 19, pp. 143\u2013157 (2019)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Cai, Z., Lin, J., Liu, F., Chen, Z., Li, H.: NVMCache: wear-aware load balancing nvm-based caching for large-scale storage systems. In: 2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA\/BDCloud\/SocialCom\/SustainCom), pp. 657\u2013665. IEEE (2020)","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00108"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11390-020-0780-z","volume":"36","author":"HK Liu","year":"2021","unstructured":"Liu, H.K., et al.: A survey of non-volatile main memory technologies: state-of-the-arts, practices, and future directions. J. Comput. Sci. Technol. 36, 4\u201332 (2021)","journal-title":"J. Comput. Sci. Technol."},{"key":"26_CR10","unstructured":"Chen, H., Ruan, C., Li, C., Ma, X., Xu, Y.: SpanDB: a fast, cost-effective LSM-tree based KV store on hybrid storage. In: FAST. vol. 21, pp. 17\u201332 (2021)"},{"issue":"4","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3480963","volume":"17","author":"C Li","year":"2021","unstructured":"Li, C., Chen, H., Ruan, C., Ma, X., Xu, Y.: Leveraging NVMe SSDs for building a fast, cost-effective, LSM-tree-based KV store. ACM Trans. Storage (TOS) 17(4), 1\u201329 (2021)","journal-title":"ACM Trans. Storage (TOS)"},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3483840","volume":"17","author":"S Dong","year":"2021","unstructured":"Dong, S., Kryczka, A., Jin, Y., Stumm, M.: RocksDB: evolution of development priorities in a key-value store serving large-scale applications. ACM Trans. Storage (TOS) 17(4), 1\u201332 (2021)","journal-title":"ACM Trans. Storage (TOS)"},{"key":"26_CR13","unstructured":"Eisenman, A., et al.: Flashield: a hybrid key-value cache that controls flash write amplification. In: NSDI, pp. 65\u201378 (2019)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Liu, J., Chai, Y., Qin, X., Xiao, Y.: PLC-cache: endurable SSD cache for deduplication-based primary storage. In: 2014 30th Symposium on Mass Storage Systems and Technologies (MSST), pp. 1\u201312. IEEE (2014)","DOI":"10.1109\/MSST.2014.6855536"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Jiang, D., Che, Y., Xiong, J., Ma, X.: uCache: a utility-aware multilevel SSD cache management policy. In: 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, pp. 391\u2013398. IEEE (2013)","DOI":"10.1109\/HPCC.and.EUC.2013.63"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"5293","DOI":"10.1007\/s11227-018-2421-7","volume":"74","author":"SK Yoon","year":"2018","unstructured":"Yoon, S.K., Youn, Y.S., Kim, J.G., Kim, S.D.: Design of DRAM-NAND flash hybrid main memory and Q-learning-based prefetching method. J. Supercomput. 74, 5293\u20135313 (2018)","journal-title":"J. Supercomput."},{"issue":"12","key":"26_CR17","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1587\/transinf.2021PAP0003","volume":"104","author":"K Ozawa","year":"2021","unstructured":"Ozawa, K., Hirofuchi, T., Takano, R., Sugaya, M.: Fogcached: a DRAM\/NVMM hybrid KVS server for edge computing. IEICE Trans. Inf. Syst. 104(12), 2089\u20132096 (2021)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"5","key":"26_CR18","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/TPDS.2015.2442980","volume":"27","author":"S Mittal","year":"2015","unstructured":"Mittal, S., Vetter, J.S.: A survey of software techniques for using non-volatile memories for storage and main memory systems. IEEE Trans. Parallel Distrib. Syst. 27(5), 1537\u20131550 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"26_CR19","unstructured":"Xia, F., Jiang, D., Xiong, J., Sun, N.: HiKV: a hybrid index Key-Value store for DRAM-NVM memory systems. In: 2017 USENIX Annual Technical Conference (USENIX ATC 17), pp. 349\u2013362. USENIX Association, Santa Clara, CA (2017)"},{"issue":"2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/LCA.2022.3197654","volume":"21","author":"M Kim","year":"2022","unstructured":"Kim, M., Kim, B.S., Lee, E., Lee, S.: A case study of a dram-nvm hybrid memory allocator for key-value stores. IEEE Comput. Archit. Lett. 21(2), 81\u201384 (2022)","journal-title":"IEEE Comput. Archit. Lett."},{"key":"26_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102547","volume":"128","author":"Y Li","year":"2022","unstructured":"Li, Y., et al.: A multi-hashing index for hybrid dram-nvm memory systems. J. Syst. Architect. 128, 102547 (2022)","journal-title":"J. Syst. Architect."},{"issue":"10","key":"26_CR22","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/71.963420","volume":"12","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M.: The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst. 12(10), 1094\u20131104 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"26_CR23","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1109\/TNSM.2018.2865543","volume":"15","author":"S Wang","year":"2018","unstructured":"Wang, S., Luo, J., Wong, W.S.: Improved power of two choices for fat-tree routing. IEEE Trans. Netw. Serv. Manage. 15(4), 1706\u20131719 (2018)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"26_CR24","unstructured":"Wang, A., et al.: InfiniCache: exploiting ephemeral serverless functions to build a cost-effective memory cache. In: Proceedings of the 18th USENIX Conference on File and Storage Technologies, pp. 267\u2013282 (2020)"},{"key":"26_CR25","unstructured":"Rashmi, K., Chowdhury, M., Kosaian, J., Stoica, I., Ramchandran, K.: EC-Cache: load-balanced, low-latency cluster caching with online erasure coding. In: Osdi. vol. 16, pp. 401\u2013417 (2016)"},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.jpdc.2022.05.004","volume":"167","author":"M Zhang","year":"2022","unstructured":"Zhang, M., Wang, Q., Shen, Z., Lee, P.P.: POCache: toward robust and configurable straggler tolerance with parity-only caching. J. Parallel Distrib. Comput. 167, 157\u2013172 (2022)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"26_CR27","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/792538.792546","volume":"50","author":"B V\u00f6cking","year":"2003","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. J. ACM (JACM) 50(4), 568\u2013589 (2003)","journal-title":"J. ACM (JACM)"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: the heavily loaded case. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 745\u2013754 (2000)","DOI":"10.1145\/335305.335411"},{"key":"26_CR29","unstructured":"Li, J., Nelson, J., Michael, E., Jin, X., Ports, D.R.: Pegasus: tolerating skewed workloads in distributed storage with $$\\{$$In-Network$$\\}$$ coherence directories. In: 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20), pp. 387\u2013406 (2020)"},{"key":"26_CR30","unstructured":"Takruri, H., Kettaneh, I., Alquraan, A., Al-Kiswany, S.: $$\\{$$FLAIR$$\\}$$: Accelerating reads with $$\\{$$Consistency-Aware$$\\}$$ network routing. In: 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20), pp. 723\u2013737 (2020)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0859-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:10:17Z","timestamp":1708963817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0859-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708581","9789819708598"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0859-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}