{"id":"https://openalex.org/W3145315133","doi":"https://doi.org/10.1109/date.2010.5456924","title":"An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms","display_name":"An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W3145315133","doi":"https://doi.org/10.1109/date.2010.5456924","mag":"3145315133"},"language":"en","primary_location":{"id":"doi:10.1109/date.2010.5456924","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2010.5456924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)","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/A5075116884","display_name":"Alessio Bonfietti","orcid":null},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessio Bonfietti","raw_affiliation_strings":["DEIS, Universit\u00e0 di Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"DEIS, Universit\u00e0 di Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043408422","display_name":"Luca Benini","orcid":"https://orcid.org/0000-0001-8068-3806"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Benini","raw_affiliation_strings":["DEIS, Universit\u00e0 di Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"DEIS, Universit\u00e0 di Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027645414","display_name":"Michele Lombardi","orcid":"https://orcid.org/0000-0003-4709-8888"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Michele Lombardi","raw_affiliation_strings":["DEIS, Universit\u00e0 di Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"DEIS, Universit\u00e0 di Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071259603","display_name":"Michela Milano","orcid":"https://orcid.org/0000-0001-7379-1411"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Michela Milano","raw_affiliation_strings":["DEIS, Universit\u00e0 di Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"DEIS, Universit\u00e0 di Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075116884"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":null,"apc_paid":null,"fwci":3.2459,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.92868845,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"897","last_page":"902"},"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.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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization 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.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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7280264496803284},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6116642355918884},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.600124716758728},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5466433763504028},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4595367908477783},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4521616995334625},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33798813819885254},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19563519954681396},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.08729293942451477}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7280264496803284},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6116642355918884},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.600124716758728},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5466433763504028},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4595367908477783},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4521616995334625},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33798813819885254},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19563519954681396},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.08729293942451477},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/date.2010.5456924","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2010.5456924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)","raw_type":"proceedings-article"},{"id":"pmh:oai:cris.unibo.it:11585/91604","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/91604","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1722281513","https://openalex.org/W1845097675","https://openalex.org/W2033872646","https://openalex.org/W2091158003","https://openalex.org/W2097803659","https://openalex.org/W2102159907","https://openalex.org/W2108727711","https://openalex.org/W2171750993","https://openalex.org/W3147224349","https://openalex.org/W6638948550","https://openalex.org/W6658957694"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2186864281","https://openalex.org/W2107725657","https://openalex.org/W4255427455","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2148608945","https://openalex.org/W3112689649","https://openalex.org/W2998357381","https://openalex.org/W3204654320"],"abstract_inverted_index":{"Our":[0],"work":[1],"focuses":[2],"on":[3,32,61,100,110],"allocating":[4],"and":[5,35,68,106,115],"scheduling":[6,69],"a":[7,13,18,57,72,76,101],"synchronous":[8],"data-flow":[9],"(SDF)":[10],"graph":[11],"onto":[12],"multi-core":[14],"platform":[15],"subject":[16],"to":[17,46],"minimum":[19],"throughput":[20],"requirement.":[21],"This":[22],"problem":[23,33,53,70],"has":[24,97],"traditionally":[25],"be":[26,47],"tackled":[27],"by":[28,86],"incomplete":[29],"approaches":[30],"based":[31,60],"decomposition":[34],"local":[36],"search,":[37],"which":[38,64],"could":[39],"not":[40],"guarantee":[41],"optimality.":[42,94],"Exact":[43],"algorithms":[44],"used":[45],"considered":[48],"reasonable":[49],"only":[50],"for":[51],"small":[52],"instances.":[54],"We":[55,74],"propose":[56],"complete":[58,125],"algorithm":[59],"Constraint":[62],"Programming":[63],"solves":[65],"the":[66,89,122],"allocation":[67],"as":[71],"whole.":[73],"introduce":[75],"number":[77,102],"of":[78,103,112,118],"search":[79,90],"acceleration":[80],"techniques":[81],"that":[82],"significantly":[83],"reduce":[84],"run-time":[85],"aggressively":[87],"pruning":[88],"space":[91],"without":[92],"compromising":[93],"The":[95],"solver":[96],"been":[98],"tested":[99],"non-trivial":[104],"instances":[105],"demonstrated":[107],"promising":[108],"run-times":[109],"SDFGs":[111],"practical":[113],"size":[114],"one":[116],"order":[117],"magnitude":[119],"speed-up":[120],"w.r.t.":[121],"fastest":[123],"known":[124],"approach.":[126]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}