{"id":"https://openalex.org/W2121481116","doi":"https://doi.org/10.1109/iscc.2011.5983875","title":"Workflow scheduling in e-Science networks","display_name":"Workflow scheduling in e-Science networks","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2121481116","doi":"https://doi.org/10.1109/iscc.2011.5983875","mag":"2121481116"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2011.5983875","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2011.5983875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034303126","display_name":"Eun-Sung Jung","orcid":"https://orcid.org/0000-0002-1288-7521"},"institutions":[{"id":"https://openalex.org/I2250650973","display_name":"Samsung (South Korea)","ror":"https://ror.org/04w3jy968","country_code":"KR","type":"company","lineage":["https://openalex.org/I2250650973"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Eun-Sung Jung","raw_affiliation_strings":["Samsung Advanced Institute of Technology, ICL Laboratory, Samsung Electronics Company Limited, Yongin si, South Korea","Samsung Advanced Institute of Technology, ICL Lab, Samsung Electronics, Yongin-si, 446-712, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Samsung Advanced Institute of Technology, ICL Laboratory, Samsung Electronics Company Limited, Yongin si, South Korea","institution_ids":["https://openalex.org/I2250650973"]},{"raw_affiliation_string":"Samsung Advanced Institute of Technology, ICL Lab, Samsung Electronics, Yongin-si, 446-712, South Korea","institution_ids":["https://openalex.org/I2250650973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077570468","display_name":"Sanjay Ranka","orcid":"https://orcid.org/0000-0003-4886-1988"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjay Ranka","raw_affiliation_strings":["Department of CISE, University of Florida, Gainesville, FL, USA","Department of CISE, University of Florida, Gainesville, FL 32611, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of CISE, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Department of CISE, University of Florida, Gainesville, FL 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj Sahni","orcid":"https://orcid.org/0000-0002-8129-1676"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sartaj Sahni","raw_affiliation_strings":["Department of CISE, University of Florida, Gainesville, FL, USA","Department of CISE, University of Florida, Gainesville, FL 32611, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of CISE, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Department of CISE, University of Florida, Gainesville, FL 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0971,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80274096,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"432","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11986","display_name":"Scientific Computing and Data Management","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8234133124351501},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.755475640296936},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.6839577555656433},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.630111813545227},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.61522376537323},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5699010491371155},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5546773076057434},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5090352892875671},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4771658480167389},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47483235597610474},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4524189829826355},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45187610387802124},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.42445486783981323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17187464237213135},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14486068487167358},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08682513236999512},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.08487620949745178}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8234133124351501},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.755475640296936},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.6839577555656433},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.630111813545227},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.61522376537323},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5699010491371155},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5546773076057434},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5090352892875671},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4771658480167389},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47483235597610474},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4524189829826355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45187610387802124},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.42445486783981323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17187464237213135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14486068487167358},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08682513236999512},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08487620949745178},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscc.2011.5983875","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2011.5983875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.5735","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.5735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cise.ufl.edu/%7Esahni/papers/workflow.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5600000023841858,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W616339485","https://openalex.org/W1895859803","https://openalex.org/W1966681156","https://openalex.org/W2003310149","https://openalex.org/W2010868970","https://openalex.org/W2033676590","https://openalex.org/W2057108708","https://openalex.org/W2091257550","https://openalex.org/W2092333800","https://openalex.org/W2098464112","https://openalex.org/W2110250572","https://openalex.org/W2130428181","https://openalex.org/W2142386205","https://openalex.org/W2144386092","https://openalex.org/W2144918089","https://openalex.org/W2149294210","https://openalex.org/W2152275923","https://openalex.org/W2156997923","https://openalex.org/W2169560887","https://openalex.org/W2541367100","https://openalex.org/W4250661686"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2106332846","https://openalex.org/W2372008037","https://openalex.org/W2397293317","https://openalex.org/W2978148977","https://openalex.org/W3036719625","https://openalex.org/W2545511463","https://openalex.org/W1545991362","https://openalex.org/W2225350526","https://openalex.org/W2134269501"],"abstract_inverted_index":{"We":[0,29,77],"solve":[1],"workflow":[2,32],"scheduling":[3,20,33,85],"problems":[4],"in":[5,87],"e-Science":[6,88],"networks,":[7],"whose":[8,90],"goal":[9],"is":[10,92,127],"minimizing":[11],"either":[12],"makespan":[13],"or":[14],"network":[15,27],"resource":[16,70,125],"consumption":[17],"by":[18],"jointly":[19],"heterogeneous":[21],"resources":[22],"such":[23],"as":[24,38],"compute":[25],"and":[26,45,67,104,123],"resources.":[28],"formulate":[30],"the":[31],"problem":[34],"incorporating":[35],"multiple":[36,60,121],"paths":[37,61,122],"a":[39,82],"mixed":[40],"integer":[41],"linear":[42,48],"programming":[43,49],"(MILP)":[44],"develop":[46],"several":[47],"relaxation":[50],"heuristics":[51,101],"based":[52],"on":[53],"this":[54],"formulation.":[55],"Our":[56,95],"algorithms":[57,80],"allow":[58],"dynamic":[59,120],"for":[62,129],"data":[63,130],"transfer":[64],"between":[65],"tasks":[66],"more":[68],"flexible":[69],"allocation":[71,126],"that":[72,99,117],"may":[73],"vary":[74],"over":[75],"time.":[76],"evaluate":[78],"our":[79,100],"against":[81],"well-known":[83],"list":[84],"algorithm":[86],"networks":[89],"size":[91],"relatively":[93],"small.":[94,112],"simulation":[96],"results":[97,115],"show":[98,116],"are":[102,111],"fast":[103],"work":[105],"well":[106],"when":[107],"communication-to-computation":[108],"ratios":[109],"(CCRs)":[110],"Also,":[113],"these":[114],"use":[118],"of":[119],"malleable":[124],"useful":[128],"intensive":[131],"applications.":[132]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}