{"id":"https://openalex.org/W2092094633","doi":"https://doi.org/10.1137/050634554","title":"Scalable Heuristic Algorithms for the Parallel Execution of Data Flow Acyclic Digraphs","display_name":"Scalable Heuristic Algorithms for the Parallel Execution of Data Flow Acyclic Digraphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2092094633","doi":"https://doi.org/10.1137/050634554","mag":"2092094633"},"language":"en","primary_location":{"id":"doi:10.1137/050634554","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050634554","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-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/A5054583215","display_name":"Zeyao Mo","orcid":"https://orcid.org/0000-0003-3280-5682"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zeyao Mo","raw_affiliation_strings":["zeyao_mo@iapcm.ac.cn#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"zeyao_mo@iapcm.ac.cn#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101881960","display_name":"Aiqing Zhang","orcid":"https://orcid.org/0009-0001-4467-9268"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aiqing Zhang","raw_affiliation_strings":["Aiqing_Zhang@iapcm.ac.cn#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aiqing_Zhang@iapcm.ac.cn#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036489735","display_name":"Gabriel Wittum","orcid":"https://orcid.org/0000-0002-6993-5520"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gabriel Wittum","raw_affiliation_strings":["wittum@gcsc.uni-frankfurt.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"wittum@gcsc.uni-frankfurt.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3562,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63905004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"5","first_page":"3626","last_page":"3642"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9961000084877014,"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":0.9961000084877014,"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.9959999918937683,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.625302255153656},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5480020046234131},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5473343729972839},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.524692952632904},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.518383800983429},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5030578970909119},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4855487048625946},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4438692629337311},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43450066447257996},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35238826274871826},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26451361179351807}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.625302255153656},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5480020046234131},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5473343729972839},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.524692952632904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.518383800983429},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5030578970909119},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4855487048625946},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4438692629337311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43450066447257996},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35238826274871826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26451361179351807},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050634554","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050634554","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1557534265","https://openalex.org/W1966532952","https://openalex.org/W1974544213","https://openalex.org/W1982109271","https://openalex.org/W2018922480","https://openalex.org/W2045271686","https://openalex.org/W2056730433","https://openalex.org/W2060732875","https://openalex.org/W2073215462","https://openalex.org/W2148028437"],"related_works":["https://openalex.org/W4312723892","https://openalex.org/W2783065147","https://openalex.org/W2914790213","https://openalex.org/W2070865675","https://openalex.org/W4212854884","https://openalex.org/W1970073092","https://openalex.org/W1657646819","https://openalex.org/W338671845","https://openalex.org/W2054653010","https://openalex.org/W2070426974"],"abstract_inverted_index":{"Data":[0],"flow":[1],"acyclic":[2],"directed":[3],"graphs":[4],"(digraphs)":[5],"can":[6],"be":[7],"applied":[8],"to":[9,28,44,124],"accurately":[10],"describe":[11],"the":[12,45,60,71,78,87,113],"data":[13],"dependency":[14],"for":[15,59,82,90,103,112],"a":[16,53,76,83],"wide":[17],"range":[18],"of":[19,31,39,48,55,63,68,75,98],"grid-based":[20],"scientific":[21],"computing":[22,38],"applications":[23,30,41],"ranging":[24],"from":[25,122],"numerical":[26],"algebra":[27],"realistic":[29],"radiation":[32,117],"or":[33,116],"neutron":[34,115],"transport.":[35],"The":[36],"parallel":[37,46,61,79,129],"these":[40,133],"is":[42],"equivalent":[43],"execution":[47,62],"digraphs.":[49,64],"This":[50,65],"paper":[51],"presents":[52],"framework":[54,66],"scalable":[56],"heuristic":[57,72,88,99,134],"algorithms":[58,100,135],"consists":[67],"three":[69],"components:":[70],"partitioning":[73],"method":[74],"digraph,":[77,85],"sweeping":[80],"algorithm":[81],"partitioned":[84],"and":[86,93,107],"strategy":[89],"vertex":[91,94],"scheduling":[92],"packing.":[95],"Evaluation":[96],"rules":[97],"are":[101],"presented":[102],"better":[104],"theoretical":[105],"understanding":[106],"performance":[108],"optimization.":[109],"Parallel":[110],"benchmarks":[111],"multigroup":[114],"$S_n$":[118],"transport":[119],"using":[120],"processors":[121],"100":[123],"2048":[125],"on":[126],"two":[127],"massively":[128],"machines":[130],"show":[131],"that":[132],"scale":[136],"well.":[137]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}