{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:40:30Z","timestamp":1756384830676,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030503222"},{"type":"electronic","value":"9783030503239"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-50323-9_5","type":"book-chapter","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T23:02:48Z","timestamp":1591570968000},"page":"73-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["TailX: Scheduling Heterogeneous Multiget Queries to Improve Tail Latencies in Key-Value Stores"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0272-2993","authenticated-orcid":false,"given":"Vikas","family":"Jaiman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2821-7714","authenticated-orcid":false,"given":"Sonia","family":"Ben Mokhtar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4133-394X","authenticated-orcid":false,"given":"Etienne","family":"Rivi\u00e8re","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,8]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1109\/TNSM.2019.2916877","volume":"16","author":"AO Al-Abbasi","year":"2019","unstructured":"Al-Abbasi, A.O., Aggarwal, V., Lan, T.: Ttloc: taming tail latency for erasure-coded cloud storage systems. IEEE Trans. Netw. Serv. Manag. 16(4), 1609\u20131623 (2019)","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alizadeh, M., et al.: pFabric: minimal near-optimal datacenter transport. In: SIGCOMM (2013)","DOI":"10.1145\/2486001.2486031"},{"key":"5_CR3","unstructured":"Ananthanarayanan, G., et al.: Pacman: coordinated memory caching for parallel jobs. In: NSDI (2012)"},{"key":"5_CR4","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: SIGMETRICS (2012)","DOI":"10.1145\/2254756.2254766"},{"key":"5_CR5","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-04519-1_1","volume-title":"Cloud Computing and Services Science","author":"D Balouek","year":"2013","unstructured":"Balouek, D., et al.: Adding Virtualization capabilities to the Grid\u20195000 testbed. In: Ivanov, I.I., van Sinderen, M., Leymann, F., Shan, T. (eds.) CLOSER 2012. CCIS, vol. 367, pp. 3\u201320. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-04519-1_1"},{"issue":"7","key":"5_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Stoica, I.: Efficient coflow scheduling without prior knowledge. In: SIGCOMM (2015)","DOI":"10.1145\/2785956.2787480"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Zaharia, M., Ma, J., Jordan, M.I., Stoica, I.: Managing data transfers in computer clusters with orchestra. In: SIGCOMM (2011)","DOI":"10.1145\/2018436.2018448"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Zhong, Y., Stoica, I.: Efficient coflow scheduling with varys. In: SIGCOMM (2014)","DOI":"10.1145\/2619239.2626315"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: SoCC (2010)","DOI":"10.1145\/1807128.1807152"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/2408776.2408794","volume":"56","author":"J Dean","year":"2013","unstructured":"Dean, J., Barroso, L.A.: The tail at scale. Commun. ACM 56(2), 74\u201380 (2013)","journal-title":"Commun. ACM"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Delgado, P., Didona, D., Dinu, F., Zwaenepoel, W.: Job-aware scheduling in Eagle: divide and stick to your probes. In: SoCC (2016)","DOI":"10.1145\/2987550.2987563"},{"key":"5_CR13","unstructured":"Delgado, P., Dinu, F., Kermarrec, A.M., Zwaenepoel, W.: Hawk: hybrid datacenter scheduling. In: USENIX ATC (2015)"},{"key":"5_CR14","unstructured":"Didona, D., Zwaenepoel, W.: Size-aware sharding for improving tail latencies in in-memory key-value stores. In: NSDI (2019)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Dogar, F.R., Karagiannis, T., Ballani, H., Rowstron, A.: Decentralized task-aware scheduling for data center networks. In: SIGCOMM (2014)","DOI":"10.1145\/2619239.2626322"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Enberg, P., Rao, A., Tarkoma, S.: The impact of thread-per-core architecture on application tail latency. In: ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) (2019)","DOI":"10.1109\/ANCS.2019.8901874"},{"key":"5_CR17","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M.: Memc3: compact and concurrent memcache with dumber caching and smarter hashing. In: NSDI (2013)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Han, S., Lee, S., Hahn, S.S., Kim, J.: SyncGC: a synchronized garbage collection technique for reducing tail latency in Cassandra. In: Proceedings of the 9th Asia-Pacific Workshop on Systems, APSys (2018)","DOI":"10.1145\/3265723.3265737"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Haque, M.E., Eom, Y.H., He, Y., Elnikety, S., Bianchini, R., McKinley, K.S.: Few-to-many: incremental parallelism for reducing tail latency in interactive services. In: ASPLOS (2015)","DOI":"10.1145\/2694344.2694384"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Jaiman, V., Mokhtar, S.B., Qu\u00e9ma, V., Chen, L.Y., Rivi\u00e8re, E.: H\u00e9ron: taming tail latencies in key-value stores under heterogeneous workloads. In: SRDS (2018)","DOI":"10.1109\/SRDS.2018.00030"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Jalaparti, V., Bodik, P., Kandula, S., Menache, I., Rybalkin, M., Yan, C.: Speeding up distributed request-response workflows. In: SIGCOMM (2013)","DOI":"10.1145\/2486001.2486028"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Jeon, M., He, Y., Kim, H., Elnikety, S., Rixner, S., Cox, A.L.: TPC: target-driven parallelism combining prediction and correction to reduce tail latency in interactive services. In: ASPLOS (2016)","DOI":"10.1145\/2872362.2872370"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Jeon, M., et al.: Predictive parallelization: taming tail latencies in web search. In: SIGIR (2014)","DOI":"10.1145\/2600428.2609572"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.is.2019.04.007","volume":"83","author":"W Jiang","year":"2019","unstructured":"Jiang, W., Xie, H., Zhou, X., Fang, L., Wang, J.: Understanding and improvement of the selection of replica servers in key-value stores. Inf. Syst. 83, 218\u2013228 (2019)","journal-title":"Inf. Syst."},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. SIGOPS Oper. Syst. Rev. 44(2), 35\u201340 (2010)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"5_CR26","unstructured":"Li, Z.L., et al.: Metis: robustly tuning tail latencies of cloud systems. In: USENIX ATC (2018)"},{"key":"5_CR27","unstructured":"Lim, H., Han, D., Andersen, D.G., Kaminsky, M.: Mica: a holistic approach to fast in-memory key-value storage. In: NSDI (2014)"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Misra, P.A., Borge, M.F., Goiri, I.N., Lebeck, A.R., Zwaenepoel, W., Bianchini, R.: Managing tail latency in datacenter-scale file systems under production constraints. In: EuroSys (2019)","DOI":"10.1145\/3302424.3303973"},{"issue":"10","key":"5_CR29","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."},{"key":"5_CR30","unstructured":"MongoDB. https:\/\/www.mongodb.com\/"},{"key":"5_CR31","unstructured":"Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (1993)"},{"key":"5_CR32","unstructured":"Nishtala, R., et al.: Scaling memcache at Facebook. In: NSDI (2013)"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Ousterhout, K., Wendell, P., Zaharia, M., Stoica, I.: Sparrow: distributed, low latency scheduling. In: SOSP (2013)","DOI":"10.1145\/2517349.2522716"},{"key":"5_CR34","unstructured":"Partitioners. https:\/\/docs.datastax.com\/en\/cassandra\/3.0\/cassandra\/architecture\/archPartitionerAbout.html"},{"key":"5_CR35","unstructured":"Reda, W., Canini, M., Suresh, L., Kosti\u0107, D., Braithwaite, S.: Rein: taming tail latency in key-value stores via multiget scheduling. In: EuroSys (2017)"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Schwarzkopf, M., Konwinski, A., Abd-El-Malek, M., Wilkes, J.: Omega: flexible, scalable schedulers for large compute clusters. In: EuroSys (2013)","DOI":"10.1145\/2465351.2465386"},{"key":"5_CR37","unstructured":"Suresh, L., Canini, M., Schmid, S., Feldmann, A.: C3: cutting tail latency in cloud data stores via adaptive replica selection. In: NSDI (2015)"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Vulimiri, A., Godfrey, P.B., Mittal, R., Sherry, J., Ratnasamy, S., Shenker, S.: Low latency via redundancy. In: CoNEXT (2013)","DOI":"10.1145\/2535372.2535392"},{"key":"5_CR39","unstructured":"Williams, B.: Dynamic snitching in Cassandra: past, present, and future (2012). http:\/\/www.datastax.com\/dev\/blog\/dynamic-snitching-in-cassandra-past-present-and-future"}],"container-title":["Lecture Notes in Computer Science","Distributed Applications and Interoperable Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50323-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T23:03:00Z","timestamp":1717801380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50323-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030503222","9783030503239"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50323-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Distributed Applications and Interoperable Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valletta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dais2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2020\/dais","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","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":"10","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":"2","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":"59% - 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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}