{"id":"https://openalex.org/W3146392051","doi":"https://doi.org/10.1109/ipdps.2006.1639309","title":"Using virtual grids to simplify application scheduling","display_name":"Using virtual grids to simplify application scheduling","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W3146392051","doi":"https://doi.org/10.1109/ipdps.2006.1639309","mag":"3146392051"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2006.1639309","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639309","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","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/A5053956251","display_name":"Richard Huang","orcid":"https://orcid.org/0000-0002-8573-5676"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Huang","raw_affiliation_strings":["Computer Science & Engineering and Center for Networked Systems, University of California, San Diego, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering and Center for Networked Systems, University of California, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022674890","display_name":"Henri Casanova","orcid":"https://orcid.org/0000-0001-6310-0365"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Casanova","raw_affiliation_strings":["Information and Computer Sciences Department, University of Hawaii, Manoa, USA"],"affiliations":[{"raw_affiliation_string":"Information and Computer Sciences Department, University of Hawaii, Manoa, USA","institution_ids":["https://openalex.org/I117965899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085538238","display_name":"Andrew A. Chien","orcid":"https://orcid.org/0000-0002-1204-206X"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.A. Chien","raw_affiliation_strings":["Computer Science & Engineering and Center for Networked Systems, University of California, San Diego, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering and Center for Networked Systems, University of California, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053956251"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":1.2071,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.83253781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"59","issue":null,"first_page":"10 pp.","last_page":"10 pp."},"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/T11986","display_name":"Scientific Computing and Data Management","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.855621337890625},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.7517348527908325},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6374192237854004},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5981998443603516},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5694236159324646},{"id":"https://openalex.org/keywords/grid-computing","display_name":"Grid computing","score":0.5565122961997986},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5464656352996826},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5294625163078308},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5200350284576416},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.5197789072990417},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5087915062904358},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4893884062767029},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.45546990633010864},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4257833659648895},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.33791133761405945},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3306020498275757},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17482692003250122},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15230771899223328},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12864366173744202},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.10364952683448792}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.855621337890625},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7517348527908325},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6374192237854004},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5981998443603516},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5694236159324646},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.5565122961997986},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5464656352996826},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5294625163078308},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5200350284576416},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.5197789072990417},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5087915062904358},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4893884062767029},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.45546990633010864},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4257833659648895},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.33791133761405945},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3306020498275757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17482692003250122},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15230771899223328},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12864366173744202},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10364952683448792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2006.1639309","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639309","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332603","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1592298717","https://openalex.org/W1621944069","https://openalex.org/W1948092788","https://openalex.org/W1964285734","https://openalex.org/W1973531467","https://openalex.org/W2033442379","https://openalex.org/W2057392949","https://openalex.org/W2083209848","https://openalex.org/W2097025565","https://openalex.org/W2117848690","https://openalex.org/W2128548442","https://openalex.org/W2129666400","https://openalex.org/W2151038512","https://openalex.org/W2163252320","https://openalex.org/W2164228230","https://openalex.org/W2167677198","https://openalex.org/W2170901349","https://openalex.org/W6635406098","https://openalex.org/W6636766374","https://openalex.org/W6640611774","https://openalex.org/W6641192703"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W4386580182","https://openalex.org/W4390711934","https://openalex.org/W4390711951","https://openalex.org/W4390711911","https://openalex.org/W4390711927","https://openalex.org/W4390711908","https://openalex.org/W4390722068","https://openalex.org/W4390722066"],"abstract_inverted_index":{"Users":[0],"and":[1,49,132,150],"developers":[2],"of":[3,11,28,125,128],"grid":[4,121,145],"applications":[5],"have":[6],"access":[7],"to":[8,44,58,102],"increasing":[9],"numbers":[10],"resources.":[12],"While":[13],"more":[14,51,151,154],"resources":[15,133],"generally":[16],"mean":[17],"higher":[18],"capabilities":[19],"for":[20],"an":[21],"application,":[22],"they":[23],"also":[24],"raise":[25],"the":[26,61,143],"issue":[27],"application":[29,74],"scheduling":[30,36,67,97,111,139,158],"scalability.":[31],"First,":[32],"even":[33],"polynomial":[34],"time":[35,43],"heuristics":[37],"may":[38,54,99],"take":[39],"a":[40,46,66,70,109,115,119,126,136],"prohibitively":[41],"long":[42],"compute":[45],"schedule.":[47],"Second,":[48],"perhaps":[50],"critical,":[52],"it":[53],"not":[55],"be":[56,81,100],"possible":[57],"gather":[59],"all":[60],"resource":[62,116],"information":[63],"needed":[64],"by":[65],"algorithm":[68],"in":[69,92],"scalable":[71,110,152],"manner.":[72],"Our":[73,88,123],"focus":[75],"is":[76,90,147],"scientific":[77],"workflows,":[78],"which":[79],"can":[80],"represented":[82],"as":[83,148],"directed":[84],"acyclic":[85],"graphs":[86],"(DAGs).":[87],"claim":[89],"that,":[91],"future":[93],"resource-rich":[94],"environments,":[95],"simple":[96,137],"algorithms":[98,159],"sufficient":[101],"achieve":[103],"good":[104],"workflow":[105],"performances.":[106],"We":[107],"introduce":[108],"approach":[112],"that":[113,135],"uses":[114],"abstraction":[117,146],"called":[118],"virtual":[120,144],"(VG).":[122],"simulations":[124],"range":[127],"typical":[129],"DAG":[130,157],"structures":[131],"demonstrate":[134],"greedy":[138],"heuristic":[140,156],"combined":[141],"with":[142],"effective":[149],"than":[153],"complex":[155],"on":[160],"large-scale":[161],"platforms":[162]},"counts_by_year":[{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}