{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:11:02Z","timestamp":1740103862252,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T00:00:00Z","timestamp":1708905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T00:00:00Z","timestamp":1708905600000},"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":["J Sched"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10951-023-00803-8","type":"journal-article","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T12:02:45Z","timestamp":1708948965000},"page":"183-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A scheduling framework for distributed key-value stores and its application to tail latency minimization"],"prefix":"10.1007","volume":"27","author":[{"given":"Sonia","family":"Ben Mokhtar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5458-0982","authenticated-orcid":false,"given":"Louis-Claude","family":"Canon","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Dugois","sequence":"additional","affiliation":[]},{"given":"Loris","family":"Marchal","sequence":"additional","affiliation":[]},{"given":"Etienne","family":"Rivi\u00e8re","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,26]]},"reference":[{"issue":"6","key":"803_CR1","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.orl.2004.10.006","volume":"33","author":"C Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C., & Mastrolilli, M. (2005). On-line scheduling to minimize max flow time: An optimal preemptive algorithm. Operations Research Letters, 33(6), 597\u2013602.","journal-title":"Operations Research Letters"},{"issue":"2","key":"803_CR2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00453-015-0082-y","volume":"77","author":"S Anand","year":"2017","unstructured":"Anand, S., Bringmann, K., Friedrich, T., Garg, N., & Kumar, A. (2017). Minimizing maximum (weighted) flow-time on related and unrelated machines. Algorithmica, 77(2), 515\u2013536.","journal-title":"Algorithmica"},{"issue":"1","key":"803_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/2318857.2254766","volume":"40","author":"B Atikoglu","year":"2012","unstructured":"Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., & Paleczny, M. (2012). Workload analysis of a large-scale key-value store. ACM SIGMETRICS Performance Evaluation Review, 40(1), 53\u201364.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"issue":"5","key":"803_CR4","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1137\/S009753970037446X","volume":"31","author":"B Awerbuch","year":"2002","unstructured":"Awerbuch, B., Azar, Y., Leonardi, S., & Regev, O. (2002). Minimizing the flow time without migration. SIAM Journal on Computing, 31(5), 1370\u20131382.","journal-title":"SIAM Journal on Computing"},{"key":"803_CR5","unstructured":"Baker, K. R. (1974). Introduction to sequencing and scheduling. Wiley."},{"issue":"4","key":"803_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3380905","volume":"36","author":"O Balmau","year":"2020","unstructured":"Balmau, O., Dinu, F., Zwaenepoel, W., Gupta, K., Chandhiramoorthi, R., & Didona, D. (2020). Silk+ preventing latency spikes in log-structured merge key-value stores running heterogeneous workloads. ACM Transactions on Computer Systems, 36(4), 1\u201327.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"3","key":"803_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.orl.2004.07.008","volume":"33","author":"N Bansal","year":"2005","unstructured":"Bansal, N. (2005). Minimizing flow time on a constant number of machines with preemption. Operations Research Letters, 33(3), 267\u2013273.","journal-title":"Operations Research Letters"},{"issue":"1","key":"803_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2016.v012a014","volume":"12","author":"N Bansal","year":"2016","unstructured":"Bansal, N., & Cloostermans, B. (2016). Minimizing maximum flow-time on related machines. Theory of Computing, 12(1), 1\u201314.","journal-title":"Theory of Computing"},{"issue":"4","key":"803_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1290672.1290676","volume":"3","author":"N Bansal","year":"2007","unstructured":"Bansal, N., & Dhamdhere, K. (2007). Minimizing weighted flow time. ACM Transactions on Algorithms, 3(4), 39.","journal-title":"ACM Transactions on Algorithms"},{"key":"803_CR10","doi-asserted-by":"crossref","unstructured":"Bansal, N., & Kulkarni, J. (2015). Minimizing flow-time on unrelated machines. In Proceedings of the forty-seventh annual acm symposium on theory of computing (pp. 851\u2013860).","DOI":"10.1145\/2746539.2746601"},{"key":"803_CR11","doi-asserted-by":"crossref","unstructured":"Bansal, N., & Pruhs, K. (2003). Server scheduling in the $$l_p$$ norm: a rising tide lifts all boat. In Proceedings of the thirty-fifth annual acm symposium on theory of computing (pp. 242\u2013250).","DOI":"10.1145\/780579.780580"},{"issue":"2","key":"803_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10951-006-0006-4","volume":"10","author":"P Baptiste","year":"2007","unstructured":"Baptiste, P., Brucker, P., Chrobak, M., D\u00fcrr, C., Kravchenko, S. A., & Sourd, F. (2007). The complexity of mean flow time scheduling problems with release times. Journal of Scheduling, 10(2), 139\u2013146.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"803_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/1008731.1008732","volume":"51","author":"L Becchetti","year":"2004","unstructured":"Becchetti, L., & Leonardi, S. (2004). Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. Journal of the ACM, 51(4), 517\u2013539.","journal-title":"Journal of the ACM"},{"key":"803_CR14","unstructured":"Bender, M.A., Chakrabarti, S., Muthukrishnan, S. (1998). Flow and stretch metrics for scheduling continuous job streams. In ACM-SIAM symposium on discrete algorithms (pp. 270\u2013279)."},{"key":"803_CR15","doi-asserted-by":"crossref","unstructured":"Ben\u00a0Mokhtar, S., Canon, L. C., Dugois, A., Marchal, L., Rivi\u00e8re, E. (2021). Taming tail latency in key-value stores: a scheduling perspective. In European conference on parallel processing (pp. 136\u2013150).","DOI":"10.1007\/978-3-030-85665-6_9"},{"key":"803_CR16","doi-asserted-by":"crossref","unstructured":"Benoit, A., Elghazi, R., Robert, Y. (2021). Max-stretch minimization on an edge-cloud platform. In 2021 ieee international parallel and distributed processing symposium (pp. 766\u2013775).","DOI":"10.1109\/IPDPS49936.2021.00086"},{"key":"803_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1018950911030","volume":"70","author":"P Brucker","year":"1997","unstructured":"Brucker, P., Jurisch, B., & Kr\u00e4mer, A. (1997). Complexity of scheduling problems with multi-purpose machines. Annals of Operations Research, 70, 57\u201373.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"803_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10951-008-0063-y","volume":"11","author":"P Brucker","year":"2008","unstructured":"Brucker, P., & Kravchenko, S. A. (2008). Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling, 11(4), 229\u2013237.","journal-title":"Journal of Scheduling"},{"issue":"7","key":"803_CR19","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J Bruno","year":"1974","unstructured":"Bruno, J., Coffman, E. G., Jr., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), 382\u2013387.","journal-title":"Communications of the ACM"},{"key":"803_CR20","unstructured":"Brutlag, J. (2009). Speed matters for google web search."},{"key":"803_CR21","unstructured":"Carlson, J. L. (2013). Redis in action. Manning Publications Co."},{"key":"803_CR22","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Zhu, A. (2001). Algorithms for minimizing weighted flow time. In Proceedings of the thirty-third annual acm symposium on theory of computing (pp. 84\u201393).","DOI":"10.1145\/380752.380778"},{"key":"803_CR23","unstructured":"Chodorow, K. (2013). Mongodb: the definitive guide: Powerful and scalable data storage. O\u2019Reilly."},{"key":"803_CR24","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jcss.2017.07.006","volume":"91","author":"AR Choudhury","year":"2018","unstructured":"Choudhury, A. R., Das, S., Garg, N., & Kumar, A. (2018). Rejecting jobs to minimize load and maximum flow-time. Journal of Computer and System Sciences, 91, 42\u201368.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"803_CR25","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. (2013). The tail at scale. Communications of the ACM, 56(2), 74\u201380.","journal-title":"Communications of the ACM"},{"issue":"6","key":"803_CR26","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/1323293.1294281","volume":"41","author":"G DeCandia","year":"2007","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., & Vogels, W. (2007). Dynamo: Amazon\u2019s highly available key-value store. ACM SIGOPS Operating Systems Review, 41(6), 205\u2013220.","journal-title":"ACM SIGOPS Operating Systems Review"},{"key":"803_CR27","doi-asserted-by":"crossref","unstructured":"Delgado, P., Didona, D., Dinu, F., Zwaenepoel, W. (2016). Job-aware scheduling in eagle: Divide and stick to your probes. In Proceedings of the seventh acm symposium on cloud computing (pp. 497\u2013509).","DOI":"10.1145\/2987550.2987563"},{"key":"803_CR28","unstructured":"Delgado, P., Dinu, F., Kermarrec, A. M., Zwaenepoel, W. (2015). Hawk: Hybrid datacenter scheduling. In 2015 USENIX annual technical conference (pp. 499\u2013510)."},{"key":"803_CR29","unstructured":"Didona, D., & Zwaenepoel, W. (2019). Size-aware sharding for improving tail latencies in in-memory key-value stores. In 16th USENIX symposium on networked systems design and implementation (pp. 79\u201394)."},{"key":"803_CR30","doi-asserted-by":"crossref","unstructured":"Dutot, P. F., Saule, E., Srivastav, A., Trystram, D. (2016). Online non-preemptive scheduling to optimize max stretch on a single machine. In Computing and combinatorics - 22nd international conference (vol. 9797, pp. 483\u2013495).","DOI":"10.1007\/978-3-319-42634-1_39"},{"key":"803_CR31","doi-asserted-by":"crossref","unstructured":"Feitelson, D. G. (2015). Workload modeling for computer systems performance evaluation. Cambridge University Press.","DOI":"10.1017\/CBO9781139939690"},{"key":"803_CR32","doi-asserted-by":"crossref","unstructured":"Garg, N., & Kumar, A. (2007). Minimizing average flow-time: Upper and lower bounds. In 48th annual ieee symposium on foundations of computer science (focs\u201907) (pp. 603\u2013613).","DOI":"10.1109\/FOCS.2007.52"},{"issue":"2","key":"803_CR33","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0166-218X(93)90087-5","volume":"47","author":"LA Hall","year":"1993","unstructured":"Hall, L. A. (1993). A note on generalizing the maximum lateness criterion for scheduling. Discrete Applied Mathematics, 47(2), 129\u2013137.","journal-title":"Discrete Applied Mathematics"},{"key":"803_CR34","doi-asserted-by":"crossref","unstructured":"Jaiman, V., Ben\u00a0Mokhtar, S., Qu\u00e9ma, V., Chen, L.Y., Rivi\u00e8re, E. (2018). H\u00e9ron: Taming tail latencies in key-value stores under heterogeneous workloads. In 37th symposium on reliable distributed systems (pp. 191\u2013200).","DOI":"10.1109\/SRDS.2018.00030"},{"key":"803_CR35","doi-asserted-by":"crossref","unstructured":"Jaiman, V., Mokhtar, S.B., Rivi\u00e8re, E. (2020). TailX: Scheduling heterogeneous multiget queries to improve tail latencies in key-value stores. In Ifip international conference on distributed applications and interoperable systems (pp. 73\u201392).","DOI":"10.1007\/978-3-030-50323-9_5"},{"key":"803_CR36","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.jpdc.2019.03.017","volume":"130","author":"W Jiang","year":"2019","unstructured":"Jiang, W., Xie, H., Zhou, X., Fang, L., & Wang, J. (2019). Haste makes waste: The on-off algorithm for replica selection in key-value stores. Journal of Parallel and Distributed Computing, 130, 80\u201390.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"803_CR37","doi-asserted-by":"crossref","unstructured":"Jose, J., Subramoni, H., Luo, M., Zhang, M., Huang, J., Wasi-ur Rahman, M. (2011). Memcached design on high performance rdma capable interconnects. In International conference on parallel processing (pp. 743\u2013752).","DOI":"10.1109\/ICPP.2011.37"},{"issue":"4","key":"803_CR38","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., & Pruhs, K. (2000). Speed is as powerful as clairvoyance. Journal of the ACM, 47(4), 617\u2013643.","journal-title":"Journal of the ACM"},{"issue":"4","key":"803_CR39","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/S0097539796305778","volume":"28","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Tautenhahn, T., & Woeginger, G. (1999). Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAM Journal on Computing, 28(4), 1155\u20131166.","journal-title":"SIAM Journal on Computing"},{"issue":"10","key":"803_CR40","doi-asserted-by":"publisher","first-page":"2816","DOI":"10.1016\/j.cor.2008.12.010","volume":"36","author":"SA Kravchenko","year":"2009","unstructured":"Kravchenko, S. A., & Werner, F. (2009). Preemptive scheduling on uniform machines to minimize mean flow time. Computers & Operations Research, 36(10), 2816\u20132821.","journal-title":"Computers & Operations Research"},{"key":"803_CR41","doi-asserted-by":"crossref","unstructured":"Labetoulle, J., Lawler, E. L., Lenstra, J. K., Kan, A. R. (1984). Preemptive scheduling of uniform machines subject to release dates. In Progress in combinatorial optimization (pp. 245\u2013261).","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"issue":"2","key":"803_CR42","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., & Malik, P. (2010). Cassandra: a decentralized structured storage system. ACM SIGOPS Operating Systems Review, 44(2), 35\u201340.","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"4","key":"803_CR43","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/322092.322101","volume":"25","author":"EL Lawler","year":"1978","unstructured":"Lawler, E. L., & Labetoulle, J. (1978). On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM, 25(4), 612\u2013619.","journal-title":"Journal of the ACM"},{"issue":"1","key":"803_CR44","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10479-012-1271-6","volume":"204","author":"K Lee","year":"2013","unstructured":"Lee, K., Leung, J. Y., & Pinedo, M. L. (2013). Makespan minimization in online scheduling with machine eligibility. Annals of Operations Research, 204(1), 189\u2013222.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"803_CR45","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10951-008-0078-4","volume":"11","author":"A Legrand","year":"2008","unstructured":"Legrand, A., Su, A., & Vivien, F. (2008). Minimizing the stretch when scheduling flows of divisible requests. Journal of Scheduling, 11(5), 381\u2013404.","journal-title":"Journal of Scheduling"},{"key":"803_CR46","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. Studies in integer programming, 1, 343\u2013362.","journal-title":"Studies in integer programming"},{"issue":"6","key":"803_CR47","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.jcss.2006.10.018","volume":"73","author":"S Leonardi","year":"2007","unstructured":"Leonardi, S., & Raz, D. (2007). Approximating total flow time on parallel machines. Journal of Computer and System Sciences, 73(6), 875\u2013891.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"803_CR48","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.ijpe.2008.09.003","volume":"116","author":"JYT Leung","year":"2008","unstructured":"Leung, J. Y. T., & Li, C. L. (2008). Scheduling with processing set restrictions: A survey. International Journal of Production Economics, 116(2), 251\u2013262.","journal-title":"International Journal of Production Economics"},{"key":"803_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijpe.2014.09.038","volume":"175","author":"JYT Leung","year":"2016","unstructured":"Leung, J. Y. T., & Li, C. L. (2016). Scheduling with processing set restrictions: A literature update. International Journal of Production Economics, 175, 1\u201311.","journal-title":"International Journal of Production Economics"},{"key":"803_CR50","doi-asserted-by":"crossref","unstructured":"Li, J., Sharma, N. K., Ports, D. R., Gribble, S. D. (2014). Tales of the tail: Hardware, OS, and application-level sources of tail latency. In Acm symposium on cloud computing (pp. 1\u201314).","DOI":"10.1145\/2670979.2670988"},{"key":"803_CR51","unstructured":"Lucarelli, G., Moseley, B., Thang, N. K., Srivastav, A., Trystram, D. (2019). Online non-preemptive scheduling to minimize maximum weighted flow-time on related machines. In 39th IARCS annual conference on foundations of software technology and theoretical computer science (Vol.\u00a0150, pp. 24:1\u201324:12)."},{"issue":"2","key":"803_CR52","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jpdc.1999.1581","volume":"59","author":"M Maheswaran","year":"1999","unstructured":"Maheswaran, M., Ali, S., Siegel, H. J., Hensgen, D., & Freund, R. F. (1999). Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, 59(2), 107\u2013131.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"02","key":"803_CR53","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0129054104002480","volume":"15","author":"M Mastrolilli","year":"2004","unstructured":"Mastrolilli, M. (2004). Scheduling to minimize max flow time: Off-line and on-line algorithms. International Journal of Foundations of Computer Science, 15(02), 385\u2013401.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"803_CR54","doi-asserted-by":"crossref","unstructured":"Moseley, B., Pruhs, K., Stein, C. (2013). The complexity of scheduling for p-norms of flow and stretch. In International conference on integer programming and combinatorial optimization (pp. 278\u2013289).","DOI":"10.1007\/978-3-642-36694-9_24"},{"key":"803_CR55","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Rajaraman, R., Shaheen, A., Gehrke, J. E. (1999). Online scheduling to minimize average stretch. In 40th annual symposium on foundations of computer science (pp. 433\u2013443).","DOI":"10.1109\/SFFCS.1999.814615"},{"key":"803_CR56","doi-asserted-by":"crossref","unstructured":"Reda, W., Canini, M., Suresh, L., Kosti\u0107, D., Braithwaite, S. (2017). Rein: Taming tail latency in key-value stores via multiget scheduling. In 12th european conference on computer systems (pp. 95\u2013110).","DOI":"10.1145\/3064176.3064209"},{"issue":"4","key":"803_CR57","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.jpdc.2011.12.007","volume":"72","author":"E Saule","year":"2012","unstructured":"Saule, E., Bozda\u011f, D., & \u00c7ataly\u00fcrek, \u00dc. V. (2012). Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks. Journal of Parallel and Distributed Computing, 72(4), 489\u2013503.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"803_CR58","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/0212018","volume":"12","author":"B Simons","year":"1983","unstructured":"Simons, B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing, 12(2), 294\u2013299.","journal-title":"SIAM Journal on Computing"},{"key":"803_CR59","doi-asserted-by":"crossref","unstructured":"Sitters, R. (2001). Two np-hardness results for preemptive minsum scheduling of unrelated parallel machines. In International conference on integer programming and combinatorial optimization (pp. 396\u2013405).","DOI":"10.1007\/3-540-45535-3_31"},{"key":"803_CR60","unstructured":"Suresh, L., Canini, M., Schmid, S., Feldmann, A. (2015). C3: Cutting tail latency in cloud data stores via adaptive replica selection. In 12th USENIX symposium on networked systems design and implementation (pp. 513\u2013527)."},{"key":"803_CR61","doi-asserted-by":"crossref","unstructured":"Vulimiri, A., Godfrey, P. B., Mittal, R., Sherry, J., Ratnasamy, S., Shenker, S. (2013). Low latency via redundancy. In 9th acm conference on emerging networking experiments and technologies (pp. 283\u2013294).","DOI":"10.1145\/2535372.2535392"},{"key":"803_CR62","unstructured":"Wu, Z., Yu, C., Madhyastha, H. V. (2015). Costlo: Cost-effective redundancy for lower latency variance on cloud storage services. In 12th USENIX symposium on networked systems design and implementation (pp. 543\u2013557)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00803-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00803-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00803-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T12:05:03Z","timestamp":1712491503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00803-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,26]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["803"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00803-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2024,2,26]]},"assertion":[{"value":"19 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}