Article

Lucy-n: a n-synchronous extension of Lustre

Authors:

Louis Mandel,

Florence Plateau,

Marc PouzetAuthors Info & Claims

MPC'10: Proceedings of the 10th international conference on Mathematics of program construction

Pages 288 - 309

Published: 21 June 2010 Publication History

Abstract

Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is associated to a clock indicating the instants when a value is present. A dedicated type system, the clock calculus, checks that the actual clock of a stream equals its expected clock and thus does not need to be buffered. The n-synchrony relaxes synchrony by allowing the communication through bounded buffers whose size is computed at compile-time. It is obtained by extending the clock calculus with a subtyping rule which defines buffering points.

This paper presents the first implementation of the n-synchronous model inside a Lustre-like language called Lucy-n. The language extends Lustre with an explicit buffer construct whose size is automatically computed during the clock calculus. This clock calculus is defined as an inference type system and is parametrized by the clock language and the algorithm used to solve subtyping constraints. We detail here one algorithm based on the abstraction of clocks, an idea originally introduced in [5]. The paper presents a simpler, yet more precise, clock abstraction for which the main algebraic properties have been proved in Coq. Finally, we illustrate the language on various examples including a video application.

References

[1]

Buck, J.T.: Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model. Ph.D. thesis, EECS Department, University of California, Berkeley (1993).

Digital Library

Google Scholar

[2]

Caspi, P., Pilaud, D., Halbwachs, N., Plaice, J.A.: Lustre: a declarative language for real-time programming. In: POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 178-188. ACM, New York (1987).

Digital Library

Google Scholar

[3]

Caspi, P., Pouzet, M.: Synchronous kahn networks. In: ACM SIGPLAN International Conference on Functional Programming, pp. 226-238. ACM Press, New York (1996).

Digital Library

Google Scholar

[4]

Cohen, A., Duranton, M., Eisenbeis, C., Pagetti, C., Plateau, F., Pouzet, M.: N- Synchronous Kahn Networks: a Relaxed Model of Synchrony for Real-Time Systems. In: ACM International Conference on Principles of Programming Languages (POPL'06), pp. 180-193. ACM Press, New York (2006).

Digital Library

Google Scholar

[5]

Cohen, A., Mandel, L., Plateau, F., Pouzet, M.: Abstraction of clocks in synchronous data-flow systems. In: Ramalingam, G. (ed.) APLAS 2008. LNCS, vol. 5356, pp. 237-254. Springer, Heidelberg (2008).

Digital Library

Google Scholar

[6]

Colaço, J.L., Pouzet, M.: Clocks as First Class Abstract Types. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 134-155. Springer, Heidelberg (2003).

Google Scholar

[7]

Glpk: Gnu linear programming kit.

Google Scholar

[8]

Kahn, G.: The semantics of a simple language for parallel programming. In: Rosenfeld, J.L. (ed.) Information processing, pp. 471-475. North Holland, Amsterdam (August 1974).

Google Scholar

[9]

Lee, E., Messerschmitt, D.: Synchronous dataflow. IEEE Trans. Comput. 75(9), 1235-1245 (1987).

Google Scholar

[10]

Parks, T.M., Pino, J.L., Lee, E.A.: A comparison of synchronous and cycle-static dataflow. In: ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers, vol. 2, p. 204. IEEE Computer Society, Washington (1995).

Digital Library

Google Scholar

[11]

Parks, T.M.: Bounded scheduling of process networks. Ph.D. thesis, EECS Department, University of California, Berkeley, Berkeley, CA, USA (1995).

Digital Library

Google Scholar

[12]

Plateau, F.: Modèle n-synchrone pour la programmation de réseaux de Kahn à mémoire bornée. Ph.D. thesis, Université Paris-Sud 11 (January 2010).

Google Scholar

[13]

Pouzet, M.: Lucid Synchrone, version 3. Tutorial and reference manual. Université Paris-Sud, LRI (April 2006).

Google Scholar

[14]

Thies, W., Karczmarek, M., Amarasinghe, S.P.: Streamit: A language for streaming applications. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol. 2304, pp. 179-196. Springer, Heidelberg (2002).

Digital Library

Google Scholar

Cited By

View all

Robinson ALippmeier BVanhoof WPientka B(2017)Machine fusionProceedings of the 19th International Symposium on Principles and Practice of Declarative Programming10.1145/3131851.3131865(139-150)Online publication date: 9-Oct-2017
https://dl.acm.org/doi/10.1145/3131851.3131865
Khatib JMunier-Kordon AKlikpo ETrabelsi-Colibet KPlantec ASinghoff FFaucou SPinho L(2016)Computing latency of a real-time system modeled by Synchronous Dataflow GraphProceedings of the 24th International Conference on Real-Time Networks and Systems10.1145/2997465.2997479(87-96)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2997465.2997479
Lippmeier BMackay FRobinson ADuke DKameyama Y(2016)Polarized data parallel data flowProceedings of the 5th International Workshop on Functional High-Performance Computing10.1145/2975991.2975999(52-57)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/2975991.2975999
Show More Cited By

Recommendations

A polymorphic modal type system for lisp-like multi-staged languages
POPL '06: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-quotation system). The combination is meaningful because ML is a practical ...
Clock-directed modular code generation for synchronous data-flow languages
LCTES '08

The compilation of synchronous block diagrams into sequential imperative code has been addressed in the early eighties and can now be considered as folklore. However, separate, or modular, code generation, though largely used in existing compilers and ...
Clock-driven distributed real-time implementation of endochronous synchronous programs
EMSOFT '09: Proceedings of the seventh ACM international conference on Embedded software

An important step in model-based embedded system design consists in mapping functional specifications and their tasks/operations onto execution architectures and their resources. This mapping comprises both temporal scheduling and spatial allocation ...

Comments

Information & Contributors

Information

Published In

MPC'10: Proceedings of the 10th international conference on Mathematics of program construction

June 2010

426 pages

ISBN:3642133207

Editors:
Claude Bolduc
Université Laval, Département d'informatique et de génie logiciel Pavillon Adrien-Pouliot, Québec, QC, Canada
,
Jules Desharnais
Université Laval, Département d'informatique et de génie logiciel Pavillon Adrien-Pouliot, Québec, QC, Canada
,
Béchir Ktari
Université Laval, Département d'informatique et de génie logiciel Pavillon Adrien-Pouliot, Québec, QC, Canada

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 21 June 2010

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Robinson ALippmeier BVanhoof WPientka B(2017)Machine fusionProceedings of the 19th International Symposium on Principles and Practice of Declarative Programming10.1145/3131851.3131865(139-150)Online publication date: 9-Oct-2017
https://dl.acm.org/doi/10.1145/3131851.3131865
Khatib JMunier-Kordon AKlikpo ETrabelsi-Colibet KPlantec ASinghoff FFaucou SPinho L(2016)Computing latency of a real-time system modeled by Synchronous Dataflow GraphProceedings of the 24th International Conference on Real-Time Networks and Systems10.1145/2997465.2997479(87-96)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2997465.2997479
Lippmeier BMackay FRobinson ADuke DKameyama Y(2016)Polarized data parallel data flowProceedings of the 5th International Workshop on Functional High-Performance Computing10.1145/2975991.2975999(52-57)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/2975991.2975999
Robinson ALippmeier BDuke DKameyama Y(2016)Icicle: write once, run onceProceedings of the 5th International Workshop on Functional High-Performance Computing10.1145/2975991.2975992(2-8)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/2975991.2975992
Benazouz MMunier-Kordon AHujsa TBodin B(2013)Liveness evaluation of a cyclo-static DataFlow graphProceedings of the 50th Annual Design Automation Conference10.1145/2463209.2488736(1-7)Online publication date: 29-May-2013
https://dl.acm.org/doi/10.1145/2463209.2488736
Mandel LPlateau F(2012)Scheduling and buffer sizing of n-synchronous systemsProceedings of the 11th international conference on Mathematics of Program Construction10.1007/978-3-642-31113-0_6(74-101)Online publication date: 25-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-31113-0_6
Mandel LPlateau FPouzet MBjesse PSlobodová A(2011)Static scheduling of latency insensitive designs with Lucy-nProceedings of the International Conference on Formal Methods in Computer-Aided Design10.5555/2157654.2157681(171-175)Online publication date: 30-Oct-2011
https://dl.acm.org/doi/10.5555/2157654.2157681
Zhai JNikolov HStefanov TStok LDutt NHassoun S(2011)Modeling adaptive streaming applications with parameterized polyhedral process networksProceedings of the 48th Design Automation Conference10.1145/2024724.2024752(116-121)Online publication date: 5-Jun-2011
https://dl.acm.org/doi/10.1145/2024724.2024752

View Options

View options

Get Access

Login options

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

Cited By

Recommendations

A polymorphic modal type system for lisp-like multi-staged languages

Clock-directed modular code generation for synchronous data-flow languages

Clock-driven distributed real-time implementation of endochronous synchronous programs

Comments

Published In

Sponsors

Publisher

Publication History

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

References

Cited By

Recommendations

A polymorphic modal type system for lisp-like multi-staged languages

Clock-directed modular code generation for synchronous data-flow languages

Clock-driven distributed real-time implementation of endochronous synchronous programs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations