{"id":"https://openalex.org/W2126365117","doi":"https://doi.org/10.1142/s0129054197000045","title":"Complexity of Task Graph Scheduling with Fixed Communication Capacity","display_name":"Complexity of Task Graph Scheduling with Fixed Communication Capacity","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W2126365117","doi":"https://doi.org/10.1142/s0129054197000045","mag":"2126365117"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054197000045","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054197000045","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00073739","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026387960","display_name":"Lucian Finta","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Lucian Finta","raw_affiliation_strings":["INRIA, Centre Sophia Antipolis, 2004 route des Lucioles, B.P. 93, 06902 Sophia-Antipolis, France","INRIA, Centre Sophia, Antipolis, 2004 Route des Lucioles, B.P. 93, 06902 Sophia-Antipolis, France#TAB#"],"affiliations":[{"raw_affiliation_string":"INRIA, Centre Sophia Antipolis, 2004 route des Lucioles, B.P. 93, 06902 Sophia-Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA, Centre Sophia, Antipolis, 2004 Route des Lucioles, B.P. 93, 06902 Sophia-Antipolis, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003356618","display_name":"Zhen Liu","orcid":"https://orcid.org/0000-0002-8107-0929"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zhen Liu","raw_affiliation_strings":["INRIA, Centre Sophia Antipolis, 2004 route des Lucioles, B.P. 93, 06902 Sophia-Antipolis, France","INRIA, Centre Sophia, Antipolis, 2004 Route des Lucioles, B.P. 93, 06902 Sophia-Antipolis, France#TAB#"],"affiliations":[{"raw_affiliation_string":"INRIA, Centre Sophia Antipolis, 2004 route des Lucioles, B.P. 93, 06902 Sophia-Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA, Centre Sophia, Antipolis, 2004 Route des Lucioles, B.P. 93, 06902 Sophia-Antipolis, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026387960"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":1.0142,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82284981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"08","issue":"01","first_page":"43","last_page":"66"},"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.9993000030517578,"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.9993000030517578,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983000159263611,"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.9970999956130981,"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.8309219479560852},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6804982423782349},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6107749938964844},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5793497562408447},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5684136748313904},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5295432806015015},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5102322101593018},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4516819715499878},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4296901822090149},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.3872143626213074},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23039445281028748},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1644391119480133},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16303107142448425}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8309219479560852},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6804982423782349},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6107749938964844},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5793497562408447},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5684136748313904},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5295432806015015},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5102322101593018},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4516819715499878},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4296901822090149},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.3872143626213074},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23039445281028748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1644391119480133},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16303107142448425},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0129054197000045","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054197000045","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:hdl:10068/40761","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/40761","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"R - Report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.5791","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.5791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-2959.ps.gz","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00073739v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00073739","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RR-2959, INRIA. 1996","raw_type":"Reports"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00073739v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00073739","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RR-2959, INRIA. 1996","raw_type":"Reports"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2545511463","https://openalex.org/W2106332846","https://openalex.org/W2956094179","https://openalex.org/W2245286458","https://openalex.org/W27741389","https://openalex.org/W1570967612","https://openalex.org/W2541348386","https://openalex.org/W2182592860","https://openalex.org/W2172075652","https://openalex.org/W2369829641"],"abstract_inverted_index":{"Consider":[0],"a":[1,11,17,47,93,149,189],"scheduling":[2,48,74,121,129,193,216],"problem":[3,49,75,194],"of":[4,95,102,122,130,137,141,144,165,184,195,246],"parallel":[5,12,145,196],"computations":[6],"in":[7,54,147],"multiprocessor":[8,150,254],"systems.":[9],"Let":[10],"program":[13],"be":[14,211,251],"modeled":[15],"by":[16],"task":[18],"graph,":[19],"where":[20,61,86,224],"vertices":[21],"represent":[22],"tasks":[23,37],"and":[24,109,128,232,249],"arcs":[25],"the":[26,55,59,73,84,103,139,142,160,163,171,177,180,191,214,221,225,233,244],"communications":[27,89,105],"between":[28],"tasks.":[29],"An":[30],"interprocessor":[31,62,88],"communication":[32,63,77,186,199,222],"time":[33,230],"incurs":[34],"when":[35],"two":[36,40,100,126],"assigned":[38],"to":[39,44,169,179,210,243,253],"different":[41],"processors":[42,127],"have":[43],"communicate.":[45],"Such":[46],"has":[50,228],"recently":[51],"been":[52],"studied":[53],"literature,":[56],"mostly":[57],"for":[58,116,162],"case":[60,85,164,183,227,235,245],"times":[64],"are":[65,209,240],"fully":[66],"determined.":[67],"In":[68],"this":[69],"paper,":[70],"we":[71,82],"consider":[72,83,99],"with":[76,106,198,213,256],"resource":[78,200],"constraints.":[79],"More":[80],"specifically,":[81],"all":[87],"take":[90],"place":[91],"on":[92,125,133,220],"network":[94],"bounded":[96],"capacity.":[97],"We":[98,112,157,174],"variants":[101],"problem:":[104],"independent-data":[107],"semantics":[108],"common-data":[110],"semantics.":[111],"show":[113],"that":[114],"even":[115],"very":[117],"specific":[118],"subproblems,":[119],"viz.":[120],"general":[123,182,192],"graphs":[124],"binary":[131],"trees":[132],"an":[134],"infinite":[135],"number":[136],"processors,":[138],"minimization":[140],"makespan":[143],"programs":[146,197],"such":[148],"system":[151],"is":[152,202,236],"strongly":[153,203],"[Formula:":[154,204],"see":[155,205],"text]-hard.":[156,206],"first":[158],"establish":[159],"results":[161,178,208,239],"capacity":[166],"1,":[167],"referred":[168],"as":[170],"single-bus":[172],"system.":[173],"then":[175],"extend":[176],"more":[181],"fixed":[185],"capacities.":[187],"As":[188],"consequence,":[190],"constraints":[201],"These":[207],"contrasted":[212],"corresponding":[215],"problems":[217],"without":[218],"contraint":[219],"capacity,":[223],"two-processor":[226],"unknown":[229],"complexity":[231],"infinite-processor":[234],"polynomial.":[237],"Our":[238],"also":[241],"extended":[242],"broadcasting":[247],"communications,":[248],"can":[250],"applied":[252],"systems":[255],"shared":[257],"memory.":[258]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}