{"id":"https://openalex.org/W2166799065","doi":"https://doi.org/10.1109/mtags.2010.5699431","title":"Dynamic task scheduling for the Uintah framework","display_name":"Dynamic task scheduling for the Uintah framework","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W2166799065","doi":"https://doi.org/10.1109/mtags.2010.5699431","mag":"2166799065"},"language":"en","primary_location":{"id":"doi:10.1109/mtags.2010.5699431","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mtags.2010.5699431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 3rd Workshop on Many-Task Computing on Grids and Supercomputers","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100874153","display_name":"Qingyu Meng","orcid":null},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qingyu Meng","raw_affiliation_strings":["School of Computing, University of Utah, Salt Lake, UT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Utah, Salt Lake, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011389178","display_name":"Justin Luitjens","orcid":"https://orcid.org/0000-0002-8787-8785"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Justin Luitjens","raw_affiliation_strings":["School of Computing, University of Utah, Salt Lake, UT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Utah, Salt Lake, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018125253","display_name":"Martin Berzins","orcid":"https://orcid.org/0000-0002-5419-0634"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Berzins","raw_affiliation_strings":["School of Computing, University of Utah, Salt Lake, UT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Utah, Salt Lake, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":4.0356,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.94868935,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9986000061035156,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8929333686828613},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6597182154655457},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6249983310699463},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6228017210960388},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5782176852226257},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5668596029281616},{"id":"https://openalex.org/keywords/petascale-computing","display_name":"Petascale computing","score":0.5492867231369019},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.472754567861557},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.45622074604034424},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.4434260129928589},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.42951536178588867},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4167781174182892},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.22023728489875793},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11542698740959167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.09017670154571533},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08525636792182922}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8929333686828613},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6597182154655457},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6249983310699463},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6228017210960388},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5782176852226257},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5668596029281616},{"id":"https://openalex.org/C185410017","wikidata":"https://www.wikidata.org/wiki/Q7171778","display_name":"Petascale computing","level":3,"score":0.5492867231369019},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.472754567861557},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.45622074604034424},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.4434260129928589},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.42951536178588867},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4167781174182892},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.22023728489875793},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11542698740959167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.09017670154571533},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08525636792182922},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mtags.2010.5699431","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mtags.2010.5699431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 3rd Workshop on Many-Task Computing on Grids and Supercomputers","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1583706857","https://openalex.org/W1858694651","https://openalex.org/W1971304459","https://openalex.org/W2016559894","https://openalex.org/W2016829383","https://openalex.org/W2036767781","https://openalex.org/W2103803358","https://openalex.org/W2110642128","https://openalex.org/W2124480634","https://openalex.org/W2129074234","https://openalex.org/W2153439050","https://openalex.org/W2165499617","https://openalex.org/W2165606466","https://openalex.org/W2491940814","https://openalex.org/W4239059712"],"related_works":["https://openalex.org/W2021702679","https://openalex.org/W3038449658","https://openalex.org/W1582746211","https://openalex.org/W3129378740","https://openalex.org/W2266027327","https://openalex.org/W2278366184","https://openalex.org/W1486544172","https://openalex.org/W4206324154","https://openalex.org/W1978931242","https://openalex.org/W2154629969"],"abstract_inverted_index":{"Uintah":[0,26,42,71],"is":[1,88,157],"a":[2,10,31,48,60,75,109,128,141],"computational":[3,57,103],"framework":[4],"for":[5,34,47,72],"fluid-structure":[6,171],"interaction":[7],"problems":[8],"using":[9],"combination":[11],"of":[12,70,83,102,124,153,162,165],"the":[13,68,84,148,163,166],"ICE":[14],"fluid":[15],"flow":[16],"algorithm,":[17],"adaptive":[18],"mesh":[19],"refinement":[20],"(AMR)":[21],"and":[22,37,86,90,115,120],"MPM":[23],"particle":[24],"methods.":[25],"uses":[27],"domain":[28],"decomposition":[29],"with":[30,50,140],"task-graph":[32],"approach":[33,156],"asynchronous":[35],"communication":[36,85],"automatic":[38],"message":[39],"generation.":[40],"The":[41,95,151],"software":[43,167],"has":[44,137],"been":[45,138],"used":[46],"decade":[49],"its":[51],"original":[52],"task":[53,78,118,125],"scheduler":[54,79,97],"that":[55],"ran":[56],"tasks":[58,104],"in":[59,92,108,127],"predefined":[61],"static":[62],"order.":[63],"In":[64],"order":[65],"to":[66,146],"improve":[67,147],"performance":[69,164],"petascale":[73],"architecture,":[74],"new":[76,96,134,155],"dynamic":[77],"allowing":[80],"better":[81],"overlapping":[82],"computation":[87],"designed":[89],"evaluated":[91],"this":[93,154],"study.":[94],"supports":[98],"asynchronous,":[99],"out-of-order":[100],"scheduling":[101,149],"by":[105,116],"putting":[106],"them":[107],"distributed":[110],"directed":[111],"acyclic":[112],"graph":[113],"(DAG)":[114],"isolating":[117],"memory":[119],"keeping":[121],"multiple":[122],"copies":[123],"variables":[126],"data":[129],"warehouse":[130],"when":[131],"necessary.":[132],"A":[133],"runtime":[135],"system":[136],"implemented":[139],"two-stage":[142],"priority":[143],"queuing":[144],"architecture":[145],"efficiency.":[150],"effectiveness":[152],"shown":[158],"through":[159],"an":[160],"analysis":[161],"on":[168],"large":[169],"scale":[170],"examples.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}