{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:02:10Z","timestamp":1772787730019,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11390-022-2118-5","type":"journal-article","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T02:02:45Z","timestamp":1660356165000},"page":"763-778","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["SMART: Speedup Job Completion Time by Scheduling Reduce Tasks"],"prefix":"10.1007","volume":"37","author":[{"given":"Jia-Qing","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ze-Hao","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan-Yuan","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-Wen","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wan-Chun","family":"Dou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gui-Hai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nai","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao-Ran","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"key":"2118_CR1","unstructured":"Grandl R, Kandula S, Rao S, Akella A, Kulkarni J. Graphene: Packing and dependency-aware scheduling for data-parallel clusters. In Proc. the 12th USENIX Conference on Operating Systems Design and Implementation, Nov. 2016, pp.81-97."},{"key":"2118_CR2","doi-asserted-by":"crossref","unstructured":"Chang H, Kodialam M, Kompella R R, Lakshman T V, Lee M, Mukherjee S. Scheduling in MapReduce-like systems for fast completion time. In Proc. the 30th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, Apr. 2011, pp.3074-3082. DOI: 10.1109\/IN-FCOM.2011.5935152.","DOI":"10.1109\/INFCOM.2011.5935152"},{"issue":"4","key":"2118_CR3","doi-asserted-by":"publisher","first-page":"2210","DOI":"10.1109\/TNET.2015.2458892","volume":"24","author":"Y Peng","year":"2016","unstructured":"Peng Y, Chen K, Wang G, Bai W, Zhao Y, Wang H, Geng Y, Ma Z, Gu L. Towards comprehensive traffic forecasting in cloud computing: Design and application. IEEE\/ACM Transactions on Networking, 2016, 24(4): 2210-2222. DOI: https:\/\/doi.org\/10.1109\/TNET.2015.2458892.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2118_CR4","doi-asserted-by":"publisher","first-page":"111751","DOI":"10.1109\/ACCESS.2020.3002565","volume":"8","author":"I Ullah","year":"2020","unstructured":"Ullah I, Khan M S, Amir M, Kim J, Kim S M. LSTPD: Least slack time-based preemptive deadline constraint scheduler for Hadoop clusters. IEEE Access, 2020, 8: 111751-111762. DOI: https:\/\/doi.org\/10.1109\/ACCESS.2020.3002565.","journal-title":"IEEE Access"},{"key":"2118_CR5","doi-asserted-by":"publisher","unstructured":"Gao Y, Zhou Y, Zhou B, Shi L, Zhang J. Handling data skew in MapReduce cluster by using partition tuning. Journal of Healthcare Engineering, 2017, 2017: Article No. 1425102. DOI: https:\/\/doi.org\/10.1155\/2017\/1425102.","DOI":"10.1155\/2017\/1425102"},{"key":"2118_CR6","doi-asserted-by":"crossref","unstructured":"Hammoud M, Sakr M F. Locality-aware reduce task scheduling for MapReduce. In Proc. the 3rd IEEE International Conference on Cloud Computing Technology and Science, Nov. 29-Dec. 1, 2011, pp.570-576. DOI: 10.1109\/CloudCom.2011.87.","DOI":"10.1109\/CloudCom.2011.87"},{"issue":"1","key":"2118_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S. MapReduce: Simplified data processing on large clusters. Commun. ACM, 2008, 51(1): 107-113. DOI: https:\/\/doi.org\/10.1145\/1327452.1327492.","journal-title":"Commun. ACM"},{"key":"2118_CR8","unstructured":"Ahmad F, Lee S, Thottethodi M, Vijaykumar T. PUMA: Purdue MapReduce benchmarks suite. Technical Report, Purdue University, 2012. https:\/\/engineering.purdue.edu\/~puma\/puma.pdf, May 2022."},{"issue":"9","key":"2118_CR9","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham R L. Bounds for certain multiprocessing anomalies. The Bell System Technical Journal, 1966, 45(9): 1563-1581. DOI: https:\/\/doi.org\/10.1002\/j.1538-7305.1966.tb01709.x.","journal-title":"The Bell System Technical Journal"},{"key":"2118_CR10","doi-asserted-by":"crossref","unstructured":"Mosharaf C, Ion S. Coow: A networking abstraction for cluster applications. In Proc. the 11th ACM Workshop on Hot Topics in Networks, Oct. 2012, pp.31-36. DOI: 10.1145\/2390231.2390237.","DOI":"10.1145\/2390231.2390237"},{"key":"2118_CR11","doi-asserted-by":"crossref","unstructured":"Kwon Y, Balazinska M, Howe B, Rolia J. Skew-Tune: Mitigating skew in MapReduce applications. In Proc. the 2012 ACM SIGMOD International Conference on Management of Data, May 2012, pp.25-36. DOI: 10.1145\/2213836.2213840.","DOI":"10.1145\/2213836.2213840"},{"issue":"4","key":"2118_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1145\/2740070.2626315","volume":"44","author":"M Chowdhury","year":"2014","unstructured":"Chowdhury M, Zhong Y, Stoica I. Efficient coow scheduling with Varys. ACM SIGCOMM Comput. Commun. Rev., 2014, 44(4): 443-454. DOI: https:\/\/doi.org\/10.1145\/2740070.2626315.","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"2118_CR13","doi-asserted-by":"crossref","unstructured":"Chowdhury M, Stoica I. Efficient coow scheduling without prior knowledge. In Proc. the 2015 ACM Conference on Special Interest Group on Data Communication, Aug. 2015, pp.393-406. DOI: 10.1145\/2785956.2787480.","DOI":"10.1145\/2785956.2787480"},{"key":"2118_CR14","doi-asserted-by":"publisher","unstructured":"Mao H, Schwarzkopf M, Venkatakrishnan S B, Meng Z, Alizadeh M. Learning scheduling algorithms for data processing clusters. In Proc. the ACM Special Interest Group on Data Communication, Aug. 2019, pp.270-288. DOI: https:\/\/doi.org\/10.1145\/3341302.3342080.","DOI":"10.1145\/3341302.3342080"},{"key":"2118_CR15","doi-asserted-by":"crossref","unstructured":"Nguyen K, Wang K, Bu Y, Fang L, Hu J, Xu G. FACADE: A compiler and runtime for (almost) object-bounded big data applications. In Proc. the 20th International Conference on Architectural Support for Programming Languages and Operating Systems, Mar. 2015, pp.675-690. DOI: 10.1145\/2694344.2694345.","DOI":"10.1145\/2694344.2694345"},{"key":"2118_CR16","unstructured":"Nguyen K, Fang L, Xu G, Demsky B, Lu S, Alamian S, Mutlu O. Yak: A high-performance big-data-friendly garbage collector. In Proc. the 12th USENIX Symposium on Operating Systems Design and Implementation, November 2016, pp.349-365."},{"key":"2118_CR17","doi-asserted-by":"publisher","unstructured":"Rasmussen A, Lam V T, Conley M, Porter G, Kapoor R, Vahdat A. Themis: An I\/O-efficient MapReduce. In Proc. the 3rd ACM Symposium on Cloud Computing, Oct. 2012, Article No. 13. DOI: https:\/\/doi.org\/10.1145\/2391229.2391242.","DOI":"10.1145\/2391229.2391242"},{"key":"2118_CR18","doi-asserted-by":"publisher","unstructured":"Rao S, Ramakrishnan R, Silberstein A, Ovsiannikov M, Reeves D. Sailfish: A framework for large scale data processing. In Proc. the 3rd ACM Symposium on Cloud Computing, Oct. 2012, Article No. 4. DOI: https:\/\/doi.org\/10.1145\/2391229.2391233.","DOI":"10.1145\/2391229.2391233"},{"key":"2118_CR19","doi-asserted-by":"publisher","unstructured":"Zhang H, Cho B, Seyfe E, Ching A, Freedman M J. Riffle: Optimized shuffle service for large-scale data analytics. In Proc. the 13th EuroSys Conference, Apr. 2018, Article No. 43. DOI: https:\/\/doi.org\/10.1145\/3190508.3190534.","DOI":"10.1145\/3190508.3190534"},{"key":"2118_CR20","doi-asserted-by":"crossref","unstructured":"Zaharia M, Borthakur D, Sarma S J, Elmeleegy K, Shenker S, Stoica I. Delay scheduling: A simple technique for achieving locality and fairness in cluster scheduling. In Proc. the 5th European Conference on Computer Systems, Apr. 2010, pp.265-278. DOI: 10.1145\/1755913.1755940.","DOI":"10.1145\/1755913.1755940"},{"key":"2118_CR21","doi-asserted-by":"crossref","unstructured":"Ibrahim S, Jin H, Lu L, He B, Antoniu G, Wu S. Maestro: Replica-aware map scheduling for MapReduce. In Proc. the 12th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing, May 2012, pp.435-442. DOI: 10.1109\/CCGrid.2012.122.","DOI":"10.1109\/CCGrid.2012.122"},{"issue":"44","key":"2118_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.future.2014.08.011","volume":"43","author":"Z Tang","year":"2015","unstructured":"Tang Z, Jiang L, Zhou J, Li K, Li K. A self-adaptive scheduling algorithm for reduce start time. Future Generation Computer Systems, 2015, 43\/44: 51-60. DOI: https:\/\/doi.org\/10.1016\/j.future.2014.08.011.","journal-title":"Future Generation Computer Systems"},{"key":"2118_CR23","doi-asserted-by":"crossref","unstructured":"Ibrahim S, Jin H, Lu L, Wu S, He B, Qi L. LEEN: Locality\/fairness-aware key partitioning for MapReduce in the cloud. In Proc. the 2nd IEEE International Conference on Cloud Computing Technology and Science, Nov. 30-Dec. 3, 2010, pp.17-24. DOI: 10.1109\/CloudCom.2010.25.","DOI":"10.1109\/CloudCom.2010.25"},{"key":"2118_CR24","doi-asserted-by":"crossref","unstructured":"Tan J, Meng X, Zhang L. Coupling task progress for MapReduce resource-aware scheduling. In Proc. the 2013 IEEE INFOCOM, Apr. 2013, pp.1618-1626. DOI: 10.1109\/INFCOM.2013.6566958.","DOI":"10.1109\/INFCOM.2013.6566958"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-022-2118-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-022-2118-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-022-2118-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T02:12:26Z","timestamp":1660356746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-022-2118-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["2118"],"URL":"https:\/\/doi.org\/10.1007\/s11390-022-2118-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"27 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}