{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T11:45:32Z","timestamp":1750419932854,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T00:00:00Z","timestamp":1618358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T00:00:00Z","timestamp":1618358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19K11910"],"award-info":[{"award-number":["19K11910"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11227-021-03789-2","type":"journal-article","created":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T05:03:24Z","timestamp":1618376604000},"page":"12879-12923","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A containerized task clustering for scheduling workflows to utilize processors and containers on clouds"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8121-8874","authenticated-orcid":false,"given":"Hidehiro","family":"Kanemitsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Kanai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiro","family":"Katto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hidenori","family":"Nakazato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,14]]},"reference":[{"issue":"1","key":"3789_CR1","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/COMST.2015.2477041","volume":"18","author":"R Mijumbi","year":"2016","unstructured":"Mijumbi R, Serrat J, Gorricho J-L et al (2016) Network function virtualization: state-of-the-art and research challenges. IEEE Commun Surv Tutor 18(1):236\u2013262","journal-title":"IEEE Commun Surv Tutor"},{"issue":"4","key":"3789_CR2","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1109\/SURV.2011.122811.00060","volume":"14","author":"A Belbekkouche","year":"2012","unstructured":"Belbekkouche A, Hasan MM, Karmouch A (2012) Resource discovery and allocation in network virtualization. IEEE Commun Surv Tutor 14(4):1114\u20131128","journal-title":"IEEE Commun Surv Tutor"},{"key":"3789_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jnca.2016.09.001","volume":"75","author":"D Bhamare","year":"2016","unstructured":"Bhamare D, Jain R, Samaka M et al (2016) A survey on service function chaining. J Netw Comput Appli 75:138\u2013155","journal-title":"J Netw Comput Appli"},{"issue":"11","key":"3789_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MC.2014.328","volume":"47","author":"P Quinn","year":"2014","unstructured":"Quinn P, Guichard J (2014) Service function chaining: creating a service plane via network service headers. Computer 47(11):38\u201344","journal-title":"Computer"},{"key":"3789_CR5","doi-asserted-by":"publisher","first-page":"8084","DOI":"10.1109\/ACCESS.2016.2629278","volume":"4","author":"L Wang","year":"2016","unstructured":"Wang L, Lu Z, Wen X et al (2016) Joint optimization of service function chaining and resource allocation in network function virtualization. IEEE Access 4:8084\u20138094","journal-title":"IEEE Access"},{"key":"3789_CR6","first-page":"72","volume":"102","author":"MT Beck","year":"2016","unstructured":"Beck MT, Botero JF (2016) Scalable and coordinated allocation of service function chains. Comput Commun 102:72\u201388","journal-title":"Comput Commun"},{"key":"3789_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.comnet.2017.01.008","volume":"114","author":"S Khebbache","year":"2017","unstructured":"Khebbache S, Hadji M, Zeghlache D (2017) Virtualized network functions chaining and routing algorithms. Comput. Netw. 114:95\u2013110","journal-title":"Comput. Netw."},{"issue":"3","key":"3789_CR8","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1109\/TCOMM.2017.2650994","volume":"64","author":"HK Nguyen","year":"2017","unstructured":"Nguyen HK, Zhang Y, Chang Z et al (2017) Parallel and distributed resource allocation with minimum traffc disruption for network virtualization. IEEE Trans Commun 64(3):1162\u20131175","journal-title":"IEEE Trans Commun"},{"issue":"4","key":"3789_CR9","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1109\/TNET.2018.2842798","volume":"26","author":"T-W Kuo","year":"2018","unstructured":"Kuo T-W, Liou B-H, Lin KC-J et al (2018) Deploying chains of virtual network functions: on the relation between link and server usage. IEEE\/ACM Trans Netw 26(4):1562\u20131576","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"11","key":"3789_CR10","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/JSAC.2017.2760178","volume":"35","author":"M Ghaznavi","year":"2017","unstructured":"Ghaznavi M, Shahriar N, Kamali S et al (2017) Distributed service function chaining. IEEE J Sel Areas Commun 35(11):2479\u20132489","journal-title":"IEEE J Sel Areas Commun"},{"key":"3789_CR11","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.comnet.2015.09.035","volume":"93","author":"S Sahhaf","year":"2015","unstructured":"Sahhaf S, Tavernier W, Rost M et al (2015) Network service chaining with optimized network function embedding supporting service decompositions. Comput Netw 93:492\u2013505","journal-title":"Comput Netw"},{"issue":"4","key":"3789_CR12","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/TNSM.2017.2757266","volume":"14","author":"HA Alameddine","year":"2017","unstructured":"Alameddine HA, Sebbah S, Assi C (2017) On the interplay between network function mapping and scheduling in VNF-based networks: a column generation approach. IEEE Trans Netw Serv Managem 14(4):860\u2013874","journal-title":"IEEE Trans Netw Serv Managem"},{"key":"3789_CR13","doi-asserted-by":"crossref","unstructured":"Li Z, Yang Y (2017) Placement of Virtual Network Functions in Hybrid Data Center Networks, In: Proc IEEE Int Symp High-Performance Interconnects, pp. 73\u201379","DOI":"10.1109\/HOTI.2017.15"},{"issue":"4","key":"3789_CR14","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1109\/TNET.2017.2668470","volume":"25","author":"V Eramo","year":"2017","unstructured":"Eramo V, Miucci E, Ammar M et al (2017) An approach for service function chain routing and virtual function network instance migration in network function virtualization architectures. IEEE\/ACM Trans Netw 25(4):2008\u20132025","journal-title":"IEEE\/ACM Trans Netw"},{"key":"3789_CR15","doi-asserted-by":"crossref","unstructured":"O. Soualah, M. Mechtri, C. Ghribi et al. (2017) An Effcient Algorithm for Virtual Network Function Placement and Chaining, In: Proc IEEE Annu Consumer Commun & Netw Conf (CCNC), pp. 647\u2013652","DOI":"10.1109\/CCNC.2017.7983207"},{"issue":"18","key":"3789_CR16","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.1109\/TPDS.2018.2880992","volume":"30","author":"J Pei","year":"2019","unstructured":"Pei J, Hong P, Xue K, Li D (2019) Efficiently embedding service function chains with dynamic virtual network function placement in geo-distributed cloud system. IEEE Trans Parallel Distrib Syst 30(18):2179\u20132192","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3789_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.comcom.2016.11.002","volume":"102","author":"MC Luizelli","year":"2016","unstructured":"Luizelli MC, Cordeiro WLC, Buriol LS et al (2016) A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining. Comput Commun 102:67\u201377","journal-title":"Comput Commun"},{"key":"3789_CR18","doi-asserted-by":"crossref","unstructured":"Sang Y, Ji B, Gupta GR et al. (2017) Provably Efficient Algorithms for Joint Placement and Allocation of Virtual Network Functions, In: Proc IEEE Int Conf Comput Commun (IEEE INFOCOM 2017), pp. 1\u20139","DOI":"10.1109\/INFOCOM.2017.8057036"},{"key":"3789_CR19","doi-asserted-by":"crossref","unstructured":"Bhamare D, Samaka M, Erbad A, et al. (2017) Multi-Objective Scheduling of Micro-Services for Optimal Service Function Chains, In: Proc IEEE ICC 2017 SAC Symp Cloud Commun Netw Track, pp. 1\u20136","DOI":"10.1109\/ICC.2017.7996729"},{"key":"3789_CR20","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.future.2018.03.018","volume":"85","author":"G Sun","year":"2018","unstructured":"Sun G, Li Y et al (2018) Low-latency orchestration for workflow-oriented service function chain in edge computing. Future Gener Comput Syst 85:116\u2013128","journal-title":"Future Gener Comput Syst"},{"key":"3789_CR21","doi-asserted-by":"crossref","unstructured":"Lin X, Guo D, Shen Y et al. (2018) DAG-SFC: Minimize the Embedding Cost of SFC with Parallel VNFs, In: Proc Int Conf Parallel Processing (ICPP 2018), 10 pages","DOI":"10.1145\/3225058.3225111"},{"key":"3789_CR22","doi-asserted-by":"crossref","unstructured":"Alzahrani EJ, Tari Z, Lee YC, Alsadie D, Zomaya AY (2017) AdCFS: Adaptive completely fair scheduling policy for containerised workflows systems, In: Proc 2017 IEEE 16th Int Symp Network Comput Appl, NCA 2017, pp. 1\u20138","DOI":"10.1109\/NCA.2017.8171362"},{"key":"3789_CR23","unstructured":"Zhang W, Liu Y, Wang L, Li Z, Goh RSM (2019) Cost-Efficient and Latency-Aware Workflow Scheduling Policy for Container-Based Systems, In: Proc Int Conf Parallel Distrib Syst ICPADS2019, pp. 763\u2013770"},{"issue":"3","key":"3789_CR24","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H, Hariri S, Wu MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3):260\u2013274","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"3789_CR25","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TPDS.2013.57","volume":"25","author":"H Arabnejad","year":"2014","unstructured":"Arabnejad H, Barbosa JG (2014) List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans Parallel Distrib Syst 25(3):682\u2013694","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"11","key":"3789_CR26","doi-asserted-by":"publisher","first-page":"3144","DOI":"10.1109\/TPDS.2016.2526682","volume":"27","author":"H Kanemitsu","year":"2016","unstructured":"Kanemitsu H, Hanada M, Nakazato H (2016) Clustering-based task scheduling in a large number of heterogeneous processors. IEEE Trans Parallel Distrib Syst 27(11):3144\u20133157","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3789_CR27","doi-asserted-by":"crossref","unstructured":"Mong EE, Thein MM, Aung MT (2016) Clustering Based on Task Dependency for Data-Intensive Workflow Scheduling Optimization, In: Proc. Workshop Many-Task Computing on Clouds, Grids, and Supercomputers, pp. 20\u201425","DOI":"10.1109\/MTAGS.2016.07"},{"key":"3789_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jss.2019.110405","volume":"158","author":"M Dong","year":"2019","unstructured":"Dong M, Fan L, Jing C (2019) ECOS: an efficient task-clustering based cost-effective aware scheduling algorithm for scientific workflows execution on heterogeneous cloud systems. J Syst Softw 158:1\u201311","journal-title":"J Syst Softw"},{"key":"3789_CR29","doi-asserted-by":"crossref","unstructured":"Ozkaya MY, Benoit A, U?ar B, Herrmann J, Cataly?rek ?mit V (2019) A Scalable Clustering-Based Task Scheduler for Homogeneous Processors Using DAG Partitioning, In: Proc Prallel Distrib Proc Symp (IPDPS), pp. 155-165","DOI":"10.1109\/IPDPS.2019.00026"},{"issue":"2","key":"3789_CR30","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MM.2003.1196115","volume":"23","author":"D Koufaty","year":"2003","unstructured":"Koufaty D, Marr DT (2003) Hyperthreading technology in the netburst microarchitecture. IEEE Micro 23(2):56\u201365","journal-title":"IEEE Micro"},{"key":"3789_CR31","doi-asserted-by":"crossref","unstructured":"Podzimek A, Bulej L et al. (2015) Analyzing the Impact of CPU Pinning and Partial CPU Loadson Performance and Energy Efficiency, In: Proc IEEE\/ACM Int Symp Cluster, Cloud and Grid Comput, pp. 1\u201310","DOI":"10.1109\/CCGrid.2015.164"},{"key":"3789_CR32","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.future.2017.01.011","volume":"75","author":"AM Chirkin","year":"2017","unstructured":"Chirkin AM et al (2017) Eecution time estimation for workflow scheduling. Futur Gener Comput Syst 75:376\u2013387","journal-title":"Futur Gener Comput Syst"},{"key":"3789_CR33","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11508380_24","volume":"3470","author":"P Phinjaroenphan","year":"2005","unstructured":"Phinjaroenphan P, Bevinakoppa S, Zeephongsekul P (2005) A method for estimating the execution time of a parallel task on a grid node. Lect Notes Comput Sci 3470:226\u2013236","journal-title":"Lect Notes Comput Sci"},{"key":"3789_CR34","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/cpe.929","volume":"17","author":"T Fahringer","year":"2005","unstructured":"Fahringer T, Jugravu A et al (2005) ASKALON: a tool set for cluster and grid computing. Concurr Computat Pract Exper 17:143\u2013169","journal-title":"Concurr Computat Pract Exper"},{"key":"3789_CR35","unstructured":"ncl\\_sfcsim: URL:https:\/\/github.com\/ncl-teu\/ncl_sfcsim"},{"key":"3789_CR36","doi-asserted-by":"crossref","unstructured":"Bharathi S et al (2008) Characterization of scientific workflows, In: Proc Third Workshop on Workflows in Support of Large-Scale Science, pp. 1\u201310","DOI":"10.1109\/WORKS.2008.4723958"},{"key":"3789_CR37","unstructured":"Apache CloudStack: URL: https:\/\/cloudstack.apache.org\/"},{"key":"3789_CR38","unstructured":"SFlow: URL:https:\/\/github.com\/ncl-teu\/SFlow"},{"key":"3789_CR39","unstructured":"Docker Web Site: URL: https:\/\/www.docker.com\/"},{"key":"3789_CR40","unstructured":"OpenCV Web Site: URL: https:\/\/opencv.org\/"},{"issue":"1","key":"3789_CR41","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.995","volume":"41","author":"RN Calheiros","year":"2011","unstructured":"Calheiros RN, Ranjan R, Beloglazov A, De Rose CAF, Buyya R (2011) CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw Pract Exp 41(1):23\u201350","journal-title":"Softw Pract Exp"},{"key":"3789_CR42","doi-asserted-by":"crossref","unstructured":"Chen W, Deelman E (2012) WorkflowSim: A toolkit for simulating scientific workflows in distributed environments, In: Proc IEEE Int Conf E-Sci, pp. 1\u20138","DOI":"10.1109\/eScience.2012.6404430"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03789-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03789-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03789-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T09:39:52Z","timestamp":1635154792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03789-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,14]]},"references-count":42,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["3789"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03789-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2021,4,14]]},"assertion":[{"value":"30 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declared that they have no conflicts of interest to this work. We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}