{"id":"https://openalex.org/W1699607384","doi":"https://doi.org/10.1109/ipdps.2003.1213103","title":"Master-slave tasking on heterogeneous processors","display_name":"Master-slave tasking on heterogeneous processors","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W1699607384","doi":"https://doi.org/10.1109/ipdps.2003.1213103","mag":"1699607384"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2003.1213103","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00001081","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004264253","display_name":"Pierre-Fran\u00e7ois Dutot","orcid":"https://orcid.org/0000-0002-1992-3388"},"institutions":[{"id":"https://openalex.org/I4390039363","display_name":"Infection et inflammation","ror":"https://ror.org/021sh3243","country_code":null,"type":"facility","lineage":["https://openalex.org/I154526488","https://openalex.org/I195731000","https://openalex.org/I277688954","https://openalex.org/I4390039363"]},{"id":"https://openalex.org/I4210161189","display_name":"ProbaYes (France)","ror":"https://ror.org/05nb5x242","country_code":"FR","type":"company","lineage":["https://openalex.org/I4210161189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"P.-F. Dutot","raw_affiliation_strings":["Laboratoire ID-IMAG, Montbonnot Saint Martin, France","Lab. ID-IMAG, Montbonnot Saint Martin, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire ID-IMAG, Montbonnot Saint Martin, France","institution_ids":["https://openalex.org/I4390039363"]},{"raw_affiliation_string":"Lab. ID-IMAG, Montbonnot Saint Martin, France","institution_ids":["https://openalex.org/I4210161189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004264253"],"corresponding_institution_ids":["https://openalex.org/I4390039363","https://openalex.org/I4210161189"],"apc_list":null,"apc_paid":null,"fwci":2.59878581,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90274805,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"7"},"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.9995999932289124,"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.9995999932289124,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987999796867371,"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.813015341758728},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7181228399276733},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5863951444625854},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.580547571182251},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5772875547409058},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.487650990486145},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.4772374629974365},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4654916524887085},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43318045139312744},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40864476561546326},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3515932261943817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2600213885307312},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15686938166618347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14904344081878662},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.08514797687530518},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07833871245384216}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.813015341758728},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7181228399276733},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5863951444625854},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.580547571182251},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5772875547409058},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.487650990486145},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.4772374629974365},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4654916524887085},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43318045139312744},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40864476561546326},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3515932261943817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2600213885307312},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15686938166618347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14904344081878662},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.08514797687530518},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07833871245384216}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ipdps.2003.1213103","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00789462v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00789462","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA\\'2001), 2001, Unknown, pp.857\u2015863, ⟨10.1109/IPDPS.2003.1213103⟩","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:inria-00001081v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00001081","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":"International Parallel and Distributed Processing Symposium, Apr 2003, Nice, France","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00001081v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00001081","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":"International Parallel and Distributed Processing Symposium, Apr 2003, Nice, France","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1806993166","https://openalex.org/W1966806648","https://openalex.org/W1983347794","https://openalex.org/W1992067203","https://openalex.org/W2036894611","https://openalex.org/W2112247880","https://openalex.org/W2127151535","https://openalex.org/W2166756071","https://openalex.org/W6677065205"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2016668986","https://openalex.org/W1966261337","https://openalex.org/W1476716791","https://openalex.org/W2010003189","https://openalex.org/W2077711297","https://openalex.org/W2171398663","https://openalex.org/W1969571387","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"In":[0],"this":[1,98,110],"paper,":[2],"we":[3],"consider":[4],"the":[5,60,66,73,85,91,106],"problem":[6],"of":[7,51,59,68,75,87,93,116],"scheduling":[8],"independent":[9],"identical":[10],"tasks":[11,88],"on":[12,54],"heterogeneous":[13],"processors":[14,52],"where":[15,82],"communication":[16],"times":[17,20],"and":[18,39,71,89],"processing":[19],"are":[21],"differ-":[22],"ent.":[23],"We":[24,45,96,108],"assume":[25],"that":[26],"communication-computation":[27],"overlap":[28],"is":[29,63,79,84],"possible":[30],"for":[31,49],"every":[32],"processor,":[33],"but":[34],"only":[35],"allow":[36],"one":[37,40],"send":[38],"receive":[41],"at":[42],"a":[43,113],"time.":[44],"propose":[46],"an":[47,55],"algorithm":[48,99],"chains":[50],"based":[53],"iterative":[56],"backward":[57],"construction":[58],"schedule,":[61],"which":[62],"polynomial":[64],"in":[65,72],"number":[67,74,86,92],"proces-":[69,94],"sors":[70],"tasks.":[76],"The":[77],"complexity":[78],"O(np2":[80],")":[81],"n":[83],"p":[90],"sors.":[95],"prove":[97],"to":[100,105,112],"be":[101],"optimal":[102],"with":[103],"respect":[104],"makespan.":[107],"extend":[109],"result":[111],"special":[114],"kind":[115],"tree":[117],"called":[118],"spider":[119],"graphs.":[120]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}