{"id":"https://openalex.org/W4387947303","doi":"https://doi.org/10.23919/eusipco58844.2023.10290113","title":"Automated Clustering and Pipelining of Dataflow Actors for Controlled Scheduling Complexity","display_name":"Automated Clustering and Pipelining of Dataflow Actors for Controlled Scheduling Complexity","publication_year":2023,"publication_date":"2023-09-04","ids":{"openalex":"https://openalex.org/W4387947303","doi":"https://doi.org/10.23919/eusipco58844.2023.10290113"},"language":"en","primary_location":{"id":"doi:10.23919/eusipco58844.2023.10290113","is_oa":false,"landing_page_url":"http://dx.doi.org/10.23919/eusipco58844.2023.10290113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 31st European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-04253298/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082603671","display_name":"Oph\u00e9lie Renaud","orcid":"https://orcid.org/0009-0002-3336-8867"},"institutions":[{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]},{"id":"https://openalex.org/I28221208","display_name":"Institut National des Sciences Appliqu\u00e9es de Rennes","ror":"https://ror.org/04xaa4j22","country_code":"FR","type":"education","lineage":["https://openalex.org/I28221208"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Oph\u00e9lie Renaud","raw_affiliation_strings":["Univ Rennes, INSA Rennes,Rennes,France,35000"],"affiliations":[{"raw_affiliation_string":"Univ Rennes, INSA Rennes,Rennes,France,35000","institution_ids":["https://openalex.org/I28221208","https://openalex.org/I56067802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010548120","display_name":"Naouel Haggui","orcid":"https://orcid.org/0000-0001-7058-9162"},"institutions":[{"id":"https://openalex.org/I28221208","display_name":"Institut National des Sciences Appliqu\u00e9es de Rennes","ror":"https://ror.org/04xaa4j22","country_code":"FR","type":"education","lineage":["https://openalex.org/I28221208"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Naouel Haggui","raw_affiliation_strings":["Univ Rennes, INSA Rennes,Rennes,France,35000","LETI, Sfax, Tunisia"],"affiliations":[{"raw_affiliation_string":"Univ Rennes, INSA Rennes,Rennes,France,35000","institution_ids":["https://openalex.org/I28221208","https://openalex.org/I56067802"]},{"raw_affiliation_string":"LETI, Sfax, Tunisia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075043317","display_name":"Karol Desnos","orcid":"https://orcid.org/0000-0003-1527-9668"},"institutions":[{"id":"https://openalex.org/I28221208","display_name":"Institut National des Sciences Appliqu\u00e9es de Rennes","ror":"https://ror.org/04xaa4j22","country_code":"FR","type":"education","lineage":["https://openalex.org/I28221208"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Karol Desnos","raw_affiliation_strings":["Univ Rennes, INSA Rennes,Rennes,France,35000"],"affiliations":[{"raw_affiliation_string":"Univ Rennes, INSA Rennes,Rennes,France,35000","institution_ids":["https://openalex.org/I28221208","https://openalex.org/I56067802"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041007136","display_name":"Jean-Fran\u00e7ois Nezan","orcid":"https://orcid.org/0000-0002-0609-4592"},"institutions":[{"id":"https://openalex.org/I28221208","display_name":"Institut National des Sciences Appliqu\u00e9es de Rennes","ror":"https://ror.org/04xaa4j22","country_code":"FR","type":"education","lineage":["https://openalex.org/I28221208"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Fran\u00e7ois Nezan","raw_affiliation_strings":["Univ Rennes, INSA Rennes,Rennes,France,35000"],"affiliations":[{"raw_affiliation_string":"Univ Rennes, INSA Rennes,Rennes,France,35000","institution_ids":["https://openalex.org/I28221208","https://openalex.org/I56067802"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5082603671"],"corresponding_institution_ids":["https://openalex.org/I28221208","https://openalex.org/I56067802"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1587812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1698","last_page":"1702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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/dataflow","display_name":"Dataflow","score":0.9423617124557495},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8765021562576294},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7099052667617798},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6358246207237244},{"id":"https://openalex.org/keywords/dataflow-architecture","display_name":"Dataflow architecture","score":0.5496665835380554},{"id":"https://openalex.org/keywords/embarrassingly-parallel","display_name":"Embarrassingly parallel","score":0.5362315773963928},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.5141354203224182},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5120633244514465},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.45592430233955383},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.438827246427536},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4122953712940216},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3828901946544647},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33253854513168335},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.22834280133247375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17995700240135193},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10746535658836365}],"concepts":[{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.9423617124557495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8765021562576294},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7099052667617798},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6358246207237244},{"id":"https://openalex.org/C176727019","wikidata":"https://www.wikidata.org/wiki/Q1172415","display_name":"Dataflow architecture","level":3,"score":0.5496665835380554},{"id":"https://openalex.org/C126909462","wikidata":"https://www.wikidata.org/wiki/Q5369501","display_name":"Embarrassingly parallel","level":3,"score":0.5362315773963928},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.5141354203224182},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5120633244514465},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.45592430233955383},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.438827246427536},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4122953712940216},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3828901946544647},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33253854513168335},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.22834280133247375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17995700240135193},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10746535658836365},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/eusipco58844.2023.10290113","is_oa":false,"landing_page_url":"http://dx.doi.org/10.23919/eusipco58844.2023.10290113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 31st European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04253298v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04253298","pdf_url":"https://hal.science/hal-04253298/document","source":{"id":"https://openalex.org/S4406922451","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"EUSIPCO, EURASIP, Sep 2023, Helsiinki, Finland","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04253298v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04253298","pdf_url":"https://hal.science/hal-04253298/document","source":{"id":"https://openalex.org/S4406922451","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"EUSIPCO, EURASIP, Sep 2023, Helsiinki, Finland","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4387947303.pdf"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1682251649","https://openalex.org/W2012249456","https://openalex.org/W2113487338","https://openalex.org/W2120431055","https://openalex.org/W2158384169","https://openalex.org/W2894072380","https://openalex.org/W2898765698","https://openalex.org/W3096984461","https://openalex.org/W4210669150","https://openalex.org/W4367156163"],"related_works":["https://openalex.org/W2564598376","https://openalex.org/W1484403103","https://openalex.org/W2584408851","https://openalex.org/W2115158825","https://openalex.org/W2101960124","https://openalex.org/W4377693460","https://openalex.org/W2033683327","https://openalex.org/W2783505431","https://openalex.org/W2521947294","https://openalex.org/W4387672865"],"abstract_inverted_index":{"Dataflow":[0],"models":[1],"are":[2],"efficient":[3],"programming":[4],"paradigms":[5],"for":[6,37,111],"expressing":[7],"the":[8,28,59,63,102],"parallelism":[9,30],"of":[10],"an":[11,44],"application.":[12],"Dataflow-based":[13],"resource":[14],"allocation":[15],"methods":[16],"on":[17,22],"multicore":[18],"architectures":[19],"usually":[20],"rely":[21],"complex":[23,35],"graph":[24,51],"transformations":[25],"to":[26,62,85,98,101],"explicit":[27],"application":[29,71],"which":[31,106],"can":[32],"result":[33],"in":[34,90],"graphs":[36],"embarrassingly":[38],"parallel":[39],"applications.":[40,113],"This":[41],"paper":[42],"presents":[43],"automated":[45],"method":[46,79],"that":[47],"efficiently":[48],"manages":[49],"pre-scheduling":[50],"complexity,":[52],"pipelines":[53],"sequential":[54],"parts,":[55],"and":[56,73],"optimally":[57],"adapts":[58],"dataflow":[60],"model":[61],"target":[64],"architecture,":[65],"striking":[66],"a":[67],"superior":[68],"balance":[69],"between":[70],"complexity":[72],"performance":[74],"than":[75],"existing":[76],"methods.":[77],"Our":[78],"surpasses":[80],"state-of-the-art":[81],"techniques,":[82],"achieving":[83],"up":[84],"1.8":[86],"times":[87],"higher":[88],"throughputs":[89],"experiments.":[91],"It":[92],"also":[93],"significantly":[94],"reduces":[95],"analysis":[96],"time":[97],"seconds":[99],"compared":[100],"original":[103],"PREESM":[104],"method,":[105],"could":[107],"take":[108],"several":[109],"days":[110],"fine-grained":[112]},"counts_by_year":[],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}