{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T11:28:03Z","timestamp":1782646083812,"version":"3.54.5"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"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":["Computing"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00607-022-01122-0","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T21:03:35Z","timestamp":1665435815000},"page":"249-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Meddal: meeting deadlines and data locality via bin packing in cloud environment"],"prefix":"10.1007","volume":"105","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9094-7676","authenticated-orcid":false,"given":"Marzieh","family":"Malekimajd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,10]]},"reference":[{"key":"1122_CR1","doi-asserted-by":"crossref","unstructured":"Puthal D, Sahoo B, Mishra S, Swain S (2015) Cloud computing features, issues, and challenges: a big picture. IEEE, pp 116\u2013123","DOI":"10.1109\/CINE.2015.31"},{"issue":"4","key":"1122_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"AD Josep","year":"2010","unstructured":"Josep AD et al (2010) A view of cloud computing. Commun ACM 53(4):50","journal-title":"Commun ACM"},{"key":"1122_CR3","doi-asserted-by":"crossref","unstructured":"Mell P, Grance T (2011) The NIST definition of cloud computing. Technical Reports 800-145, National Institute of Standards and Technology (NIST). http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-145\/SP800-145.pdf","DOI":"10.6028\/NIST.SP.800-145"},{"issue":"12","key":"1122_CR4","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1109\/TPDS.2017.2726071","volume":"28","author":"M Xu","year":"2017","unstructured":"Xu M, Alamro S, Lan T, Subramaniam S (2017) CRED: cloud right-sizing with execution deadlines and data locality. IEEE Trans Parallel Distrib Syst 28(12):3389\u20133400","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1122_CR5","doi-asserted-by":"crossref","unstructured":"Shi S, Wu C, Li Z (2015) Cost-minimizing online VM purchasing for application service providers with arbitrary demands. pp 146\u2013154","DOI":"10.1109\/CLOUD.2015.29"},{"issue":"2","key":"1122_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10723-021-09548-0","volume":"19","author":"A Tarafdar","year":"2021","unstructured":"Tarafdar A, Debnath M, Khatua S, Das RK (2021) Energy and makespan aware scheduling of deadline sensitive tasks in the cloud environment. J Grid Comput 19(2):1\u201325","journal-title":"J Grid Comput"},{"issue":"2","key":"1122_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10723-015-9359-2","volume":"14","author":"S Singh","year":"2016","unstructured":"Singh S, Chana I (2016) A survey on resource scheduling in cloud computing: issues and challenges. J Grid Comput 14(2):217\u2013264","journal-title":"J Grid Comput"},{"issue":"4","key":"1122_CR8","doi-asserted-by":"publisher","first-page":"63:1","DOI":"10.1145\/2788397","volume":"47","author":"ZH Zhan","year":"2015","unstructured":"Zhan ZH et al (2015) Cloud computing resource scheduling and a survey of its evolutionary approaches. ACM Comput Surv 47(4):63:1-63:33","journal-title":"ACM Comput Surv"},{"key":"1122_CR9","doi-asserted-by":"publisher","DOI":"10.1201\/b12720","volume-title":"Cloud computing: lata-intensive computing and scheduling","author":"F Magoul\u00e8s","year":"2016","unstructured":"Magoul\u00e8s F, Pan J, Teng F (2016) Cloud computing: lata-intensive computing and scheduling. Chapman and Hall\/CRC"},{"issue":"1","key":"1122_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MNET.2016.1500133NM","volume":"31","author":"X Ma","year":"2017","unstructured":"Ma X, Fan X, Liu J, Jiang H, Peng K (2017) vLocality: revisiting data locality for MapReduce in virtualized clouds. IEEE Netw 31(1):28\u201335","journal-title":"IEEE Netw"},{"key":"1122_CR11","unstructured":"Zou X, et\u00a0al (2021) The dilemma between deduplication and locality: can both be achieved? pp 171\u2013185"},{"issue":"1","key":"1122_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1504\/IJBDI.2015.067563","volume":"2","author":"T Shabeera","year":"2015","unstructured":"Shabeera T, Madhu Kumar S (2015) Optimising virtual machine allocation in MapReduce cloud for improved data locality. Int J Big Data Intell 2(1):2\u20138","journal-title":"Int J Big Data Intell"},{"key":"1122_CR13","doi-asserted-by":"crossref","unstructured":"Lee S, Jo J, Kim Y (2019) Survey of data locality in apache hadoop. IEEE, pp 46\u201353","DOI":"10.1109\/BCD.2019.8885148"},{"key":"1122_CR14","doi-asserted-by":"crossref","unstructured":"Palanisamy B, Singh A, Liu L, Jain B, Lathrop SA, Costa J, Kramer W (2011) Purlieus: locality-aware resource allocation for MapReduce in a cloud. In: Lathrop SA, Costa J, Kramer W (eds.), Proceedings of conference on high performance computing networking, storage and analysis, ACM, Seattle, November 12\u201318 2011, pp 58:1\u201358:11","DOI":"10.1145\/2063384.2063462"},{"issue":"3","key":"1122_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TCC.2014.2329299","volume":"2","author":"S Tang","year":"2014","unstructured":"Tang S, Lee B, He B (2014) DynamicMR: a dynamic slot allocation optimization framework for MapReduce clusters. IEEE Trans Cloud Comput 2(3):333\u2013347","journal-title":"IEEE Trans Cloud Comput"},{"key":"1122_CR16","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.future.2018.07.043","volume":"90","author":"NS Naik","year":"2019","unstructured":"Naik NS, Negi A, Br TB, Anitha R (2019) A data locality based scheduler to enhance MapReduce performance in heterogeneous environments. Future Gener Comput Syst 90:423\u2013434","journal-title":"Future Gener Comput Syst"},{"key":"1122_CR17","unstructured":"Ru J, Yang Y, Grundy J, Keung J, Hao L (2019) A highly efficient data locality aware task scheduler for cloud-based systems. IEEE, pp 496\u2013498"},{"key":"1122_CR18","first-page":"1","volume":"78","author":"Z Jalalian","year":"2021","unstructured":"Jalalian Z, Sharifi M (2021) A hierarchical multi-objective task scheduling approach for fast big data processing. J Supercomput 78:1\u201330","journal-title":"J Supercomput"},{"key":"1122_CR19","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.iot.2018.09.005","volume":"3","author":"L Bittencourt","year":"2018","unstructured":"Bittencourt L et al (2018) The internet of things, fog and cloud continuum: integration and challenges. Internet Things 3:134","journal-title":"Internet Things"},{"issue":"12","key":"1122_CR20","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1109\/TPDS.2018.2845845","volume":"29","author":"S Li","year":"2018","unstructured":"Li S, Lan T, Ra M-R, Panta R (2018) Joint scheduling and source selection for background traffic in erasure-coded storage. IEEE Trans Parallel Distrib Syst 29(12):2826\u20132837","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"1122_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00224-009-9226-2","volume":"48","author":"L Epstein","year":"2011","unstructured":"Epstein L, van Stee R (2011) Improved results for a memory allocation problem. Theory Comput Syst 48(1):79\u201392","journal-title":"Theory Comput Syst"},{"issue":"3","key":"1122_CR22","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS (1978) \u201cStrong\u2019\u2019 NP-completeness results: motivation, examples, and implications. J ACM 25(3):499\u2013508","journal-title":"J ACM"},{"key":"1122_CR23","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.future.2021.08.014","volume":"127","author":"C Li","year":"2022","unstructured":"Li C, Cai Q, Lou Y (2022) Optimal data placement strategy considering capacity limitation and load balancing in geographically distributed cloud. Future Gener Comput Syst 127:142\u2013159","journal-title":"Future Gener Comput Syst"},{"issue":"5","key":"1122_CR24","doi-asserted-by":"publisher","first-page":"e6037","DOI":"10.1002\/cpe.6037","volume":"33","author":"J Ru","year":"2021","unstructured":"Ru J, Yang Y, Grundy J, Keung J, Hao L (2021) An efficient deadline constrained and data locality aware dynamic scheduling framework for multitenancy clouds. Concurr Comput Pract Exp 33(5):e6037","journal-title":"Concurr Comput Pract Exp"},{"issue":"10","key":"1122_CR25","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1007\/s00607-020-00838-1","volume":"102","author":"CK Swain","year":"2020","unstructured":"Swain CK, Gupta B, Sahu A (2020) Constraint aware profit maximization scheduling of tasks in heterogeneous datacenters. Computing 102(10):2229\u20132255","journal-title":"Computing"},{"key":"1122_CR26","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.knosys.2018.12.002","volume":"165","author":"C Li","year":"2019","unstructured":"Li C et al (2019) Data locality optimization based on data migration and hotspots prediction in geo-distributed cloud environment. Knowl Based Syst 165:321\u2013334","journal-title":"Knowl Based Syst"},{"key":"1122_CR27","doi-asserted-by":"crossref","unstructured":"Xu M, Alamro S, Lan T, Subramaniam S (2018) Chronos: a unifying optimization framework for speculative execution of deadline-critical MapReduce jobs. IEEE, pp 718\u2013729","DOI":"10.1109\/ICDCS.2018.00075"},{"key":"1122_CR28","doi-asserted-by":"publisher","first-page":"111227","DOI":"10.1016\/j.jss.2022.111227","volume":"187","author":"C Li","year":"2022","unstructured":"Li C, Liu J, Wang M, Luo Y (2022) Fault-tolerant scheduling and data placement for scientific workflow processing in geo-distributed clouds. J Syst Softw 187:111227","journal-title":"J Syst Softw"},{"key":"1122_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.future.2022.04.035","volume":"135","author":"Y Kang","year":"2022","unstructured":"Kang Y, Pan L, Liu S (2022) Job scheduling for big data analytical applications in clouds: a taxonomy study. Future Gener Comput Syst 135:129","journal-title":"Future Gener Comput Syst"},{"key":"1122_CR30","doi-asserted-by":"crossref","unstructured":"Albers S, Quedenfeld J (2018) Optimal algorithms for right-sizing data centers","DOI":"10.1145\/3210377.3210385"},{"issue":"3","key":"1122_CR31","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1109\/TNSM.2020.2986477","volume":"17","author":"S Alamro","year":"2020","unstructured":"Alamro S, Xu M, Lan T, Subramaniam S (2020) Shed+: optimal dynamic speculation to meet application deadlines in cloud. IEEE Trans Netw Serv Manag 17(3):1515\u20131526","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"1122_CR32","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.future.2017.05.042","volume":"79","author":"AN Toosi","year":"2018","unstructured":"Toosi AN, Sinnott RO, Buyya R (2018) Resource provisioning for data-intensive applications with deadline constraints on hybrid clouds using Aneka. Future Gener Comput Syst 79:765\u2013775","journal-title":"Future Gener Comput Syst"},{"issue":"11","key":"1122_CR33","doi-asserted-by":"publisher","first-page":"3658","DOI":"10.1109\/TCYB.2016.2574766","volume":"47","author":"H Yuan","year":"2017","unstructured":"Yuan H et al (2017) TTSA: an effective scheduling approach for delay bounded tasks in hybrid clouds. IEEE Trans Cybern 47(11):3658\u20133668","journal-title":"IEEE Trans Cybern"},{"key":"1122_CR34","doi-asserted-by":"crossref","unstructured":"Kaur K, Kumar N, Garg S, Rodrigues JJPC (2018) EnLoc: data locality-aware energy-efficient scheduling scheme for cloud data centers. pp 1\u20136","DOI":"10.1109\/ICC.2018.8422225"},{"key":"1122_CR35","first-page":"1","volume":"72","author":"JH Lee","year":"2020","unstructured":"Lee JH, Jang H, Kim HJ (2020) Iterative job splitting algorithms for parallel machine scheduling with job splitting and setup resource constraints. J Oper Res Soc 72:1\u201320","journal-title":"J Oper Res Soc"},{"issue":"1\u20132","key":"1122_CR36","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00453-010-9445-6","volume":"62","author":"L Epstein","year":"2012","unstructured":"Epstein L, Levin A, van Stee R (2012) Approximation schemes for packing splittable items with cardinality constraints. Algorithmica 62(1\u20132):102\u2013129","journal-title":"Algorithmica"},{"key":"1122_CR37","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2015.08.005","volume":"602","author":"B LeCun","year":"2015","unstructured":"LeCun B, Mautor T, Quessette F, Weisser M-A (2015) Bin packing with fragmentable items: presentation and approximations. Theor Comput Sci 602:50\u201359","journal-title":"Theor Comput Sci"},{"key":"1122_CR38","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire JC, Hamel AM (2014) On scheduling live media streaming in the cloud\u2014a study. IEEE, pp 1\u20136","DOI":"10.1109\/WoWMoM.2014.6919000"},{"key":"1122_CR39","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.cor.2016.06.007","volume":"75","author":"M Casazza","year":"2016","unstructured":"Casazza M, Ceselli A (2016) Exactly solving packing problems with fragmentation. Comput Oper Res 75:202\u2013213","journal-title":"Comput Oper Res"},{"issue":"5","key":"1122_CR40","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/TPDS.2012.175","volume":"24","author":"O Beaumont","year":"2013","unstructured":"Beaumont O, Eyraud-Dubois L, Caro CT, Rejeb H (2013) Heterogeneous resource allocation under degree constraints. IEEE Trans Parallel Distrib Syst 24(5):926\u2013937","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1122_CR41","unstructured":"Jaykrishnan G, Levin A (2022) EPTAS for the dual of splittable bin packing with cardinality constraint. arXiv preprint arXiv:2204.04685"},{"key":"1122_CR42","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ejor.2022.02.014","volume":"303","author":"K Fleszar","year":"2022","unstructured":"Fleszar K (2022) A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation. Eur J Oper Res 303:37","journal-title":"Eur J Oper Res"},{"key":"1122_CR43","doi-asserted-by":"publisher","first-page":"107844","DOI":"10.1016\/j.cie.2021.107844","volume":"163","author":"A Ekici","year":"2022","unstructured":"Ekici A (2022) Variable-sized bin packing problem with conflicts and item fragmentation. Comput Ind Eng 163:107844","journal-title":"Comput Ind Eng"},{"key":"1122_CR44","doi-asserted-by":"publisher","first-page":"105113","DOI":"10.1016\/j.cor.2020.105113","volume":"126","author":"A Ekici","year":"2021","unstructured":"Ekici A (2021) Bin packing problem with conflicts and item fragmentation. Comput Oper Res 126:105113","journal-title":"Comput Oper Res"},{"issue":"5","key":"1122_CR45","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/2829988.2787488","volume":"45","author":"V Jalaparti","year":"2015","unstructured":"Jalaparti V et al (2015) Network-aware scheduling for data-parallel jobs: plan when you can. Comput Commun Rev 45(5):407\u2013420","journal-title":"Comput Commun Rev"},{"key":"1122_CR46","doi-asserted-by":"crossref","unstructured":"Reiss C, Wilkes J, Hellerstein JL (2011) Google cluster-usage traces: format + schema. Technical Report, Google Inc., Mountain View, CA, USA. Revised 2014-11-17 for version 2.1. Posted at https:\/\/github.com\/google\/cluster-data","DOI":"10.1145\/2820468.2820470"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01122-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-022-01122-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01122-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T14:34:46Z","timestamp":1728138886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-022-01122-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1122"],"URL":"https:\/\/doi.org\/10.1007\/s00607-022-01122-0","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"4 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}