1. Data flow languages;Ackerman W.;IEEE Computer,1982
2. Data flow systems;Agerwala T.;IEEE Computer,1982
3. S. R. Anapalli, K. C. Chakilam, and T. W. O’Neil. 2009. Static scheduling for cyclo-static data flow graphs. In Proceedings of the Parallel and Distributed Processing Techniques and Applications. H. R. Arabnia (Ed.), CSREA Press, Las Vegas, Nevada, 302–306.
4. M. Anders, A. Bhagyanath, and K. Schneider. 2018. On memory optimal code generation for exposed datapath architectures with buffered processing units. In Proceedings of the Application of Concurrency to System Design.T. Chatain and R. Grosu (Eds.), IEEE Computer Society, Bratislava, Slovakia, 115–124.
5. 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.