Skip to main content
Log in

NetWorkSpace: A Coordination System for High-Productivity Environments

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

As languages and systems for rapid prototyping and application development have grown in popularity and the problems that they are being used to solve have grown in size, so has the need for enhancing them with a coordination facility to support distributed and parallel computations and the creation of application ensembles. We describe NetWorkSpace, a coordination facility based on the fundamental concept of a variable/value binding. NetWorkSpace is implemented as an open source server with clients available for a variety of environments. We present an overview of its design, implementation, performance and usage case studies.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Message Passing Interface Forum.: MPI: A Message-Passing Interface Standard [Online]. Available: http://www.mpi-forum.org/docs/mpi-11-html/mpi-report.html (1995)

  2. Gelernter D.H.: Generative communication in Linda. ACM Trans. Program. Lang. Syst. 8(1), 80–112 (1985)

    Article  Google Scholar 

  3. Gelernter D.H., Carriero N.J.: Coordination languages and their significance. Comm. ACM 32(2), 97–107 (1992)

    Article  Google Scholar 

  4. Tierney, L., Rossini, A., Li, N., Sevcikova, H.: Snow: simple network of workstations [Online R Package]. Available: http://cran.r-project.org/web/packages/snow

  5. Gelernter, D.H., Jagannathan, S., London, T.: Environments as First-Class Objects. In: ACM Conference on Principles of Programming Languages, pp. 98–110 (1987)

  6. Gelernter, D.H., Jagannathan, S.: Programming Linguistics. MIT Press (1990)

  7. Twisted Matrix Labs.: Twisted [Online]. Available: http://twistedmatrix.com/trac/wiki/Downloads (2008)

  8. Lloyd S.P.: Least squares quantization in pcm. IEEE Trans. Inf. Theory 28(2), 129–136 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  9. K-means Algorithm [Online]. Available: http://en.wikipedia.org/wiki/K-means

  10. Hornik, K.: R FAQ [Online]. Available: http://cran.r-project.org/doc/FAQ/R-FAQ.html (2008)

  11. Dhillon I.S., Modha D.S.: Concept decompositions for large sparse text data using clustering. Mach. Learn. 42(1), 143–175 (2001)

    Article  MATH  Google Scholar 

  12. Kuhn, M.: Caret: classification and regression training [Online R Package]. Available: http://cran.r-project.org/web/packages/caret (Mar. 2008)

  13. Hastie, T., Tibshirani, R., Friedmann, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer (2001)

  14. Breiman L.: Random forests. Mach. Learn. 45(1), 5–32 (2001)

    MATH  Google Scholar 

  15. Jones, S.P.: Beautiful concurrency. In: Oram, A., Wilson, G. (eds.) Beautiful Code. O’Reilly (2007)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicholas J. Carriero.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bjornson, R.D., Carriero, N.J., Schultz, M.H. et al. NetWorkSpace: A Coordination System for High-Productivity Environments. Int J Parallel Prog 37, 106–125 (2009). https://doi.org/10.1007/s10766-008-0091-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10766-008-0091-4

Keywords

Navigation