{"id":"https://openalex.org/W2169268432","doi":"https://doi.org/10.1145/1146909.1147138","title":"Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs","display_name":"Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2169268432","doi":"https://doi.org/10.1145/1146909.1147138","mag":"2169268432"},"language":"en","primary_location":{"id":"doi:10.1145/1146909.1147138","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146909.1147138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd annual conference on Design automation  - DAC '06","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/1953293/711003.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032436846","display_name":"Sander Stuijk","orcid":"https://orcid.org/0000-0002-2518-6847"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sander Stuijk","raw_affiliation_strings":["Eindhoven University of Technology"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063550119","display_name":"Marc Geilen","orcid":"https://orcid.org/0000-0002-2629-3249"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Marc Geilen","raw_affiliation_strings":["Eindhoven University of Technology"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026760188","display_name":"Twan Basten","orcid":"https://orcid.org/0000-0002-2274-7274"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Twan Basten","raw_affiliation_strings":["Eindhoven University of Technology"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032436846"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":18.6068,"has_fulltext":true,"cited_by_count":185,"citation_normalized_percentile":{"value":0.99346994,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"899","last_page":"899"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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.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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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/dataflow","display_name":"Dataflow","score":0.9376274347305298},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8081687688827515},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.7896792888641357},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5178216099739075},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5101397633552551},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44851237535476685},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.370417982339859},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.272074818611145},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.11416718363761902}],"concepts":[{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.9376274347305298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8081687688827515},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.7896792888641357},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5178216099739075},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5101397633552551},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44851237535476685},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.370417982339859},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.272074818611145},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.11416718363761902},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1146909.1147138","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146909.1147138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd annual conference on Design automation  - DAC '06","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/3ed97541-637b-4481-9cf5-13d51b95618e","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/3ed97541-637b-4481-9cf5-13d51b95618e","pdf_url":"https://pure.tue.nl/ws/files/1953293/711003.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"Stuijk, S, Geilen, M C W & Basten, T 2006, Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. ES reports, vol. 2006-01, Technische Universiteit Eindhoven, Eindhoven.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/7c09fa15-9b88-499e-a97b-6a492b4e1f0e","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/7c09fa15-9b88-499e-a97b-6a492b4e1f0e","pdf_url":"https://research.tue.nl/files/2477609/711006.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"Stuijk, S, Geilen, M C W & Basten, T 2005, Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. ES reports, vol. 2005-07, Technische Universiteit Eindhoven, Eindhoven.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.6176","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.6176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.ele.tue.nl/~mgeilen/publications/final_dac06.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:711003","is_oa":false,"landing_page_url":"http://repository.tue.nl/711003","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"External research report"},{"id":"pmh:oai:library.tue.nl:711006","is_oa":false,"landing_page_url":"http://repository.tue.nl/711006","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"External research report"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/3ed97541-637b-4481-9cf5-13d51b95618e","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/3ed97541-637b-4481-9cf5-13d51b95618e","pdf_url":"https://pure.tue.nl/ws/files/1953293/711003.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"Stuijk, S, Geilen, M C W & Basten, T 2006, Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. ES reports, vol. 2006-01, Technische Universiteit Eindhoven, Eindhoven.","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[{"score":0.5699999928474426,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2169268432.pdf","grobid_xml":"https://content.openalex.org/works/W2169268432.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1534958051","https://openalex.org/W1595885266","https://openalex.org/W1867684417","https://openalex.org/W1917201943","https://openalex.org/W1943502734","https://openalex.org/W2000625751","https://openalex.org/W2031258626","https://openalex.org/W2033872646","https://openalex.org/W2055649415","https://openalex.org/W2097803659","https://openalex.org/W2104922219","https://openalex.org/W2108727711","https://openalex.org/W2119773132","https://openalex.org/W2120431055","https://openalex.org/W2122113444","https://openalex.org/W2131065168","https://openalex.org/W2131111769","https://openalex.org/W2145133893","https://openalex.org/W2155161598","https://openalex.org/W2156468283","https://openalex.org/W2164084134"],"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":{"Multimedia":[0],"applications":[1,26],"usually":[2],"have":[3],"throughput":[4,56,78],"constraints.":[5],"An":[6],"implementation":[7],"must":[8],"meet":[9],"these":[10,25,38],"constraints,":[11],"while":[12],"it":[13],"minimizes":[14],"resource":[15],"usage":[16],"and":[17,57],"energy":[18],"consumption.":[19],"The":[20,80],"compute":[21],"intensive":[22],"kernels":[23],"of":[24,55,82,90],"are":[27],"often":[28],"specified":[29],"as":[30],"Synchronous":[31],"Dataflow":[32],"Graphs.":[33],"Communication":[34],"between":[35],"nodes":[36],"in":[37],"graphs":[39],"requires":[40],"storage":[41,58,68],"space":[42,54,69],"which":[43,60],"influences":[44],"throughput.":[45],"We":[46],"present":[47],"exact":[48],"techniques":[49],"to":[50,64,71],"chart":[51],"the":[52,66,83],"Pareto":[53],"trade-offs,":[59],"can":[61],"be":[62],"used":[63],"determine":[65],"minimal":[67],"needed":[70],"execute":[72],"a":[73,76,88],"graph":[74],"under":[75],"given":[77],"constraint.":[79],"feasibility":[81],"approach":[84],"is":[85],"demonstrated":[86],"with":[87],"number":[89],"examples.":[91]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}