Skip to main content

Streaming Networks for Coordinating Data-Parallel Programs

  • Conference paper
Perspectives of Systems Informatics (PSI 2006)

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

Abstract

A new coordination language for distributed data-parallel programs is presented, call SNet. The intention of SNet is to introduce advanced structuring techniques into a coordination language: stream processing and various forms of subtyping. The talk will present the organisation of SNet, its major type inferencing algorithms and will briefly discuss the current state of implementation and possible applications.

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. Ashcroft, E.A., Wadge, W.W.: Lucid, a nonprocedural language with iteration. Communications of the ACM 20(7), 519–526 (1977)

    Article  MATH  Google Scholar 

  2. Broy, M., Stefanescu, G.: The algebra of stream processing functions. Theoretical Computer Science 258, 99–129 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Campbell, P.M., Carmona, E.A., Walker, D.W.: Hierarchical domain decomposition with unitary load balancing for electromagnetic particle-in-cell codes. In: Proceedings of the Fifth Distributed Memory Computing Conference, Charleston, South Carolina, April 9-12, 1990, pp. 9–12. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  4. Gelernter, D., Carriero, N.: Coordination languages and their significance. Communications of the ACM 35(2), 96–107 (1992)

    Article  Google Scholar 

  5. Gelernter, D.: Generative communication in linda. ACM Trans. Program. Lang. Syst. 1(7), 80–112 (1985)

    Article  Google Scholar 

  6. Grelck, C., Scholz, S.-B.: A Functional Array Language for Efficient Multithreaded Execution. International Journal of Parallel Programming, to appear (2006)

    Google Scholar 

  7. Halbwachs, N., et al.: The synchronous data-flow programming language LUSTRE. Proceedings of the IEEE 79(9), 1305–1320 (1991)

    Article  Google Scholar 

  8. Jacquet, J.-M., Picco, G.P. (eds.): COORDINATION 2005. LNCS, vol. 3454. Springer, Heidelberg (2005)

    Google Scholar 

  9. Kahn, G.: The semantics of a simple language for parallel programming. In: Rosenfeld, L. (ed.) Information Processing 74, Proc. IFIP Congress 74, Stockholm, Sweden, August 5-10, 1974, pp. 471–475. North-Holland, Amsterdam (1974)

    Google Scholar 

  10. Kale, L.V., Bhandarkar, M., Brunner, R.: Load balancing in parallel molecular dynamics. In: Ferreira, A., Rolim, J.D.P., Teng, S.-H. (eds.) IRREGULAR 1998. LNCS, vol. 1457, Springer, Heidelberg (1998)

    Google Scholar 

  11. Gordon, M.I., et al.: A stream compiler for communication-exposed architectures. In: Proceedings of the Tenth International Conference on Architectural Support for Programming Languages and Operating Systems, San Jose, CA (October 2002)

    Google Scholar 

  12. Papadopoulos, G.A., Arbab, F.: Coordination models and languages. Advances in Computers, vol. 46. Academic Press, London (1998)

    Google Scholar 

  13. The AETHER Project, http://aetherist.free.fr/Joomla/index.php

  14. Scholz, S.-B., et al.: Implementing a Numerical Solution of the KPI Equation Using Single Assignment C: Lessons and Experiences. In: Butterfield, A., Grelck, C., Huch, F. (eds.) IFL 2005. LNCS, vol. 4015, pp. 160–177. Springer, Heidelberg (2006)

    Google Scholar 

  15. Shafarenko, A.: Coercion as homomorphism: type inference in a system with subtyping and overloading. In: PPDP ’02: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, pp. 14–25. ACM Press, New York (2002)

    Chapter  Google Scholar 

  16. Shafarenko, A.: Stream processing on the grid: an array stream transforming language. In: SNPD, pp. 268–276 (2003)

    Google Scholar 

  17. Shafarenko, A.: Snet: definition and the main algorithms. Technical report, Department of Computer Science (2006)

    Google Scholar 

  18. Shafarenko, A., Scholz, S.-B.: General homomorphic overloading. In: Grelck, C., et al. (eds.) IFL 2004. LNCS, vol. 3474, pp. 195–210. Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Irina Virbitskaite Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grelck, C., Scholz, SB., Shafarenko, A. (2007). Streaming Networks for Coordinating Data-Parallel Programs. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70881-0_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70880-3

  • Online ISBN: 978-3-540-70881-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics