{"id":"https://openalex.org/W4316252365","doi":"https://doi.org/10.1145/3545008.3545036","title":"Scheduling Fork-Join Task Graphs with Communication Delays and Equal Processing Times","display_name":"Scheduling Fork-Join Task Graphs with Communication Delays and Equal Processing Times","publication_year":2022,"publication_date":"2022-08-29","ids":{"openalex":"https://openalex.org/W4316252365","doi":"https://doi.org/10.1145/3545008.3545036"},"language":"en","primary_location":{"id":"doi:10.1145/3545008.3545036","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3545008.3545036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st International Conference on Parallel Processing","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/A5100416397","display_name":"Huijun Wang","orcid":"https://orcid.org/0000-0002-2355-6074"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Huijun Wang","raw_affiliation_strings":["The Department of Electrical and Computer Engineering, University of Auckland, New Zealand"],"affiliations":[{"raw_affiliation_string":"The Department of Electrical and Computer Engineering, University of Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088706361","display_name":"Oliver Sinnen","orcid":"https://orcid.org/0000-0002-1550-7416"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Oliver Sinnen","raw_affiliation_strings":["The Department of Electrical and Computer Engineering, University of Auckland, New Zealand"],"affiliations":[{"raw_affiliation_string":"The Department of Electrical and Computer Engineering, University of Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100416397"],"corresponding_institution_ids":["https://openalex.org/I154130895"],"apc_list":null,"apc_paid":null,"fwci":0.1334,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5631193,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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.7457827925682068},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6996493339538574},{"id":"https://openalex.org/keywords/fork","display_name":"Fork (system call)","score":0.6698623299598694},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6170147061347961},{"id":"https://openalex.org/keywords/fork\u2013join-queue","display_name":"Fork\u2013join queue","score":0.5342048406600952},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.46932241320610046},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4690670669078827},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46138814091682434},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45144790410995483},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4359840750694275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2971043586730957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21386882662773132},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19447460770606995},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17051944136619568},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10038110613822937},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.08278301358222961}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7457827925682068},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6996493339538574},{"id":"https://openalex.org/C40523978","wikidata":"https://www.wikidata.org/wiki/Q14675","display_name":"Fork (system call)","level":2,"score":0.6698623299598694},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6170147061347961},{"id":"https://openalex.org/C124444977","wikidata":"https://www.wikidata.org/wiki/Q4025962","display_name":"Fork\u2013join queue","level":4,"score":0.5342048406600952},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.46932241320610046},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4690670669078827},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46138814091682434},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45144790410995483},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4359840750694275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2971043586730957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21386882662773132},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19447460770606995},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17051944136619568},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10038110613822937},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.08278301358222961},{"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/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3545008.3545036","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3545008.3545036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W146567170","https://openalex.org/W1488422606","https://openalex.org/W1923579438","https://openalex.org/W1964857877","https://openalex.org/W1986491739","https://openalex.org/W2009990213","https://openalex.org/W2011559494","https://openalex.org/W2018342998","https://openalex.org/W2040035940","https://openalex.org/W2053477803","https://openalex.org/W2055533652","https://openalex.org/W2055849951","https://openalex.org/W2057392949","https://openalex.org/W2060983467","https://openalex.org/W2063966770","https://openalex.org/W2077201683","https://openalex.org/W2078031780","https://openalex.org/W2114451849","https://openalex.org/W2150446509","https://openalex.org/W2190012392","https://openalex.org/W2743045177","https://openalex.org/W3112184910","https://openalex.org/W3127886951","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W618449037","https://openalex.org/W2004812593","https://openalex.org/W2093074882","https://openalex.org/W2315975353","https://openalex.org/W2516172998","https://openalex.org/W2004439486","https://openalex.org/W2369103189","https://openalex.org/W4221031485","https://openalex.org/W2379380911","https://openalex.org/W3127886951"],"abstract_inverted_index":{"Task":[0],"scheduling":[1,35],"for":[2,98],"parallel":[3],"computing":[4],"is":[5,77],"strongly":[6],"NP-hard":[7],"even":[8],"without":[9],"precedence":[10,17,38],"constraints":[11,18,39],"P||Cmax.":[12],"With":[13],"any":[14,53],"kind":[15,54,74],"of":[16,34,40,55,75,86],"and":[19,71,89,100,106],"communication":[20,45,90],"delays":[21],"the":[22,31,37,62,82,87,102],"problem":[23],"becomes":[24],"less":[25],"manageable":[26],"still.":[27],"We":[28,79],"look":[29,80],"at":[30,81],"specific":[32],"case":[33],"under":[36],"a":[41],"fork-join":[42],"structure":[43],"(including":[44],"delays)":[46],"P|fork":[47],"\u2212":[48],"join,":[49],"cij|Cmax.":[50],"This":[51,73],"represents":[52],"computation":[56,76,88],"that":[57],"divides":[58],"into":[59],"sub-computations":[60],"with":[61],"end":[63],"results":[64],"being":[65],"processed":[66],"together,":[67],"such":[68],"as":[69],"divide":[70],"conquer.":[72],"fundamental.":[78],"instances":[83],"where":[84],"some":[85],"costs":[91],"are":[92],"constant,":[93],"present":[94],"polynomial":[95],"time":[96],"algorithms":[97],"them,":[99],"explore":[101],"boundary":[103],"between":[104],"tractability":[105],"NP-hardness":[107],"around":[108],"this":[109],"problem.":[110]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}