{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:13:13Z","timestamp":1768558393977,"version":"3.49.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572510"],"award-info":[{"award-number":["61572510"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"R&D Special Fund for Public Welfare Industry","award":["GYHY201306003"],"award-info":[{"award-number":["GYHY201306003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cloud Comput."],"published-print":{"date-parts":[[2020,4,1]]},"DOI":"10.1109\/tcc.2015.2511745","type":"journal-article","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T19:26:50Z","timestamp":1450985210000},"page":"349-362","source":"Crossref","is-referenced-by-count":26,"title":["A Data and Task Co-Scheduling Algorithm for Scientific Cloud Workflows"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0925-6937","authenticated-orcid":false,"given":"Kefeng","family":"Deng","sequence":"first","affiliation":[]},{"given":"Kaijun","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Min","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Junqiang","family":"Song","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.02.006"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/GRID.2007.4354142"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2014.2314655"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536445"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2012.134"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.08.015"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/GRID.2005.1542717"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2003.1210014"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2002.1029935"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2008.09.006"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/12.8730"},{"key":"ref27","first-page":"175","article-title":"A linear-time heuristic for improving network partitions","author":"fiduccia","year":"0","journal-title":"Proc 19th Conf Des Autom"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/spe.995"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1551609.1551638"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2005.1520947"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1383422.1383429"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792225297"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1084"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1030.0086"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1687"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref25","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms (3 Ed )"},{"key":"ref50","first-page":"45","article-title":"Integrated data placement and task assignment for scientific workflows in clouds","author":"\u00e7ataly\u00fcrek","year":"0","journal-title":"Proc of the 5th Int Workshop on Data Intensive Distributed Computing"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/800153.804930"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.24"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2014.2303077"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691724"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.09.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.238"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2002.1015564"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SC.1998.10018"},{"key":"ref16","first-page":"343","article-title":"Multilevel k-way hypergraph partitioning","author":"karypis","year":"0","journal-title":"Proc 36th ACM\/IEEE Des Autom Conf"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.09.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/Grid.2011.14"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/71.780863","article-title":"Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication","volume":"10","author":"\u00e7ataly\u00fcrek","year":"1999","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.303"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1851476.1851483"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.38"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10723-012-9207-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2010.02.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2008.24"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3084"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2007.83"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.259"},{"key":"ref48","first-page":"28","article-title":"A hypergraph-partitioning approach for coarse-grain decomposition","author":"\u00e7ataly\u00fcrek","year":"0","journal-title":"Proc ACM\/IEEE Conf Supercomput"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2011.102"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.04.019"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2004.1281599"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2009.5433229"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2008.5213939"}],"container-title":["IEEE Transactions on Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245519\/9109589\/07365441.pdf?arnumber=7365441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:23:23Z","timestamp":1651080203000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7365441\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,1]]},"references-count":51,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcc.2015.2511745","relation":{},"ISSN":["2168-7161","2372-0018"],"issn-type":[{"value":"2168-7161","type":"electronic"},{"value":"2372-0018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,1]]}}}