Advertisement

Experiment of Multithreading Symbolic and Algebraic Computations with OpenMP

  • Hirokazu Murao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4151)

Abstract

This paper describes the current status of a project for multithreading algebraic computations, which aims at the utilization of today’s high-spec PCs with hyperthreading or dual-core technologies. Our effort is done by applying OpenXM with minimal cost of development, and includes memory management in multithreaded environment. Our empirical results show that the performance gain can be attained in numeric cases and in some cases of purely symbolic computations.

Keywords

Computer Algebra System Garbage Collection Memory Management Polynomial Multiplication Algebraic Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    OpenMP ARB: OpenMP Application Program Interface, Version 2.5. (2005), available online as: http://www.openmp.org/drupal/mp-documents/spec25.pdf
  2. 2.
    Noro, M., Takeshima, T.: Risa/Asir — a computer algebra system. In: Wang, P.S. (ed.) Proceedings of ISSAC 1992, Berkeley, CA, pp. 387–396 (1992)Google Scholar
  3. 3.
    Boehm, H.: A garbage collector for C and C++, http://www.hpl.hp.com/personal/Hans_Boehm/gc/
  4. 4.
    Knuth, D.E.: Seminumerical Algorithms, 3rd edn. The Art of Computer Programming, vol. 2. Addison-Wesley, Reading (1997)Google Scholar
  5. 5.
    Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)MATHGoogle Scholar
  6. 6.
    Dumas, J.G., et al.: LinBox: A generic library for exact linear algebra. In: ICMS 2002, pp. 40–50. World Scientific Pub., Singapore (2002)Google Scholar
  7. 7.
    Kawame, Y., Murao, H.: MBLAS: Modular basic linear algebra subprograms for computer algebra. In: SACSIS 2004, pp. 139–140 (2004) (in Japanese)Google Scholar
  8. 8.
    Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Information Theory IT-32(1), 54–62 (1986)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Endo, T., Taura, K.: SGC: A parallel conservative garbage collector on shared-memory multiprocessors, http://www.yl.is.s.u-tokyo.ac.jp/gc/sgc.shtml

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hirokazu Murao
    • 1
  1. 1.Department of Computer ScienceThe University of Electro-Communications 

Personalised recommendations