Skip to main content

Scheduling and Buffer Sizing of n-Synchronous Systems

Typing of Ultimately Periodic Clocks in Lucy-n

  • Conference paper
Mathematics of Program Construction (MPC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7342))

Included in the following conference series:

Abstract

Lucy-n is a language for programming networks of processes communicating through bounded buffers. A dedicated type system, termed a clock calculus, automatically computes static schedules of the processes and the sizes of the buffers between them.

In this article, we present a new algorithm which solves the subtyping constraints generated by the clock calculus. The advantage of this algorithm is that it finds schedules for tightly coupled systems. Moreover, it does not overestimate the buffer sizes needed and it provides a way to favor either system throughput or buffer size minimization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bilsen, G., Engels, M., Lauwereins, R., Peperstraete, J.: Cyclo-static dataflow. IEEE Trans. on Signal Processing 44(2), 397–408 (1996)

    Article  Google Scholar 

  2. Boucaron, J., de Simone, R., Millo, J.-V.: Formal methods for scheduling of latency-insensitive designs. EURASIP Journal on Embedded Systems (1) (January 2007)

    Google Scholar 

  3. Carloni, L., McMillan, K., Sangiovanni-Vincentelli, A.: Theory of latency-insensitive design. IEEE Trans. on CAD of Integrated Circuits ans Systems 20(9), 1059–1076 (2001)

    Article  Google Scholar 

  4. Carmona, J., Júlvez, J., Cortadella, J., Kishinevsky, M.: Scheduling synchronous elastic designs. In: Application of Concurrency to System Design (2009)

    Google Scholar 

  5. Caspi, P., Pilaud, D., Halbwachs, N., Plaice, J.A.: Lustre: a declarative language for real-time programming. In: Principles of Programming Languages (1987)

    Google Scholar 

  6. Caspi, P., Pouzet, M.: Synchronous Kahn networks. In: International Conference on Functional Programming (May 1996)

    Google Scholar 

  7. Casu, M., Macchiarulo, L.: A new approach to latency insensitive design. In: Design Automation Conference (2004)

    Google Scholar 

  8. 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: Principles of Programming Languages (2006)

    Google Scholar 

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

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  11. Eker, J., Janneck, J.W., Lee, E.A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S., Xiong, Y.: Taming heterogeneity - the Ptolemy approach. Proceedings of the IEEE 91(1), 127–144 (2003)

    Article  Google Scholar 

  12. GLPK. GNU linear programming kit, http://www.gnu.org/software/glpk/

  13. Lagrange, X., Godlewski, P., Tabbane, S.: Réseaux GSM: des principes à la norme. Hermès Science, Paris (2000)

    Google Scholar 

  14. Lee, E., Messerschmitt, D.: Synchronous data flow. IEEE Transactions on Computers 75(9) (September 1987)

    Google Scholar 

  15. Mandel, L., Plateau, F.: Typage des horloges périodiques en Lucy-n. In: Journées Francophones des Langages Applicatifs, La Bresse, France (January 2011)

    Google Scholar 

  16. Mandel, L., Plateau, F.: Scheduling and buffer sizing of n-synchronous systems — extended version (2012), http://www.lri.fr/~mandel/mpc12

  17. Mandel, L., Plateau, F., Pouzet, M.: Lucy-n: a n-synchronous extension of Lustre. Mathematics of Program Construction (2010)

    Google Scholar 

  18. Mandel, L., Plateau, F., Pouzet, M.: Static scheduling of latency insensitive designs with Lucy-n. In: Formal Methods in Computer Aided Design (2011)

    Google Scholar 

  19. Wesley Peterson, W.: Error-Correcting Codes. The M.I.T. Press (1961)

    Google Scholar 

  20. Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons (1986)

    Google Scholar 

  21. Schrijvers, T., Peyton Jones, S., Sulzmann, M., Vytiniotis, D.: Complete and decidable type inference for GADTs. In: International Conference on Functional Programming, pp. 341–352 (2009)

    Google Scholar 

  22. Thies, W., Karczmarek, M., Amarasinghe, S.: StreamIt: A Language for Streaming Applications. In: CC 2002. LNCS, vol. 2304, pp. 179–196. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mandel, L., Plateau, F. (2012). Scheduling and Buffer Sizing of n-Synchronous Systems. In: Gibbons, J., Nogueira, P. (eds) Mathematics of Program Construction. MPC 2012. Lecture Notes in Computer Science, vol 7342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31113-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31113-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31112-3

  • Online ISBN: 978-3-642-31113-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics