{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:12:57Z","timestamp":1744215177778,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Ministry of Science and ICT (MIST), South Korea, through the Information Technology Research Center"},{"DOI":"10.13039\/501100001321","name":"Institute for Information and Communication Technology Planning and Evaluation","doi-asserted-by":"publisher","award":["IITP-2019-2018-0-01426"],"award-info":[{"award-number":["IITP-2019-2018-0-01426"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Korea Government","doi-asserted-by":"publisher","award":["2019R1F1A1059125"],"award-info":[{"award-number":["2019R1F1A1059125"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3002565","type":"journal-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T22:23:11Z","timestamp":1592259791000},"page":"111751-111762","source":"Crossref","is-referenced-by-count":13,"title":["LSTPD: Least Slack Time-Based Preemptive Deadline Constraint Scheduler for Hadoop Clusters"],"prefix":"10.1109","volume":"8","author":[{"given":"Ihsan","family":"Ullah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3238-0434","authenticated-orcid":false,"given":"Muhammad Sajjad","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Amir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junsu","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Su Min","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08696-5_18"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxt118"},{"key":"ref33","first-page":"1","article-title":"Cost-minimizing preemptive scheduling of MapReduce workloads on hybrid clouds","author":"qiu","year":"2013","journal-title":"Proc IEEE\/ACM 21st Int Symp Qual Service (IWQoS)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SKG.2012.40"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.07.043"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16505-4_7"},{"journal-title":"Fundamentals of Queueing Theory","year":"2016","author":"gross","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/02664763.2010.484891"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1653-7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2012.96"},{"journal-title":"Hadoop Map Reduce Architecture and Example","year":"2020","author":"user","key":"ref10"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2014.08.065"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-3329-3_33"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29407-6_11"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GCC.2009.19"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2014.01.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2017.12.014"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WAINA.2013.194"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.690"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.01.012"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2943632"},{"journal-title":"CapacityScheduler Guide","year":"2015","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.09.001"},{"journal-title":"Fair Scheduler","year":"2017","key":"ref27"},{"key":"ref3","first-page":"366","article-title":"Simplifying MapReduce data processing","author":"shih","year":"2011","journal-title":"Proc 4th IEEE Int Conf Utility Cloud Comput"},{"journal-title":"Hadoop Big Data Processing","year":"2018","author":"revathi","key":"ref6"},{"journal-title":"Hod Scheduler","year":"2015","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2907018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.11.006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-016-1945-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-013-0489-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2927076"},{"key":"ref1","first-page":"185","article-title":"A new parallel and distributed approach for large scale images retrieval","author":"belarbi","year":"2017","journal-title":"Proc Int Conf Cloud Comput Technol Appl"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2015.01.001"},{"journal-title":"Introduction to Queueing Networks","year":"1998","author":"gelenbe","key":"ref22"},{"key":"ref21","article-title":"Uncertainty-aware online scheduling for real-time workflows in cloud service environment","author":"chen","year":"2018","journal-title":"IEEE Trans Services Comput"},{"journal-title":"TeraByte Sort on Apache Hadoop","year":"2008","author":"o\u2019malley","key":"ref42"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900288"},{"journal-title":"Apache Hadoop 3 2 1&#x2014;MapReduce Tutorial","year":"2020","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2878864"},{"key":"ref26","first-page":"912","article-title":"Least slack time rate first: An efficient scheduling algorithm for pervasive computing environment","volume":"17","author":"hwang","year":"2011","journal-title":"J UCS"},{"journal-title":"Benchmarking and Stress Testing An Hadoop Cluster with TeraSort TestDFSIO & Co","year":"2020","key":"ref43"},{"journal-title":"Earliest Deadline First Scheduling","year":"2017","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09117131.pdf?arnumber=9117131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:08:27Z","timestamp":1641949707000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9117131\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3002565","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}