ACM Home Page
Please provide us with feedback. Feedback
Synchronous Kahn networks
Full text PdfPdf (1.15 MB)
Source ACM SIGPLAN Notices archive
Volume 31 ,  Issue 6  (June 1996) table of contents
Pages: 226 - 238  
Year of Publication: 1996
ISSN:0362-1340
Also published in ...
Authors
Paul Caspi  VERIMAG, Miniparc-ZIRST, Rue Lavoisier, 38330 Montbonnot St-Martin, France
Marc Pouzet  School of Computer Science, McGill University, 3486 University Street, Montréal, H3A 2A7, Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 57,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/232629.232651
What is a DOI?

ABSTRACT

Synchronous data-flow is a programming paradigm which has been successfully applied in reactive systems. In this context, it can be characterized as some class of static bounded memory data-flow networks. In particular, these networks are not recursively defined, and obey some kind of "synchronous" constraints (clock calculus). Based on Kahn's relationship between data-flow and stream functions, the synchronous constraints can be related to Wadler's listlessness, and can be seen as sufficient conditions ensuring listless evaluation. As a by-product, those networks enjoy efficient compiling techniques. In this paper, we show that it is possible to extend the class of static synchronous data-flow to higher order and dynamical networks, thus giving sense to a larger class of synchronous data-flow networks.This is done by extending both the synchronous operational semantics, the clock calculus and the compiling technique of static data-flow networks, to these more general networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
IEEE standard VHDL reference manual. Technical report, 1988.
 
2
3
 
4
5
 
6
L. Augustsson and T. Johnsson. Lazyml user's manual version 0.999.4. Technical report, Chalmers University of Technology, Goteborg, Sweden, 1993.
 
7
 
8
F. Boussinot. R~seaux de processus r~actifs. Technical Report 1588, INRIA Sophia-Antipolis, janvier 1992.
 
9
 
10
P. Caspi. Towards recursive block diagrams. In 19th IFA U/IFIP Workshop on real-time programming, Isle of Reichenau, Germany, June 1994. iFAC.
11
 
12
D.P. Friedman and D.S. Wise. CONS should not evaluate its arguments. In Proceding of the ICALP'76 Conference, pages 257-284, 1976.
 
13
J.L. Giavitto. A synchronous data-flow language for massively parallel computers. In Parallel Computzng'91, London, 1991.
 
14
 
15
G. Kahn. The semantics of a simple language for parallel programming. In IFIP 7~ Congress. North Holland, Amsterdam, 1974.
 
16
 
17
Xavier Leroy. The carol light system : release 0.7 : documentation and user's manual. Technical report, INRIA, INRIA, Domaine de Voluceau-Rocquencourt, 78153 Le Chesnay Cedex, France, July 1995.
 
18
C. Maurras. Alpha, un langage iquationnel pour la conception d'architectures parall~les synchrone. PhD thesis, Universit~ de Rennes 1, France, 1989.
 
19
 
20
P. Raymond N. Halbwachs, P. Caspi and D. Pilaud. The synchronous datafiow programming language LUSTRE. Proceedings of the IEEE, 79(9):1305-1320, 1991.
21
22
 
23
D.A. Turner. A new implementation technique for applicative languages. Software Practice and Experience, 9:31-49, 1979.
 
24
W.G. Vree and P.H. Hartel. Communication lifting: fixed point computation for parallelism. Journal of Functional Programming, 1(1):1-33, 1993.
25
 
26

CITED BY  10
 


Peer to Peer - Readers of this Article have also read: