{"id":"https://openalex.org/W4237441975","doi":"https://doi.org/10.1109/aspdac.2006.1594734","title":"Memory optimal single appearance schedule with dynamic loop count for synchronous dataflow graphs","display_name":"Memory optimal single appearance schedule with dynamic loop count for synchronous dataflow graphs","publication_year":2006,"publication_date":"2006-03-22","ids":{"openalex":"https://openalex.org/W4237441975","doi":"https://doi.org/10.1109/aspdac.2006.1594734"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2006.1594734","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594734","pdf_url":null,"source":{"id":"https://openalex.org/S4363608292","display_name":"Asia and South Pacific Conference on Design Automation, 2006.","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia and South Pacific Conference on Design Automation, 2006.","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/A5028863978","display_name":"Hyunok Oh","orcid":"https://orcid.org/0000-0002-9044-7441"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hyunok Oh","raw_affiliation_strings":["Center for Embedded Computer Systems, University of California, Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"Center for Embedded Computer Systems, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007817952","display_name":"Nikil Dutt","orcid":"https://orcid.org/0000-0002-3060-8119"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikil Dutt","raw_affiliation_strings":["Center for Embedded Computer Systems, University of California, Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"Center for Embedded Computer Systems, University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"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":["School of EECS, Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"School of EECS, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028863978"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":0.5138,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64705882,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"8","issue":null,"first_page":"497","last_page":"502"},"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.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.9998000264167786,"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.8908219337463379},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8616673946380615},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.7766019105911255},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7497255206108093},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6117768287658691},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.45939111709594727},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.41844186186790466},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3901951313018799},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3233796954154968},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.10932397842407227},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0768531858921051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07288652658462524}],"concepts":[{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.8908219337463379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8616673946380615},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.7766019105911255},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7497255206108093},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6117768287658691},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.45939111709594727},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.41844186186790466},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3901951313018799},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3233796954154968},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.10932397842407227},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0768531858921051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07288652658462524},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2006.1594734","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594734","pdf_url":null,"source":{"id":"https://openalex.org/S4363608292","display_name":"Asia and South Pacific Conference on Design Automation, 2006.","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia and South Pacific Conference on Design Automation, 2006.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.49000000953674316,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1496267491","https://openalex.org/W1762282578","https://openalex.org/W1917201943","https://openalex.org/W1985072157","https://openalex.org/W2000625751","https://openalex.org/W2074349000","https://openalex.org/W2099572296","https://openalex.org/W2120431055","https://openalex.org/W2135650100","https://openalex.org/W2140673616","https://openalex.org/W2164084134","https://openalex.org/W6629762304"],"related_works":["https://openalex.org/W2293118914","https://openalex.org/W2998381397","https://openalex.org/W4236419692","https://openalex.org/W2171015181","https://openalex.org/W3167919718","https://openalex.org/W4251718783","https://openalex.org/W4239447582","https://openalex.org/W1484403103","https://openalex.org/W2521947294","https://openalex.org/W2907307640"],"abstract_inverted_index":{"In":[0,134],"this":[1],"paper,":[2],"we":[3,140],"propose":[4,141],"a":[5,24,50,67,75,83],"new":[6],"single":[7,25,84,105,165],"appearance":[8,26,31,85,106,166],"schedule":[9,27,53,76,81,86,99,107,167],"for":[10,113,121],"synchronous":[11,115],"dataflow":[12,116],"programs":[13],"to":[14,65,73,103,136],"minimize":[15,137],"data":[16,45,90],"memory":[17,20,46,91,154],"and":[18],"code":[19,87],"size":[21,112],"simultaneously.":[22],"While":[23],"promises":[28],"only":[29,119],"one":[30],"of":[32,44,60,70,129],"each":[33],"node":[34],"definition":[35],"in":[36],"the":[37,61,122,138,148,163],"generated":[38],"code,":[39],"it":[40],"requires":[41,109],"significant":[42],"amount":[43],"overhead":[47,128,139,160],"compared":[48,161],"with":[49,88,155,162],"buffer":[51,97,111],"optimal":[52,98,110],"allowing":[54],"multiple":[55],"appearance.":[56],"The":[57,78,118],"key":[58],"idea":[59],"proposed":[62,79,123,149],"technique":[63,124],"is":[64,125],"make":[66,74],"dynamic":[68],"decision":[69],"loop":[71,131],"count":[72],"quasi-static.":[77],"quasi-static":[80],"produces":[82],"minimum":[89],"requirement.":[92],"We":[93],"prove":[94],"that":[95,147],"every":[96],"can":[100],"be":[101],"transformed":[102],"our":[104],"which":[108],"arbitrary":[114],"graphs.":[117],"penalty":[120],"slight":[126],"performance":[127,159],"computing":[130],"counts":[132],"dynamically.":[133],"order":[135],"optimization":[142],"techniques.":[143],"Experimental":[144],"results":[145],"show":[146],"algorithm":[150],"reduces":[151],"20%":[152],"total":[153],"less":[156],"than":[157],"1%":[158],"previous":[164],"algorithms.":[168]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}