Skip to main content

Lessons Learned from Using CORBA for Components in Scientific Computing

  • Conference paper
  • 342 Accesses

Abstract

The use of component architectures to solve the problem of reuse and interoperability in scientific computing has been investigated by various research groups during the last years. Moreover, architectures for Internet accessible mathematical services have been proposed. In this paper we give a brief abstract requirements analysis with respect to these problems and show that there is an existing technology that solves most of the requirements. The Common Object Request Broker Architecture (CORBA) provides a component framework that can be used for Internet accessible mathematical services and also for the efficient reuse of medium grained size functionality. We give some examples on the use of CORBA with respect to both applications. We provide measurement data which show that components of a granularity of less than {100} ms can be reused with an acceptibly small overhead.

Partially supported by Deutsche Forschungsgemeinschaft under grants Ku 966/4-1 and Ku 966/6-1. Most of the presented research was done as member of the Symbolic Computation Group at the University of Tübingen

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ABBOT, J. PossoXDR, 1995. Available at http://WIN.rrz.uni-koeln.de/themen/Computeralgebra/OpenMath/related.html.

  2. AMRHEIN, B., GLOOR, 0., AND KUCHLIN, W. A case study of multi-threaded Gröbner basis completion. In Proceedings of the 1 996 International Symposium on Symbolic and Algebraic Computation (ISSAC ’96) (Zürich, July 1996), Y. N. Lakshman, Ed., Association for Computing Machinery.

    Google Scholar 

  3. AT&T LABORATORIES CAMBRIDGE. omniORB, 1999. http://wIN.uk.research. att.com/omniORB/.

    Google Scholar 

  4. BERNARDIN, L., CHAR, B., AND KALTOFEN, E. Symbolic computation in Java: An appraisement. In Dooley [6], pp. 237–244.

    Google Scholar 

  5. BUCHBERGER, B., COLLINS, G. E., ENCARNACION, M. J., HONG, H., JOHNSON, J. R., KRANDICK, W., Loos, R., MANDACHE, A., NEUBACHER, A., AND VIELHABER, H. SACLIB User’s Guide. Johannes Kepler Universität, 4020 Linz, Austria, Mar. 1993. Available via anonymous ftp at http://melmac.risc.uni-linz.ac.atinpub/saclib.

  6. DOOLEY, S., Ed. Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC ’99) (Vancouver, BC, Canada, 1999), The Association for Computing Machinery, ACM.

    Google Scholar 

  7. EL KAHOUI, M., AND WEBER, A. Deciding Hopf bifurcations by quantifier elimination in a software-component architecture. Journal of Symbolic Computation (2000). To appear.

    Google Scholar 

  8. GOBEL, M., KUCHLIN, W., MULLER, S., AND WEBER, A. Extending a Java based framework for scientific software-components. In Computer Algebra in Scientific Computing (CASC ’99) (Munchen, June 1999), V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov, Eds., Springer-Verlag, pp. 207–222.

    Google Scholar 

  9. Hoss, J. Parallele Berechnung von Gröbner Basen in parametrisierten Ringen. Diplomarbeit, Universität Tübingen, Fakultät für Informatik, Jan. 1998.

    Google Scholar 

  10. IGLIO, P., AND ATTARDI, G. Software components for computer algebra. In Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation (ISSAC ’98) (Rostock, Germany, 1998), O. Gloor, Ed., The Association for Computing Machinery, ACM, pp. 62–69.

    Google Scholar 

  11. JANSSEN, B., AND SPREITZER, M. ILU Reference Manual. XEROX, 1997. For Version 2.08. Available at ftp:http://www.simg.com/vactorlbe.html.

  12. 12.LIDIA GROUP. LiDIA Manual Version 1.3-A library for computational number theory. TH Darmstadt, Alexanderstr. 10, 64283 Darmstadt, Germany, 1997. http://www.informatik.th-darmstadt.de/TI/LiDIA/Weleome.html.

    Google Scholar 

  13. Loos, R. G. K., AND COLLINS, G. E. Revised report on the algorithm description language ALDES. Tech. Rep. WSI-92-14, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 72076 Tübingen, Germany, 1992.

    Google Scholar 

  14. MOWBRAY, T., AND MALVEAU, R. CORBA Design Patterns. Wiley, 1996.

    Google Scholar 

  15. OBJECT MANAGEMENT GROUP (OMG). The Common Object Request Broker: Architecture and specification, Dec. 1998. Revision 2.3.

    Google Scholar 

  16. OBJECT ORIENTED CONCEPTS, INC. ORBacus, 1999. http://www. ooe. eom/ob/.

    Google Scholar 

  17. OPEN MATH CONSORTIUM. OpenMath. http://www. openmath. org/, 1999.

    Google Scholar 

  18. ORFALI, R., AND HARKEY, D. Client/Server Programming with JAVA and CORBA, second ed. Wiley, 1998.

    Google Scholar 

  19. ORFALI, R., HARKEY, D., AND EDWARDS, J. The Essential Distributed Objects Survival Guide. John Wiley & Sons, 1995.

    Google Scholar 

  20. PoSSo GROUP. Polynomial systems library. Available at ftp://posso.dm.unipi.it, 1996.

  21. ROMER, K., AND PUDER, A. Mico is Corba, 1998. http://www.vsb.es.uni-frankfurt.de/-mieo.

  22. SIEGEL, J. CORBA Fundamentals and Programming. John Wiley & Sons, New York, 1996.

    Google Scholar 

  23. SIMON, G. A. Communication Interface between SAC-2 and LiDIA. In Proc. of OpenMath Workshop 6 (Zürich, 27-28th July 1996), J. Abbott, Ed. http://www.openmath.org/Vl/History/workshops/proeeedings-6.html.

  24. SIMON, G. A. Interoperability between computer algebra systems. Tech. Rep. WSI-96-8, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 72076 Tübingen, Germany, 1996.

    Google Scholar 

  25. SUN MICROSYSTEMS. Java Remote Method Invocation - Distributed Computing for Java, 1997. http://java.sun.eom:80/marketing/eollateral/javarmi.html.

    Google Scholar 

  26. WANG, P. Design and protocol for internet accessible mathematical computation. In Dooley [6].

    Google Scholar 

  27. WEBER, A., KUCHLIN, W., AND EGGERS, B. Parallel computer algebra software as a Web component. Concurrency: Practice and Experience 10, 11–13 (1998), 1179–1188.

    Google Scholar 

  28. WORLD WIDE WEB CONSORTIUM. Math Home Page. http://www.w3.org/Math/, 1999.

    Google Scholar 

  29. ZIPPEL, R. The MathBus. In Internet Accessible Mathematical Computation (Vancouver, Canada, July 1999). http://SymbolicNet.mcs.kent.edu/icm/research/iamc99paper/Zippel.pdf.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weber, A., Simon, G., Küchlin, W., Hoss, J. (2000). Lessons Learned from Using CORBA for Components in Scientific Computing. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57201-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57201-2_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41040-9

  • Online ISBN: 978-3-642-57201-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics