Skip to main content
SpringerLink
Log in

TOP-C: Task-oriented parallel C for distributed and shared memory

  • Conference paper
  • First Online:
Workshop on wide area networks and high performance computing

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 249))

Abstract

The “holy grail” of parallel software systems is a parallel programming language that will be as easy to use as a sequential one, while maintaining most of the potential efficiency of the underlying parallel hardware. TOP-C (Task-Oriented Parallel C) attempts such a model by presenting a task abstraction that hides much of the details of the underlying hardware. DSM (Distributed Shared Memory) also attemps such a model, but along an orthogonal direction. By presenting a shared memory model of memory, it hides much of the details of message-passing required by the underlying hardware. This article reviews the TOP-C model and then presents ongoing research on combining the advantages of both models in a single system.

Supported in part by NSF Grant CCR-9732330.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Amza, A.L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel, “TreadMarks: Shared Memory Computing on Networks of Workstations”, IEEE Computer, Vol. 29, No. 2, pp. 18–28, February 1996.

    Google Scholar 

  2. J. Carter, J. Bennett, and W. Zwanpoel, Implementation and Performance of Munin, Proc. 13th ACM Symp. Operating System Principles, 1991, pp. 152–164.

    Google Scholar 

  3. R. Chow and T. Johnson, Distributed Operating Systems and Algorithms, Addison Wesley Longman, 1997.

    Google Scholar 

  4. G. Cooperman, “Practical Task-Oriented Parallelism for Gaussian Elimination in Distributed Memory”, Linear Algebra and its Applications 275–276, 1998, pp. 107–120.

    Article  MathSciNet  Google Scholar 

  5. G. Cooperman, GAP/MPI: Facilitating Parallelism, Proc. of DIMACS Workshop on Groups and Computation II 28, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, L. Finkelstein and W.M. Kantor (eds.), AMS, Providence, RI, 1997, 69–84.

    Google Scholar 

  6. G. Cooperman, STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems, Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC’ 95), ACM Press, 126–132.

    Google Scholar 

  7. G. Cooperman, TOP-C: A Task-Oriented Parallel C Interface, 5th International Symposium on High Performance Distributed Computing (HPDC-5), 1996, IEEE Press, 141–150 (software at ftp://ftp.ccs.neu.edu/pub/people/gene/top-c/).

    Google Scholar 

  8. G. Cooperman, L. Finkelstein, M. Tselman and B. York, Constructing Permutation Representations for Matrix Groups, J. Symbolic Computation 24, 1997, pp. 1–18.

    Article  MathSciNet  Google Scholar 

  9. G. Cooperman and V. Grinberg, “TOP-WEB: Task-Oriented Metacomputing on the WEB”, International Journal of Parallel and Distributed Systems and Networks 1, 1998, pp. 184–192; a shorter version appears as: “TOP-WEB: Task-Oriented Metacomputing on the Web”, G. Cooperman and V. Grinberg, Proceedings of Ninth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS-97), IASTED/Acta Press, Anaheim, 1997, pp. 279–286.

    Google Scholar 

  10. G. Cooperman and G. Havas, Practical parallel coset enumeration, Proc. of Workshop on High Performance Computation and Gigabit Local Area Networks, G. Cooperman, G. Michler and H. Vinck (eds.), Lecture notes in control and information sciences 226, Springer Verlag, pp. 15–27.

    Google Scholar 

  11. G. Cooperman, G. Hiss, K. Lux, and Jürgen Müller, The Brauer tree of the principal 19-block of the sporadic simple Thompson group, J. of Experimental Mathematics 6(4), 1997, pp. 293–300.

    MATH  Google Scholar 

  12. G. Cooperman and M. Tselman, New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras using the Condensation Technique, Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC’ 96), ACM Press, 155–160.

    Google Scholar 

  13. G.C. Fox, W. Furmanski, M. Chen, C. Rebbi and J. Cowie, WebWork: Integrated Programming Environment Tools for National and Grand Challenges, Proc, of Supercomputing’ 95.

    Google Scholar 

  14. W. Gropp, E. Lusk and A. Skjellum, Using MPI, MIT Press, 1994.

    Google Scholar 

  15. J. Protić, M. Tomašević, V. Milutinović, Distributed Shared Memory: Concepts and Systems, IEEE Computer Society Press, 1998.

    Google Scholar 

  16. M. Swanson, L. Stoller, J. Carter, “Making Distributed Shared Memory Simple, Yet Efficient”, Proc. of the 3rd Int'l Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS'98), pages 2–13, March, 1998.

    Google Scholar 

  17. M. Tselman, Computing permutation representations for matrix groups in a distributed environment, Proc. of DIMACS Workshop on Groups and Computation II 28, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, L. Finkelstein and W.M. Kantor (eds.), AMS, Providence, RI, 1997, 371–382.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science, Northeastern University, 02115, Boston, MA

    Gene Cooperman

Authors
  1. Gene Cooperman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Cooperman (Professor)E. Jessen (Professor)G. Michler (Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London Limited

About this paper

Cite this paper

Cooperman, G. (1999). TOP-C: Task-oriented parallel C for distributed and shared memory. In: Cooperman, G., Jessen, E., Michler, G. (eds) Workshop on wide area networks and high performance computing. Lecture Notes in Control and Information Sciences, vol 249. Springer, London. https://doi.org/10.1007/BFb0110081

Download citation

  • DOI: https://doi.org/10.1007/BFb0110081

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-642-4

  • Online ISBN: 978-1-84628-578-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation