{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:26:08Z","timestamp":1759332368223,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":75,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T00:00:00Z","timestamp":1655164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,14]]},"DOI":"10.1145\/3519941.3535076","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T18:27:39Z","timestamp":1654885659000},"page":"133-145","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Code generation criteria for buffered exposed datapath architectures from dataflow graphs"],"prefix":"10.1145","author":[{"given":"Klaus","family":"Schneider","sequence":"first","affiliation":[{"name":"University of Kaiserslautern, Germany"}]},{"given":"Anoop","family":"Bhagyanath","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern, Germany"}]},{"given":"Julius","family":"Roob","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00697-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. Anders A. Bhagyanath and K. Schneider. 2018. On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units. In Application of Concurrency to System Design (ACSD) T. Chatain and R. Grosu (Eds.). IEEE Computer Society Bratislava Slovakia. 115\u2013124. M. Anders A. Bhagyanath and K. Schneider. 2018. On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units. In Application of Concurrency to System Design (ACSD) T. Chatain and R. Grosu (Eds.). IEEE Computer Society Bratislava Slovakia. 115\u2013124.","DOI":"10.1109\/ACSD.2018.00020"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"M.A. Bekos H. F\u00f6rster M. Gronemann T. Mchedlidze F. Montecchiani C. Raftopoulou and T. Ueckerdt. 2019. Planar Graphs of Bounded Degree have Constant Queue Number. arXiv.org. M.A. Bekos H. F\u00f6rster M. Gronemann T. Mchedlidze F. Montecchiani C. Raftopoulou and T. Ueckerdt. 2019. Planar Graphs of Bounded Degree have Constant Queue Number. arXiv.org.","DOI":"10.1145\/3313276.3316324"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"A. Bhagyanath and K. Schneider. 2016. Optimal Compilation for Exposed Datapath Architectures with Buffered Processing Units by SAT Solvers. In Formal Methods and Models for Codesign (MEMOCODE) E. Leonard and K. Schneider (Eds.). IEEE Computer Society Kanpur India. 143\u2013152. A. Bhagyanath and K. Schneider. 2016. Optimal Compilation for Exposed Datapath Architectures with Buffered Processing Units by SAT Solvers. In Formal Methods and Models for Codesign (MEMOCODE) E. Leonard and K. Schneider (Eds.). IEEE Computer Society Kanpur India. 143\u2013152.","DOI":"10.1109\/MEMCOD.2016.7797759"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"A. Bhagyanath and K. Schneider. 2017. Exploring Different Execution Paradigms in Exposed Datapath Architectures with Buffered Processing Units. In International Conference on Embedded Computer Systems: Architectures Modeling and Simulation (SAMOS) Y. Patt and S.K. Nandy (Eds.). IEEE Computer Society Samos Greece. 1\u201310. A. Bhagyanath and K. Schneider. 2017. Exploring Different Execution Paradigms in Exposed Datapath Architectures with Buffered Processing Units. In International Conference on Embedded Computer Systems: Architectures Modeling and Simulation (SAMOS) Y. Patt and S.K. Nandy (Eds.). IEEE Computer Society Samos Greece. 1\u201310.","DOI":"10.1109\/SAMOS.2017.8344605"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"A. Bhagyanath and K. Schneider. 2017. Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units. In Application of Concurrency to System Design (ACSD) A. Legay and K. Schneider (Eds.). IEEE Computer Society Zaragoza Spain. 106\u2013115. A. Bhagyanath and K. Schneider. 2017. Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units. In Application of Concurrency to System Design (ACSD) A. Legay and K. Schneider (Eds.). IEEE Computer Society Zaragoza Spain. 106\u2013115.","DOI":"10.1109\/ACSD.2017.20"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2009.934110"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90019-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Vytopil (Ed.) (LNCS","volume":"147","author":"Breveglieri L.","unstructured":"L. Breveglieri , A. Cherubini , and S. Crespi-Reghizzi . 1991. Real-time scheduling by queue automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFTS), J . Vytopil (Ed.) (LNCS , Vol. 571). Springer, Nijmegen, The Netherlands. 131\u2013 147 . L. Breveglieri, A. Cherubini, and S. Crespi-Reghizzi. 1991. Real-time scheduling by queue automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFTS), J. Vytopil (Ed.) (LNCS, Vol. 571). Springer, Nijmegen, The Netherlands. 131\u2013147."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009501"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.65"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90053-5"},{"key":"e_1_3_2_1_14_1","volume-title":"Design of Transport Triggered Architectures. In Great Lakes Symposium on VLSI (GLSVLSI). IEEE Computer Society","author":"H. Corp","year":"1994","unstructured":"H. Corp oraal. 1994 . Design of Transport Triggered Architectures. In Great Lakes Symposium on VLSI (GLSVLSI). IEEE Computer Society , Notre Dame, IN, USA. 130\u2013135. H. Corporaal. 1994. Design of Transport Triggered Architectures. In Great Lakes Symposium on VLSI (GLSVLSI). IEEE Computer Society, Notre Dame, IN, USA. 130\u2013135."},{"key":"e_1_3_2_1_15_1","first-page":"12","article-title":"TTAs: Missing the ILP complexity wall","volume":"45","author":"H. Corp","year":"1999","unstructured":"H. Corp oraal. 1999 . TTAs: Missing the ILP complexity wall . Journal of Systems Architecture , 45 , 12 - 13 (1999), June, 949\u2013973. H. Corporaal. 1999. TTAs: Missing the ILP complexity wall. Journal of Systems Architecture, 45, 12-13 (1999), June, 949\u2013973.","journal-title":"Journal of Systems Architecture"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007511206083"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000170"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)00014-X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"G. Di Battista F. Frati and J. Pach. 2010. On the Queue Number of Planar Graphs. In Foundations of Computer Science (FOCS). IEEE Computer Society Las Vegas NV USA. 365\u2013374. G. Di Battista F. Frati and J. Pach. 2010. On the Queue Number of Planar Graphs. In Foundations of Computer Science (FOCS). IEEE Computer Society Las Vegas NV USA. 365\u2013374.","DOI":"10.1109\/FOCS.2010.42"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/130908051"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"V. Dujmovic G. Joret P. Micek P. Morin T. Ueckerdt and D.R. Wood. 2019. Planar Graphs have Bounded Queue-Number. In Foundations of Computer Science (FOCS). IEEE Computer Society Baltimore MD USA. 862\u2013875. V. Dujmovic G. Joret P. Micek P. Morin T. Ueckerdt and D.R. Wood. 2019. Planar Graphs have Bounded Queue-Number. In Foundations of Computer Science (FOCS). IEEE Computer Society Baltimore MD USA. 862\u2013875.","DOI":"10.1109\/FOCS.2019.00056"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385731"},{"key":"e_1_3_2_1_23_1","unstructured":"V. Dujmovi\u0107. 2013. Graph Layouts via Layered Separators. arXiv.org. V. Dujmovi\u0107. 2013. Graph Layouts via Layered Separators. arXiv.org."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"V. Dujmovi\u0107 D. Eppstein R. Hickingbotham P. Morin and D.R. Wood. 2021. Stack-number is not bounded by queue-number. arXiv.org. V. Dujmovi\u0107 D. Eppstein R. Hickingbotham P. Morin and D.R. Wood. 2021. Stack-number is not bounded by queue-number. arXiv.org.","DOI":"10.1007\/s00493-021-4585-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"V. Dujmovi\u0107 G. Joret P. Micek P. Morin T. Ueckerdt and D.R. Wood. 2020. Planar graphs have bounded queue-number. arXiv.org. V. Dujmovi\u0107 G. Joret P. Micek P. Morin T. Ueckerdt and D.R. Wood. 2020. Planar graphs have bounded queue-number. arXiv.org.","DOI":"10.1109\/FOCS.2019.00056"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"V. Dujmovi\u0107 P. Morin and D.R. Wood. 2013. Layered Separators for Queue Layouts 3D Graph Drawing and Nonrepetitive Coloring. In Foundations of Computer Science (FOCS). IEEE Computer Society Berkeley CA USA. 280\u2013289. V. Dujmovi\u0107 P. Morin and D.R. Wood. 2013. Layered Separators for Queue Layouts 3D Graph Drawing and Nonrepetitive Coloring. In Foundations of Computer Science (FOCS). IEEE Computer Society Berkeley CA USA. 280\u2013289.","DOI":"10.1109\/FOCS.2013.38"},{"key":"e_1_3_2_1_27_1","unstructured":"V. Dujmovi\u0107 P. Morin and D.R. Wood. 2019. Queue Layouts of Graphs with Bounded Degree and Bounded Genus. arXiv.org. V. Dujmovi\u0107 P. Morin and D.R. Wood. 2019. Queue Layouts of Graphs with Bounded Degree and Bounded Genus. arXiv.org."},{"key":"e_1_3_2_1_28_1","unstructured":"P. Eades and D. Kelly. 1986. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria 21-A (1986) 89\u201398. P. Eades and D. Kelly. 1986. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria 21-A (1986) 89\u201398."},{"volume-title":"Australian Computer Science Conference","author":"Eades P.","key":"e_1_3_2_1_29_1","unstructured":"P. Eades , B.D. McKay , and N.C. Wormald . 1986. On an Edge Crossing Problem . In Australian Computer Science Conference . Australian National University. 327\u2013334. P. Eades, B.D. McKay, and N.C. Wormald. 1986. On an Edge Crossing Problem. In Australian Computer Science Conference. Australian National University. 327\u2013334."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90179-1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187020"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01205666"},{"key":"e_1_3_2_1_33_1","volume-title":"Truthe (Eds.) (LNCS","volume":"13","author":"Esparza J.","unstructured":"J. Esparza , M. Luttenberger , and M. Schlund . 2014. A Brief History of Strahler Numbers. In Language and Automata Theory and Applications (LATA), A.-H. Dediu, C. Martin-Vide, J.L. Sierra-Rodriguez, and B . Truthe (Eds.) (LNCS , Vol. 8370). Springer, Madrid, Spain. 1\u2013 13 . J. Esparza, M. Luttenberger, and M. Schlund. 2014. A Brief History of Strahler Numbers. In Language and Automata Theory and Applications (LATA), A.-H. Dediu, C. Martin-Vide, J.L. Sierra-Rodriguez, and B. Truthe (Eds.) (LNCS, Vol. 8370). Springer, Madrid, Spain. 1\u201313."},{"key":"e_1_3_2_1_34_1","volume-title":"H\u00e4ndler (Eds.) (LNCS","volume":"47","author":"Feller M.","unstructured":"M. Feller and M.D. Ercegovac . 1981. Queue machines: An organization for parallel computation. In Conpar 81, W. Brauer, P. Brinch Hansen, D. Gries, C. Moler, G. Seegm\u00fcller, J. Stoer, N. Wirth, and W . H\u00e4ndler (Eds.) (LNCS , Vol. 111). Springer, N\u00fcrnberg, Germany. 37\u2013 47 . M. Feller and M.D. Ercegovac. 1981. Queue machines: An organization for parallel computation. In Conpar 81, W. Brauer, P. Brinch Hansen, D. Gries, C. Moler, G. Seegm\u00fcller, J. Stoer, N. Wirth, and W. H\u00e4ndler (Eds.) (LNCS, Vol. 111). Springer, N\u00fcrnberg, Germany. 37\u201347."},{"key":"e_1_3_2_1_35_1","volume-title":"Italian Conference on Algorithms and Complexity (CIAC), G. Bongiovanni, D.P. Bovet, and G. Di Battista (Eds.) (LNCS","volume":"134","author":"F\u00f6\u00dfmeier U.","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann . 1997. Nice drawings for planar bipartite graphs . In Italian Conference on Algorithms and Complexity (CIAC), G. Bongiovanni, D.P. Bovet, and G. Di Battista (Eds.) (LNCS , Vol. 1203). Springer, Rome, Italy. 122\u2013 134 . U. F\u00f6\u00dfmeier and M. Kaufmann. 1997. Nice drawings for planar bipartite graphs. In Italian Conference on Algorithms and Complexity (CIAC), G. Bongiovanni, D.P. Bovet, and G. Di Battista (Eds.) (LNCS, Vol. 1203). Springer, Rome, Italy. 122\u2013134."},{"key":"e_1_3_2_1_36_1","volume-title":"Brandes and S. Cornelsen (Eds.) (LNCS","volume":"249","author":"Gange G.","unstructured":"G. Gange , P.J. Stuckey , and K. Marriott . 2011. Optimal k-Level Planarization and Crossing Minimization. In Graph Drawing (GD), U . Brandes and S. Cornelsen (Eds.) (LNCS , Vol. 6502). Springer, Konstanz, Germany. 238\u2013 249 . G. Gange, P.J. Stuckey, and K. Marriott. 2011. Optimal k-Level Planarization and Crossing Minimization. In Graph Drawing (GD), U. Brandes and S. Cornelsen (Eds.) (LNCS, Vol. 6502). Springer, Konstanz, Germany. 238\u2013249."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0604033"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-005-0290-3"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"V. Govindaraju C.-H. Ho T. Nowatzki J. Chhugani N. Satish K. Sankaralingam and C. Kim. 2012. DySER: Unifying Functionality and Parallelism Specialization for Energy-Efficient Computing. IEEE Micro 33 5 (2012). V. Govindaraju C.-H. Ho T. Nowatzki J. Chhugani N. Satish K. Sankaralingam and C. Kim. 2012. DySER: Unifying Functionality and Parallelism Specialization for Energy-Efficient Computing. IEEE Micro 33 5 (2012).","DOI":"10.1109\/MM.2012.51"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90067-8"},{"key":"e_1_3_2_1_41_1","volume-title":"Kratochv\u00edl (Ed.) (LNCS","volume":"216","author":"Healy P.","unstructured":"P. Healy and A. Kuusik . 1999. The vertex-exchange graph: A new concept for multi-level crossing minimisation. In Graph Drawing (GD), J . Kratochv\u00edl (Ed.) (LNCS , Vol. 1731). Springer, \u0160ti\u0159\u00edn Castle, Czech Republic. 205\u2013 216 . P. Healy and A. Kuusik. 1999. The vertex-exchange graph: A new concept for multi-level crossing minimisation. In Graph Drawing (GD), J. Kratochv\u00edl (Ed.) (LNCS, Vol. 1731). Springer, \u0160ti\u0159\u00edn Castle, Czech Republic. 205\u2013216."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405031"},{"key":"e_1_3_2_1_43_1","volume-title":"Brandenburg (Ed.) (LNCS","volume":"311","author":"Heath L.S.","unstructured":"L.S. Heath and S.V. Pemmaraju . 1996. Recognizing Leveled-Planar DAGs in Linear Time. In Graph Drawing (GD), F.J . Brandenburg (Ed.) (LNCS , Vol. 1027). Springer, Passau, Germany. 300\u2013 311 . L.S. Heath and S.V. Pemmaraju. 1996. Recognizing Leveled-Planar DAGs in Linear Time. In Graph Drawing (GD), F.J. Brandenburg (Ed.) (LNCS, Vol. 1027). Springer, Passau, Germany. 300\u2013311."},{"key":"e_1_3_2_1_44_1","first-page":"599","article-title":"Stack and Queue Layouts of Posets","volume":"10","author":"Heath L.S.","year":"1997","unstructured":"L.S. Heath and S.V. Pemmaraju . 1997 . Stack and Queue Layouts of Posets . SIAM J. Comput. , 10 , 4 (1997), 599 \u2013 625 . L.S. Heath and S.V. Pemmaraju. 1997. Stack and Queue Layouts of Posets. SIAM J. Comput., 10, 4 (1997), 599\u2013625.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291550"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280287"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221055"},{"key":"e_1_3_2_1_48_1","volume-title":"Fritzson (Ed.) (LNCS","volume":"449","author":"J. Hoogerbrugge and H. Corp","unstructured":"J. Hoogerbrugge and H. Corp oraal . 1994. Transport-Triggering vs. Operation-Triggering. In Compiler Construction (CC), P . Fritzson (Ed.) (LNCS , Vol. 786). Springer, Edinburgh, UK. 435\u2013 449 . J. Hoogerbrugge and H. Corporaal. 1994. Transport-Triggering vs. Operation-Triggering. In Compiler Construction (CC), P. Fritzson (Ed.) (LNCS, Vol. 786). Springer, Edinburgh, UK. 435\u2013449."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.1988.5222"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90011-6"},{"volume-title":"Transport-Triggered Soft Cores. In International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE Computer Society","author":"J\u00e4\u00e4skel\u00e4inen P.","key":"e_1_3_2_1_52_1","unstructured":"P. J\u00e4\u00e4skel\u00e4inen , A. Tervo , G.P. Vay\u00e1 , T. Viitanen , N. Behmann , and H. Blume . 2018 . Transport-Triggered Soft Cores. In International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE Computer Society , Vancouver, BC, Canada. P. J\u00e4\u00e4skel\u00e4inen, A. Tervo, G.P. Vay\u00e1, T. Viitanen, N. Behmann, and H. Blume. 2018. Transport-Triggered Soft Cores. In International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE Computer Society, Vancouver, BC, Canada."},{"key":"e_1_3_2_1_53_1","volume-title":"Whitesides (Ed.) (LNCS","volume":"237","author":"J\u00fcnger M.","unstructured":"M. J\u00fcnger , S. Leipert , and P. Mutzel . 1998. Level Planarity Testing in Linear Time. In Graph Drawing (GD), S.H . Whitesides (Ed.) (LNCS , Vol. 1547). Springer, Montr\u00e9al, Canada. 224\u2013 237 . M. J\u00fcnger, S. Leipert, and P. Mutzel. 1998. Level Planarity Testing in Linear Time. In Graph Drawing (GD), S.H. Whitesides (Ed.) (LNCS, Vol. 1547). Springer, Montr\u00e9al, Canada. 224\u2013237."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.709399"},{"key":"e_1_3_2_1_55_1","volume-title":"Brandenburg (Ed.) (LNCS","volume":"348","author":"J\u00fcnger M.","unstructured":"M. J\u00fcnger and P. Mutzel . 1996. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In Graph Drawing (GD), F.J . Brandenburg (Ed.) (LNCS , Vol. 1027). Springer, Passau, Germany. 337\u2013 348 . M. J\u00fcnger and P. Mutzel. 1996. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In Graph Drawing (GD), F.J. Brandenburg (Ed.) (LNCS, Vol. 1027). Springer, Passau, Germany. 337\u2013348."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00001"},{"volume-title":"The Semantics of a Simple Language for Parallel Programming","author":"Kahn G.","key":"e_1_3_2_1_57_1","unstructured":"G. Kahn . 1974. The Semantics of a Simple Language for Parallel Programming . In Information Processing, J.L. Rosenfeld (Ed.). North-Holland, Stockholm , Sweden . 471\u2013475. G. Kahn. 1974. The Semantics of a Simple Language for Parallel Programming. In Information Processing, J.L. Rosenfeld (Ed.). North-Holland, Stockholm, Sweden. 471\u2013475."},{"volume-title":"Coroutines and networks of parallel processes","author":"Kahn G.","key":"e_1_3_2_1_58_1","unstructured":"G. Kahn and D.B. MacQueen . 1977. Coroutines and networks of parallel processes . In Information Processing, B. Gilchrist (Ed.). North-Holland, Toronto , Canada . 993\u2013998. G. Kahn and D.B. MacQueen. 1977. Coroutines and networks of parallel processes. In Information Processing, B. Gilchrist (Ed.). North-Holland, Toronto, Canada. 993\u2013998."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.012"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.381846"},{"key":"e_1_3_2_1_61_1","volume-title":"North (Ed.) (LNCS","volume":"333","author":"Mutzel P.","year":"1997","unstructured":"P. Mutzel . 1997 . An alternative method to crossing minimization on hierarchical graphs. In Graph Drawing (GD), S . North (Ed.) (LNCS , Vol. 1190). Springer, Berkeley, California, USA. 318\u2013 333 . P. Mutzel. 1997. An alternative method to crossing minimization on hierarchical graphs. In Graph Drawing (GD), S. North (Ed.) (LNCS, Vol. 1190). Springer, Berkeley, California, USA. 318\u2013333."},{"key":"e_1_3_2_1_62_1","volume-title":"Two-Layer Planarization in Graph Drawing. In International Symposium on Algorithms and Computation (ISAAC), K.-Y. Chwa and O.H. Ibarra (Eds.) (LNCS","volume":"79","author":"Mutzel P.","unstructured":"P. Mutzel and R. Weiskircher . 1998 . Two-Layer Planarization in Graph Drawing. In International Symposium on Algorithms and Computation (ISAAC), K.-Y. Chwa and O.H. Ibarra (Eds.) (LNCS , Vol. 1533). Springer, Taejon, Korea. 69\u2013 79 . P. Mutzel and R. Weiskircher. 1998. Two-Layer Planarization in Graph Drawing. In International Symposium on Algorithms and Computation (ISAAC), K.-Y. Chwa and O.H. Ibarra (Eds.) (LNCS, Vol. 1533). Springer, Taejon, Korea. 69\u201379."},{"volume-title":"International Symposium on Computer architecture (ISCA). IEEE Computer Society","author":"Preiss B.R.","key":"e_1_3_2_1_65_1","unstructured":"B.R. Preiss and V.C. Hamacher . 1985. Data flow on a queue machine . In International Symposium on Computer architecture (ISCA). IEEE Computer Society , Boston, MA, USA. 342\u2013351. B.R. Preiss and V.C. Hamacher. 1985. Data flow on a queue machine. In International Symposium on Computer architecture (ISCA). IEEE Computer Society, Boston, MA, USA. 342\u2013351."},{"key":"e_1_3_2_1_66_1","article-title":"TRIPS: A Polymorphous Architecture for Exploiting ILP, TLP, and DLP","volume":"1","author":"Sankaralingam K.","year":"2004","unstructured":"K. Sankaralingam , R. Nagarajan , H. Liu , C. Kim , J. Huh , N. Ranganathan , D. Burger , S.W. Keckler , R.G. Mcdonald , and C.R. Moore . 2004 . TRIPS: A Polymorphous Architecture for Exploiting ILP, TLP, and DLP . ACM Transactions on Architecture and Code Optimization (TACO) , 1 , 1 (2004). K. Sankaralingam, R. Nagarajan, H. Liu, C. Kim, J. Huh, N. Ranganathan, D. Burger, S.W. Keckler, R.G. Mcdonald, and C.R. Moore. 2004. TRIPS: A Polymorphous Architecture for Exploiting ILP, TLP, and DLP. ACM Transactions on Architecture and Code Optimization (TACO), 1, 1 (2004).","journal-title":"ACM Transactions on Architecture and Code Optimization (TACO)"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"crossref","unstructured":"H. Schmit B. Levine and B. Ylvisaker. 2002. Queue machines: hardware compilation in hardware. In Field-Programmable Custom Computing Machines (FCCM) J. Arnold and K.L. Pocek (Eds.). IEEE Computer Society Napa California USA. 152\u2013160. H. Schmit B. Levine and B. Ylvisaker. 2002. Queue machines: hardware compilation in hardware. In Field-Programmable Custom Computing Machines (FCCM) J. Arnold and K.L. Pocek (Eds.). IEEE Computer Society Napa California USA. 152\u2013160.","DOI":"10.1109\/FPGA.2002.1106670"},{"volume-title":"Formal Methods and Models for Codesign (MEMOCODE)","author":"Schneider K.","key":"e_1_3_2_1_68_1","unstructured":"K. Schneider . 2021. Translating Structured Sequential Programs to Dataflow Graphs . In Formal Methods and Models for Codesign (MEMOCODE) , I. Saha and L. Zhang (Eds.). ACM , Beijing, China . K. Schneider. 2021. Translating Structured Sequential Programs to Dataflow Graphs. In Formal Methods and Models for Codesign (MEMOCODE), I. Saha and L. Zhang (Eds.). ACM, Beijing, China."},{"key":"e_1_3_2_1_69_1","volume-title":"Brandt (Ed.) (ITG-Fachbericht","volume":"55","author":"Schneider K.","unstructured":"K. Schneider , A. Bhagyanath , and J. Roob . 2022. Virtual Buffers for Exposed Datapath Architectures. In Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), J . Brandt (Ed.) (ITG-Fachbericht , Vol. 302). VDE, Virtual Event. 45\u2013 55 . K. Schneider, A. Bhagyanath, and J. Roob. 2022. Virtual Buffers for Exposed Datapath Architectures. In Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), J. Brandt (Ed.) (ITG-Fachbericht, Vol. 302). VDE, Virtual Event. 45\u201355."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/321607.321620"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"e_1_3_2_1_73_1","unstructured":"S. Swanson K. Michelson A. Schwerin and M. Oskin. 2003. WaveScalar. In Microarchitecture (MICRO). IEEE Computer Society San Diego California USA. 291\u2013302. S. Swanson K. Michelson A. Schwerin and M. Oskin. 2003. WaveScalar. In Microarchitecture (MICRO). IEEE Computer Society San Diego California USA. 291\u2013302."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233307.1233308"},{"volume-title":"Design Decisions in the Implementation of a RAW Architecture Workstation. Master\u2019s thesis. Department of Electrical Engineering and Computer Science","author":"Taylor M.B.","key":"e_1_3_2_1_75_1","unstructured":"M.B. Taylor . 1999. Design Decisions in the Implementation of a RAW Architecture Workstation. Master\u2019s thesis. Department of Electrical Engineering and Computer Science , MIT. Cambridge, MA , USA. Master . M.B. Taylor. 1999. Design Decisions in the Implementation of a RAW Architecture Workstation. Master\u2019s thesis. Department of Electrical Engineering and Computer Science, MIT. Cambridge, MA, USA. Master."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2002.997877"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02234250"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.612254"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.37236\/6429"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.125"}],"event":{"name":"LCTES '22: 23rd ACM SIGPLAN\/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"San Diego CA USA","acronym":"LCTES '22"},"container-title":["Proceedings of the 23rd ACM SIGPLAN\/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519941.3535076","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519941.3535076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:31Z","timestamp":1750183831000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519941.3535076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,14]]},"references-count":75,"alternative-id":["10.1145\/3519941.3535076","10.1145\/3519941"],"URL":"https:\/\/doi.org\/10.1145\/3519941.3535076","relation":{},"subject":[],"published":{"date-parts":[[2022,6,14]]},"assertion":[{"value":"2022-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}