{"id":"https://openalex.org/W2389507604","doi":null,"title":"A New Algorithm for Scheduling Fork-Join Task Graph","display_name":"A New Algorithm for Scheduling Fork-Join Task Graph","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2389507604","mag":"2389507604"},"language":"en","primary_location":{"id":"mag:2389507604","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-RJXB200204038.htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Software","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5104042149","display_name":"Zhao Hong","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhao Hong","raw_affiliation_strings":["Department of Computer Science and Engineering, Harbin Institute of Technology, Harbin 150001, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Harbin Institute of Technology, Harbin 150001, China","institution_ids":["https://openalex.org/I204983213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5104042149"],"corresponding_institution_ids":["https://openalex.org/I204983213"],"apc_list":null,"apc_paid":null,"fwci":0.6102,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79257362,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9096999764442444,"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.9096999764442444,"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.06270000338554382,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.010499999858438969,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/static-task-scheduling","display_name":"static task scheduling","score":0.9470000267028809},{"id":"https://openalex.org/keywords/networks-of-workstations","display_name":"workstation clusters","score":0.968999981880188},{"id":"https://openalex.org/keywords/task-duplication","display_name":"task duplication","score":0.9070000052452087}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8884540796279907},{"id":"https://openalex.org/C40523978","wikidata":"https://www.wikidata.org/wiki/Q14675","display_name":"Fork (system call)","level":2,"score":0.6843606233596802},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5500277280807495},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5283829569816589},{"id":"https://openalex.org/C124444977","wikidata":"https://www.wikidata.org/wiki/Q4025962","display_name":"Fork\u2013join queue","level":4,"score":0.46714848279953003},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4345088601112366},{"id":"https://openalex.org/C201515029","wikidata":"https://www.wikidata.org/wiki/Q5520966","display_name":"Gang scheduling","level":5,"score":0.4279235601425171},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.41216179728507996},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3828412890434265},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.32117903232574463},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.29629701375961304},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16749003529548645},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10508346557617188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0735355019569397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07342058420181274},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"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":"mag:2389507604","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-RJXB200204038.htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Software","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2352408846","https://openalex.org/W2359481127","https://openalex.org/W2365917684","https://openalex.org/W2390485772","https://openalex.org/W2540162114","https://openalex.org/W2383001801","https://openalex.org/W2541299446","https://openalex.org/W2380518172","https://openalex.org/W1589350276","https://openalex.org/W2007985012"],"abstract_inverted_index":{"Task":[0],"scheduling":[1,76,124,148],"is":[2,80,83,156],"one":[3],"of":[4,11,14,25,50,61,95,126,132],"the":[5,9,26,36,59,65,93,109,123,136,146],"crucial":[6],"factors":[7],"influencing":[8],"efficiency":[10,54],"a":[12,72],"network":[13],"workstations.":[15],"Fork-Join":[16,31,117],"task":[17,32,75,86,110,118,138],"graphs":[18,33,119],"can":[19],"represent":[20],"many":[21],"parallel":[22,44],"structures.":[23],"All":[24],"existing":[27],"algorithms":[28,51,134],"which":[29,82],"schedule":[30,96],"have":[34],"ignored":[35],"problem":[37,60],"that":[38,131,142],"communications":[39,100],"cannot":[40],"be":[41],"executed":[42],"in":[43,45],"non-fully-connected":[46,160],"NOW,":[47],"and":[48,88,101,113,122,150],"some":[49],"with":[52,130],"high":[53],"even":[55],"did":[56],"not":[57],"take":[58,92],"how":[62],"to":[63,90,159],"save":[64],"processors":[66],"into":[67,104],"account.":[68,105],"In":[69],"this":[70],"paper,":[71],"new":[73],"static":[74],"algorithm":[77,144],"called":[78],"TSA_FJ":[79,127,143],"proposed,":[81],"based":[84],"on":[85],"duplication":[87],"trying":[89],"synthetically":[91],"problems":[94],"length":[97,149],"shortening,":[98],"unparallel":[99],"processor":[102],"saving":[103],"By":[106],"randomly":[107],"generating":[108],"execution":[111],"time":[112],"communication":[114],"time,":[115],"several":[116],"are":[120,128],"got":[121],"results":[125],"compared":[129],"other":[133],"for":[135],"generated":[137],"graphs.":[139],"It":[140,155],"shows":[141],"has":[145],"shortest":[147],"uses":[151],"much":[152,157],"less":[153],"processors.":[154],"suitable":[158],"NOW.":[161]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}