{"id":"https://openalex.org/W3145424633","doi":"https://doi.org/10.1109/aspdac.2011.5722178","title":"Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph","display_name":"Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W3145424633","doi":"https://doi.org/10.1109/aspdac.2011.5722178","mag":"3145424633"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2011.5722178","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)","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/A5062484967","display_name":"Tae Ho Shin","orcid":"https://orcid.org/0000-0002-9001-7863"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Tae-ho Shin","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028863978","display_name":"Hyunok Oh","orcid":"https://orcid.org/0000-0002-9044-7441"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyunok Oh","raw_affiliation_strings":["Hanyang University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Hanyang University, Seoul, South Korea","institution_ids":["https://openalex.org/I4575257"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029793438","display_name":"Soonhoi Ha","orcid":"https://orcid.org/0000-0001-7472-9142"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Soonhoi Ha","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062484967"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":1.2593,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.82561802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"42","issue":null,"first_page":"165","last_page":"170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design 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/T10904","display_name":"Embedded Systems Design 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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8401228785514832},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.7512799501419067},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7142564058303833},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6196119785308838},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5663764476776123},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5650032162666321},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.47100773453712463},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15182888507843018},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12853410840034485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0754111111164093}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8401228785514832},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.7512799501419067},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7142564058303833},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6196119785308838},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5663764476776123},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5650032162666321},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.47100773453712463},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15182888507843018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12853410840034485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0754111111164093},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2011.5722178","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1503117285","https://openalex.org/W1568192366","https://openalex.org/W1595885266","https://openalex.org/W2007007158","https://openalex.org/W2022826089","https://openalex.org/W2070385897","https://openalex.org/W2097803659","https://openalex.org/W2099736035","https://openalex.org/W2113870209","https://openalex.org/W2120431055","https://openalex.org/W2122432688","https://openalex.org/W2136453233","https://openalex.org/W2137325438","https://openalex.org/W2147947594","https://openalex.org/W2164731247","https://openalex.org/W2169268432","https://openalex.org/W6630022660","https://openalex.org/W6633991270","https://openalex.org/W6652160416","https://openalex.org/W6655860381","https://openalex.org/W6678354561","https://openalex.org/W6680278981"],"related_works":["https://openalex.org/W2150836909","https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W3003077338","https://openalex.org/W2225350526","https://openalex.org/W1545991362"],"abstract_inverted_index":{"This":[0,11],"paper":[1,12],"concerns":[2],"throughput-constrained":[3],"parallel":[4],"execution":[5],"of":[6,19,34,72,112],"synchronous":[7],"data":[8],"flow":[9],"graphs.":[10],"assumes":[13],"static":[14,26,60],"mapping":[15],"and":[16],"dynamic":[17,73],"scheduling":[18,27,49,61,74],"nodes,":[20],"which":[21,85],"has":[22],"several":[23],"benefits":[24],"over":[25],"approaches.":[28],"We":[29],"determine":[30],"the":[31,39,54,59,65,79,93,110,113],"buffer":[32,41],"size":[33,42],"all":[35],"arcs":[36],"to":[37,52,77,81],"minimize":[38],"total":[40],"while":[43],"satisfying":[44],"a":[45,99,103],"throughput":[46,56],"constraint.":[47],"Dynamic":[48],"is":[50,75,86,95],"able":[51],"achieve":[53],"similar":[55],"performance":[57],"as":[58],"does":[62],"by":[63],"unfolding":[64],"given":[66],"SDF":[67],"graph.":[68],"A":[69],"key":[70],"issue":[71],"how":[76],"assign":[78],"priority":[80],"each":[82],"node":[83],"invocation,":[84],"also":[87],"discussed":[88],"in":[89],"this":[90],"paper.":[91],"Since":[92],"problem":[94],"NP-hard,":[96],"we":[97],"present":[98],"heuristic":[100],"based":[101],"on":[102],"genetic":[104],"algorithm.":[105],"The":[106],"experimental":[107],"results":[108],"confirm":[109],"viability":[111],"proposed":[114],"technique.":[115]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}