research-article

Translating structured sequential programs to dataflow graphs

Author:

Klaus SchneiderAuthors Info & Claims

MEMOCODE '21: Proceedings of the 19th ACM-IEEE International Conference on Formal Methods and Models for System Design

Pages 66 - 77

https://doi.org/10.1145/3487212.3487343

Published: 21 December 2021 Publication History

Abstract

In this paper, a translation from structured sequential programs to equivalent dataflow process networks (DPNs) is presented that is based on a carefully chosen set of nodes including load/store operations to access a shared global memory. For every data structure stored in the main memory, we use corresponding tokens to enforce the sequential ordering of load/store operations accessing that data structure as far as needed. Except for the load/store nodes, all nodes obey the Kahn principle so that they are deterministic in the sense that the same inputs are always mapped to the same outputs regardless of the execution schedule of the nodes. Due to the sequential ordering of load/store nodes, determinacy is also maintained by them. Moreover, the generated DPNs are quasi-static, i.e., they have schedules that are bounded in a very strict sense: For every statement of the sequential program, the corresponding DPN behaves like a homogeneous synchronous actor, i.e., it consumes one value of each input port and will finally provide one value on each output port. Hence, no more than one value needs to be stored in each buffer.

References

[1]

S. Abramsky, R. Jagadeesan, and P. Malacaria. 2000. Full Abstraction for PCF. Information and Computation 163, 2 (2000), 409--470.

Digital Library

[2]

W. Ackerman. 1982. Data Flow Languages. IEEE Computer 15, 2 (Feb. 1982), 15--25.

Digital Library

[3]

T. Agerwala and K.P. Arvind. 1982. Data Flow Systems. IEEE Computer 15, 2 (February 1982), 10--13.

Digital Library

[4]

C.S. Ananian. 1999. The Static Single Information Form. Technical Report MIT-LCS-TR-801. Massachusetts Institute of Technology, Cambridge, MA, USA.

[5]

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--124.

[6]

Arvind, D.E. Culler, and K. Ekanadham. 1988. The Price of Asynchronous Parallelism: An Analysis of Dataflow Architectures. In Proceedings of the conference on CONPAR 88. British Computer Society, Manchester, England, UK, 541--555.

[7]

Arvind, D.E. Culler, and G.K. Maa. 1988. Assessing the Benefits of Fine-Grain Parallelism in Dataflow Programs. International Journal of Supercomuter Applications 2, 3 (1988), 10--36.

Digital Library

[8]

Arvind, R.S. Nikhil, and K.K. Pingali. 1989. I-Structures: Data Structures for Parallel Computing. ACM Transactions on Programming Languages and Systems (TOPLAS) 11, 4 (October 1989), 598--632.

[9]

E.A. Ashcroft and W.W. Wadge. 1977. Lucid, a nonprocedural language with iteration. Communications of the ACM (CACM) 20, 7 (July 1977), 519--526.

Digital Library

[10]

J. Backus. 1978. Can Programming be Liberated from the von Neumann Style? Communications of the ACM (CACM) 21, 8 (August 1978), 613--641.

Digital Library

[11]

P.S. Barth, R.S. Nikhil, and Arvind. 1991. M-Structures: Extending a Parallel, Non-strict, Functional Language with State. Technical Report CSG-MEMO 327. Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, USA.

[12]

M. Beck, R. Johnson, and K. Pingali. 1989. From Control Flow to Dataflow. Technical Report TR 89-1050. Department of Computer Science, Cornell University.

[13]

M. Beck, R. Johnson, and K. Pingali. 1991. From control flow to dataflow. J. Parallel and Distrib. Comput. 12, 2 (June 1991), 118--129.

Digital Library

[14]

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--152.

[15]

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--10.

[16]

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--115.

[17]

N. Bhardwaj, M. Senftleben, and K. Schneider. 2015. Abacus - A Processor Family for Education. In Workshop on Embedded and Cyber-Physical Systems Education (WESE), M. Törngren and M.E. Grimheden (Eds.). ACM, New Delhi, India, 2:1--2:8.

[18]

G. Blake, R.G. Dreslinski, and T. Mudge. 2009. A Survey of Multicore Processors. IEEE Signal Processing Magazine 26, 6 (November 2009), 26--37.

[19]

B. Boissinot, P. Brisk, A. Darte, and F. Rastello. 2012. SSI Properties Revisited. ACM Transactions on Embedded Computing Systems (TECS) 11S, 1 (June 2012), 21:1--21:23.

Digital Library

[20]

M.M. Brandis and H. Mössenböck. 1994. Single-Pass Generation of Static Single-Assignment Form for Structured Languages. ACM Transactions on Programming Languages and Systems (TOPLAS) 16, 6 (1994), 1684--1698.

Digital Library

[21]

J. Brock and W. Ackerman. 1981. Scenarios: A model of nondeterminate computation. In Formalization of Programming Concepts (LNCS, Vol. 107), J. Diaz and I. Ramos (Eds.). Springer, Peñíscola, Spain, 252--259.

[22]

S. Brookes and S. Geva. 1992. Stable and Sequential Functions on Scott Domains. Technical Report CMU-CS-92-121. Carnegie Mellon University.

[23]

R. Bruni and U. Montanari. 2017. Models of Computation. Springer.

[24]

J.T. Buck. 1993. Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model. Ph.D. Dissertation. University of California, Berkeley, CA, USA.

[25]

J. Buck and E.A. Lee. 1995. The Token Flow Model. In Advanced Topics in Dataflow Computing and Multithreading, L. Bic, G.R. Gao, and J.-L. Gaudiot (Eds.). IEEE Comp. Society, Hamilton Island, Queensland, Australia, 267--290.

[26]

M. Budiu, P.V. Artigas, and S.C. Goldstein. 2005. Dataflow: A Complement to Superscalar. In International Symposium on Performance Analysis of Systems and Software (ISPASS). IEEE Computer Society, Austin, TX, USA, 1--10.

[27]

R. Buehrer and K. Ekanadham. 1987. Incorporating Dataflow Ideas into von Neumann Processors for Parallel Execution. IEEE Transactions on Computers (T-C) 36, 12 (December 1987), 1515--1522.

[28]

D. Burger, S.W. Keckler, K.S. McKinley, M. Dahlin, L.K. John, C. Lin, C.R. Moore, J. Burrill, R.G. McDonald, and W. Yoder. 2004. Scaling to the End of Silicon with EDGE Architectures. IEEE Computer 37, 7 (July 2004), 44--55.

Digital Library

[29]

A.P.W. Böhm, R.R. Oldehoeft, D.C. Cann, and J.T. Feo. 1991. SISAL 2.0 Reference Manual. Technical Report CS-91-118. Computer Science Department of Colorado State University.

[30]

L. Carter, B. Simon, B. Calder, L. Carter, and J. Ferrante. 1999. Predicated Static Single Assignment. In Parallel Architectures and Compilation Techniques (PACT). IEEE Computer Society, Newport Beach, CA, USA, 245--255.

[31]

H. Corporaal. 1994. Design of Transport Triggered Architectures. In Great Lakes Symposium on VLSI (GLSVLSI). IEEE Comp. Soc., Notre Dame, IN, USA, 130--135.

[32]

H. Corporaal. 1999. TTAs: Missing the ILP complexity wall. Journal of Systems Architecture 45, 12-13 (June 1999), 949--973.

[33]

H. Corporaal, J. Janssen, and M. Arnold. 2000. Computation in the Context of Transport Triggered Architectures. International Journal of Parallel Programming 28, 4 (August 2000), 401--427.

[34]

R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems (TOPLAS) 13, 4 (October 1991), 451--490.

Digital Library

[35]

A.L. Davis. 1978. The architecture and system method of DDM1: A recursively structured Data Driven Machine. In International Symposium on Computer Architecture (ISCA). ACM, Palo Alto, CA, USA, 210--215.

Digital Library

[36]

A.L. Davis and R.M. Keller. 1982. Data Flow Program Graphs. IEEE Computer 15, 2 (February 1982), 26--41.

[37]

G.G. de Jong. 1991. Data Flow Graphs: System Specification with the Most Unrestricted Semantics. In European Design and Test Conference (EDTC). IEEE Computer Society, Amsterdam, The Netherlands, 401--407.

[38]

J.B. Dennis. 1974. First Version of a Data-Flow Procedure Language. In Programming Symposium (LNCS, Vol. 19), B. Robinet (Ed.). Springer, Paris, France, 362--376.

[39]

J.B. Dennis. 1980. Data Flow Supercomputers. IEEE Computer 13, 11 (November 1980), 48--56.

Digital Library

[40]

J.B. Dennis and D.P. Misunas. 1975. A Preliminary Architecture for a Basic Dataflow Processor. In International Symposium on Computer Architecture (ISCA), W.K. King and O. Garcia (Eds.). ACM, Houston, TX, USA, 126--132.

[41]

J. Eker and J.W. Janneck. 2002. CAL Actor Language - Language report. EECS Department, University of California at Berkeley.

[42]

D.D. Gajski, D.A. Padua, D.J. Kuck, and R.H. Kuhn. 1982. A Second Opinion of Data Flow Machines and Languages. IEEE Computer 15, 2 (Feb. 1982), 58--69.

Digital Library

[43]

S. Gatzka and C. Hochberger. 2005. The AMIDAR Class of Reconfigurable Processors. The Journal of Supercomputing 32, 2 (2005), 163--181.

Digital Library

[44]

J.-L. Gaudiot, T. DeBoni, J. Feo, W. Böhm, W. Najjar, and P. Miller. 1997. The SISAL model of functional programming and its implementation. In International Symposium on Parallel Algorithms Architecture Synthesis. IEEE Computer Society, Aizu-Wakamatsu, Japan.

[45]

M. Geilen and T. Basten. 2003. Requirements on the Execution of Kahn Process Networks. In European Symposium on Programming (ESOP) (LNCS, Vol. 2618), P. Degano (Ed.). Springer, Warsaw, Poland, 319--334.

[46]

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).

[47]

V.G. Grafe, G.S. Davidson, J.E. Hoch, and V.P. Holmes. 1989. The Epsilon dataflow processor. ACM SIGARCH Computer Architecture News 17, 3 (June 1989), 36--45.

Digital Library

[48]

J.R. Gurd, C.C. Kirkham, and I. Watson. 1985. The Manchester prototype dataflow computer. Commun. ACM 28, 1 (January 1985), 34--52.

Digital Library

[49]

N. Halbwachs. 2005. A synchronous language at work: the story of Lustre. In Formal Methods and Models for Codesign (MEMOCODE). IEEE Computer Society, Verona, Italy, 3--11.

[50]

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. 1991. The Synchronous Dataflow Programming Language LUSTRE. Proc. IEEE 79, 9 (1991), 1305--1320.

[51]

A.E. Haxthausen. 1996. Developing a Translator from C Programs to Data Flow Graphs Using RAISE. In Conference on Computer Assurance (COMPASS). IEEE Computer Society, Gaithersburg, MD, USA, 89--102.

[52]

L.S. Heath and S.V. Pemmaraju. 1996. Recognizing Leveled-Planar DAGs in Linear Time. In Graph Drawing (GD) (LNCS, Vol. 1027), F.J. Brandenburg (Ed.). Springer, Passau, Germany, 300--311.

[53]

L.S. Heath and S.V. Pemmaraju. 1999. Stack and Queue Layouts of Directed Acyclic Graphs: Part II. SIAM J. Comput. 28, 5 (1999), 1588--1626.

Digital Library

[54]

Y. Herath, Y. Yamaguchi, N. Saito, and T. Yuba. 1988. Dataflow Computing Models, Languages, and Machines for Intelligence Computations. IEEE Transactions on Software Engineering 14, 12 (December 1988), 1805--1828.

Digital Library

[55]

J. Hoogerbrugge and H. Corporaal. 1994. Transport-Triggering vs. Operation-Triggering. In Compiler Construction (CC) (LNCS, Vol. 786), P. Fritzson (Ed.). Springer, Edinburgh, UK, 435--449.

[56]

J.M.E. Hyland and C.-H.L. Ong. 2000. On Full Abstraction for PCF. Information and Computation 163, 2 (2000), 285--408.

Digital Library

[57]

R.A. Iannucci. 1988. Towards a Dataflow/von Neumann Hybrid Architecture. In International Symposium on Computer Architecture (ISCA), H. Siegel (Ed.). IEEE Computer Society, Honolulu, Hawaii, USA, 131--140.

[58]

W.M. Johnston, J.R.P. Hanna, and R.J. Millar. 2004. Advances in Dataflow Programming Languages. ACM Computing Surveys (CSUR) 36, 1 (2004), 1--34.

Digital Library

[59]

P. Jääskeläinen, A. Tervo, G.P. Vayá, T. Viitanen, N. Behmann, and H. Blume. 2018. Transport-Triggered Soft Cores. In Intern. Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE Comp. Soc., Vancouver, BC, Canada.

[60]

G. Kahn. 1974. The Semantics of a Simple Language for Parallel Programming. In Information Processing, J.L. Rosenfeld (Ed.). North-Holland, Stockholm, Sweden, 471--475.

[61]

G. Kahn and D.B. MacQueen. 1977. Coroutines and networks of parallel processes. In Information Processing, B. Gilchrist (Ed.). North-Holland, 993--998.

[62]

R.M. Karp and R.E. Miller. 1966. Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing. SIAM Journal on Applied Mathematics (SIAP) 14, 6 (November 1966), 1390--1411.

Digital Library

[63]

R.M. Keller. 1978. Denotational Models for Parallel Programs with Indeterminate Operators. In Formal Description of Programming Concepts, E.J. Neuhold (Ed.). North-Holland, 337--366.

[64]

J.N. Kok. 1986. Denotational semantics of nets with nondeterminism. In European Symposium on Programming (ESOP) (LNCS, Vol. 213), B. Robinet and R. Wilhelm (Eds.). Springer, Saarbrücken, Germany, 237--249.

[65]

P. Le Guernic, T. Gauthier, M. Le Borgne, and C. Le Maire. 1991. Programming real-time applications with SIGNAL. Proc. IEEE 79, 9 (1991), 1321--1336.

[66]

E.A. Lee. 1988. Recurrences, iteration, and conditionals in statically scheduled block diagrams languages. In VLSI Signal Processing III. IEEE Press, Chapter 31, 330--340.

[67]

E.A. Lee. 1991. Consistency in Dataflow Graphs. IEEE Transactions on Parallel and Distributed Systems (TPDS) 2, 2 (1991).

Digital Library

[68]

E.A. Lee and D.G. Messerschmitt. 1987. Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing. IEEE Transactions on Computers (T-C) 36, 1 (January 1987), 24--35.

[69]

E.A. Lee and D.G. Messerschmitt. 1987. Synchronous Data Flow. Proc. IEEE 75, 9 (September 1987), 1235--1245.

[70]

E.A. Lee and T. Parks. 1995. Dataflow Process Networks. Proc. IEEE 83, 5 (May 1995), 773--801.

[71]

J.R. McGraw. 1982. The VAL Language: Description and Analysis. ACM Transactions on Programming Languages and Systems (TOPLAS) 4, 1 (Jan. 1982), 44--82.

Digital Library

[72]

R. Milner. 1977. Fully abstract models of typed λ-calculi. Theoretical Computer Science (TCS) 4, 1 (February 1977), 1--22.

[73]

R.S. Nikhil. 1989. Can Dataflow Subsume Von Neumann Computing?. In International Symposium on Computer Architecture (ISCA). IEEE Computer Society, Jerusalem, Israel, 262--272.

[74]

R.S. Nikhil. 1991. Id (Version 90.1) Reference Manual. Technical Report CSG Memo 284-2. MIT Lab for Computer Science, Cambridge, MA, USA.

[75]

T. Nipkow and G. Klein. 2015. Concrete Semantics with Isabelle/HOL. Springer.

[76]

P.W. O'Hearn and J.G. Riecke. 1995. Kripke Logical Relations and PCF. Information and Computation 120, 1 (1995), 107--116.

Digital Library

[77]

C.-H.L. Ong. 1995. Handbook of Logic in Computer Science. Oxford University Press, Chapter Correspondence between Operational and Denotational Semantics: The Full Abstraction Problem for PCF, 269--356.

[78]

G. Papadopoulos and D. Culler. 1990. Monsoon: An Explicit Token-Store Architecture. In International Symposium on Computer Architecture (ISCA), J.-L. Baer and L. Snyder (Eds.). IEEE Computer Society, Seattle, Washington, USA, 82--91.

[79]

T.M. Parks. 1995. Bounded Scheduling of Process Networks. Ph.D. Dissertation. Princeton University.

Digital Library

[80]

G.D. Plotkin. 1977. LCF considered as a programming language. Theoretical Computer Science (TCS) 5, 3 (December 1977), 223--255.

[81]

J. Rumbaugh. 1977. A Data Flow Multiprocessor. IEEE Transactions on Computers (T-C) 26, 2 (February 1977), 138--146.

[82]

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).

[83]

J.A. Sharp (Ed.). 1992. Data Flow Computing - Theory and Practice. Ablex Publishing.

[84]

J. Singer. 2002. Efficiently Computing the Static Single Information Form.

[85]

A. Stoutchinin and F. de Ferrière. 2001. Efficient static single assignment form for predication. In Microarchitecture (MICRO). IEEE Computer Society, Austin, Texas, USA, 172--181.

[86]

S. Swanson. 2006. The WaveScalar Architecture. Ph.D. Dissertation. University of Washington.

[87]

S. Swanson, K. Michelson, A. Schwerin, and M. Oskin. 2003. WaveScalar. In Microarchitecture (MICRO). IEEE Computer Society, San Diego, CA, USA, 291--302.

[88]

S. Swanson, A. Schwerin, M. Mercaldi, A. Petersen, A. Putnam, K. Michelson, M. Oskin, and S.J. Eggers. 2007. The WaveScalar Architecture. ACM Transactions on Computer Systems (TOCS) 25, 2 (May 2007), 1--54.

Digital Library

[89]

A. Tavares, M. Bigonha, R.S. Bigonha, B. Boissinot, F.M.Q. Pereira, and F. Rastello. 2012. SSI revisited: A Program Representation for Sparse Data-flow Analyses. Preprint submitted to Science of Computer Programming.

[90]

A.L.C. Tavares, F.M.Q. Pereira, M.A.S. Bigonha, and R.S. Bigonha. 2010. Efficient SSI Conversion. Brazilian Symposium on Programming Languages (SBLP).

[91]

M.B. Taylor. 1999. Design Decisions in the Implementation of a RAW Architecture Workstation. Master's thesis. Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA.

[92]

M.B. Taylor, J.S. Kim, J.E. Miller, D. Wentzlaff, F. Ghodrat, B. Greenwald, H. Hoffmann, P. Johnson, J.W. Lee, W. Lee, A. Ma, A. Saraf, M. Seneski, N. Shnidman, V. Strumpen, M.I. Frank, S.P. Amarasinghe, and A. Agarwal. 2002. The RAW Microprocessor: A Computational Fabric for Software Circuits and General-Purpose Programs. IEEE Micro 22, 2 (March/April 2002), 25--35.

Digital Library

[93]

K.R. Traub. 1986. A Compiler for the MIT Tagged-Token Dataflow Architecture. Technical Report TR370. MIT Lab for Computer Science, Cambridge, MA, USA.

[94]

K.R. Traub, G.M. Papadopoulos, M.J. Beckerle, J.E. Hicks, and J. Young. 1991. Overview of the Monsoon Project. In International Conference on Computer Design (ICCD). IEEE Computer Society, Cambridge, MA, USA, 150--155.

[95]

T. Ungerer. 1993. Datenflußrechner. Teubner.

[96]

A.H. Veen. 1986. Dataflow Machine Architecture. ACM Computing Surveys (CSUR) 18, 4 (December 1986), 365--396.

Digital Library

[97]

A.H. Veen. 1986. The misconstrued semicolon: reconciling imperative languages and dataflow machines. Centrum voor Wiskunde en Informatica Amsterdam, The Netherlands.

[98]

J. Vuillemin. 1973. Proof Techniques for Recursive Programs. Ph.D. Dissertation. Department of Computer Science, Stanford University, Stanford, CA, USA.

[99]

E. Waingold, M. Taylor, D. Srikrishna, V. Sarkar, W. Lee, V. Lee, J. Kim, M. Frank, P. Finch, J. Babb, S. Amarasinghe, and A. Agarwal. 1997. Baring it all to Software: RAW Machines. IEEE Computer 30, 9 (September 1997), 86--93.

Digital Library

[100]

I. Watson and J.R. Gurd. 1982. A Practical Data Flow Computer. IEEE Computer 15, 2 (January 1982), 51--57.

Digital Library

[101]

F. Yazdanpanah, C. Alvarez-Martinez, D. Jimenez-Gonzalez, and Y. Etsion. 2014. Hybrid Dataflow/von-Neumann Architectures. IEEE Transactions on Parallel and Distributed Systems 25, 6 (June 2014), 1489--1509.

Digital Library

[102]

T. Yuba, K. Hiraki, T. Shimada, S. Sekiguchi, and K. Nishida. 1987. The SIGMA-1 dataflow computer. In Fall Joint Computer Conf. on Exploring Technology: today and tomorrow (FJCC), S.A. Szygenda (Ed.). ACM, Chicago, IL, USA, 578--585.

Cited By

Schneider KBhagyanath A(2023)Consistency Constraints for Mapping Dataflow Graphs to Hybrid Dataflow/von Neumann ArchitecturesACM Transactions on Embedded Computing Systems10.1145/360786922:5(1-25)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3607869

Index Terms

Translating structured sequential programs to dataflow graphs

Recommendations

Synthesis of Parallel Software from Heterogeneous Dataflow Models
Abstract
Dataflow process networks (DPNs) are intrinsically data-driven, i.e., node actions are not synchronized among each other and may fire whenever sufficient input operands arrived at a node. While the general model of computation (MoC) of DPNs does ...
Efficient Handling of Arrays in Dataflow Process Networks
HPCC '12: Proceedings of the 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems

Dataflow process networks (DPN) have been proposed as a programming model for distributed parallel systems that have communication paths with unpredictable latencies. The purely data-driven execution of DPNs does not require a global coordination and ...
Dataflow Architectures for GALS

In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on the channels. KPN provides a semantic model of computation, where a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MEMOCODE '21: Proceedings of the 19th ACM-IEEE International Conference on Formal Methods and Models for System Design

November 2021

149 pages

ISBN:9781450391276

DOI:10.1145/3487212

General Chairs:
S. Arun-Kumar
Indian Institute of Technology Delhi
,
Dominique Mery
Université de Lorraine, LORIA
,
Program Chairs:
Indranil Saha
Indian Institute of Technology Kanpur
,
Lijun Zhang
Institute of Software, Chinese Academy of Sciences

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

In-Cooperation

IEEE CAS
IEEE CEDA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 December 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MEMOCODE '21

Sponsor:

MEMOCODE '21: 19th ACM-IEEE International Conference on Formal Methods and Models for System Design

November 20 - 22, 2021

Virtual Event, China

Acceptance Rates

Overall Acceptance Rate 34 of 82 submissions, 41%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
113
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)3

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Schneider KBhagyanath A(2023)Consistency Constraints for Mapping Dataflow Graphs to Hybrid Dataflow/von Neumann ArchitecturesACM Transactions on Embedded Computing Systems10.1145/360786922:5(1-25)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3607869

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten