The semantics of dataflow with firing

From Semantics to Computer Science: Essays in Honour of Gilles Kahn

Volumn 9780521518253, Issue , 2009, Pages 71-94

  Lee, Edward A ^a   Matsikoudis, Eleftherios ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; EMBEDDED SYSTEMS; MILITARY AVIATION; NETWORK ARCHITECTURE; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING; SEMANTICS; SOFTWARE ARCHITECTURE;

AIR FORCE RESEARCH LAB; CONTINUOUS FUNCTIONS; EMBEDDED SOFTWARE SYSTEMS; KAHN PROCESS NETWORKS; MODELS OF COMPUTATION; MULTICORE ARCHITECTURES; NATIONAL SCIENCE FOUNDATIONS; SCIENTIFIC RESEARCHES;

DATA FLOW ANALYSIS;

EID: 84866935689     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511770524.005     Document Type: Chapter

References (32)

1. Arvind, L. Bic and T. Ungerer. Evolution of data-flow computers. In J.-L. Gaudiot and L. Bic (eds), Advanced Topics in Data-Flow Computing. Prentice-Hall, 1991.
2. A. Benveniste, P. Caspi, P. L. Guernic and N. Halbwachs. Dataflow synchronous languages. In J. W. d. Bakker, W.-P. d. Roever and G. Rozenberg, (eds), A Decade of Concurrency –Reflections and Perspectives, Volume 803 Lecture Notes in Computer Science, pp. 1–45. Springer-Verlag, 1994.
3. G. Berry. Bottom-up computation of recursive programs. Revue Française d’Automatique, Informatique et Recherche Opérationnelle, 10(3):47–82, 1976.
4. J. D. Brock and W. B. Ackerman. Scenarios, a model of non-determinate computation. In Conference on Formal Definition of Programming Concepts, volume 107, Lecture Notes in Computer Science, pp. 252–259. Springer-Verlag, 1981.
5. M. Broy. Functional specification of time-sensitive communicating systems. ACM Transactions on Software Engineering and Methodology, 2(1):1–46, 1993.
6. M. Broy and G. Stefanescu. The algebra of stream processing functions. Theoretical Computer Science, 258:99–129, 2001.
7. P. Caspi. Clocks in dataflow languages. Theoretical Computer Science, 94(1), 1992.
8. M. Creeger. Multicore CPUs for the masses. ACM Queue, 3(7):63–64, 2005.
9. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
10. J. B. Dennis. First Version Data Flow Procedure Language. Technical Report MAC TM61, MIT Laboratory for Computer Science, 1974.
11. M. Geilen and T. Basten. Requirements on the execution of Kahn process networks. In European Symposium on Programming Languages and Systems, Lecture Notes in Computer Science, pp. 319–334, Springer, 2003.
12. C.-J. Hsu, F. Keceli, M.-Y. Ko, S. Shahparnia and S. S. Bhattacharyya. DIF: An interchange format for dataflow-based design tools. In International Workshop on Systems, Architectures, Modeling, and Simulation, Samos, Greece, July 2004.
13. A. Jantsch and I. Sander. Models of computation and languages for embedded system design. IEE Proceedings on Computers and Digital Techniques, 152(2):114–129, 2005.
14. W. M. Johnston, J. R.P. Hanna and R. J. Millar. Advances in dataflow programming languages. ACM Computing Surveys, 36(1):1–34, 2004.
15. G. Kahn. The semantics of a simple language for parallel programming. In Proc. of the IFIP Congress 74. North-Holland Publishing Co., 1974.
16. G. Kahn and D. B. MacQueen. Coroutines and networks of parallel processes. In B. Gilchrist (ed.), Information Processing, pages 993–998. North-Holland Publishing Co., 1977.
17. D. Lazaro Cuadrado, A.P. Ravn and P. Koch. Automated distributed simulation in Ptolemy II. In Parallel and Distributed Computing and Networks (PDCN). Acta Press, 2007.
18. E. A. Lee and T. M. Parks. Dataflow process networks. Proceedings of the IEEE, 83(5):773–801, 1995.
19. Y. Lin, R. Mullenix, M. Woh, S. Mahlke, T. Mudge, A. Reid and K. Flautner. SPEX: A programming language for software defined radio. In Software Defined Radio Technical Conference and Product Exposition, Orlando, 2006.
20. S. G. Matthews. An extensional treatment of lazy data flow deadlock. Theoretical Computer Science, 151(1):195–205, 1995.
21. A. G. Olson and B. L. Evans. Deadlock detection for distributed process networks. In ICASSP, 2005.
22. O. M. G. (OMG). A UML profile for MARTE, beta 1. OMG Adopted Specification ptc/07–08–04, August 2007.
23. T. M. Parks. Bounded Scheduling of Process Networks. PhD, UC Berkeley, 1995.
24. T. M. Parks and D. Roberts. Distributed process networks in Java. In International Parallel and Distributed Processing Symposium, Nice, France, April 2003.
25. D. Scott. Outline of a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, pp. 169–176, 1970.
26. V. Srini. An architectural comparison of dataflow systems. Computer, 19(3), 1986.
27. E. W. Stark. An algebra of dataflow networks. Fundamenta Informaticae, 22(1-2):167–185, 1995.
28. R. Stephens. A survey of stream processing. Acta Informatica, 34(7), 1997.
29. C. L. Talcott. Interaction semantics for components of distributed systems. In Formal Methods for Open Object-Based Distributed Systems (FMOODS), 1996.
30. W. Thies, M. Karczmarek and S. Amarasinghe. StreamIt: A language for streaming applications. In 11th International Conference on Compiler Construction, volume 2304, Lecture Notes in Computer Science, Grenoble, France, 2002, Springer-Verlag.
31. W. Thies, M. Karczmarek, J. Sermulins, R. Rabbah and S. Amarasinghe. Teleport messaging for distributed stream programs. In PPoPP, Chicago, Illinois, USA, 2005. ACM.
32. A. Turjan, B. Kienhuis and E. Deprettere. Solving out-of-order communication in Kahn process networks. Journal on VLSI Signal Processing-Systems for Signal, Image, and Video Technology, 2003.