Block Matrix Multiplication in a Distributed Computing Environment: Experiments with NetSolve

  • Luisa D’Amore
  • Giuliano Laccetti
  • Marco Lapegna
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3911)


We address synchronization issues of some block matrix multiplication algorithms in a distributed computing environment. We discuss performance behavior of a client/server implementation of these algorithms focusing on the most appropriate version which delivers the minimum synchronization overhead. Numerical experiments are carried out using the NetSolve distributed computing system.


Execution Time Total Execution Time Parallel Task Average Execution Time Distribute Computing Environment 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arnold, D., Agrawal, S., Blackford, S., Dongarra, J., Miller, M., Seymour, K., Sagi, K., Shi, Z., Vadhiyar, S.: User’s Guide to NetSolve V. 2.0. Univ. of Tennessee (2004), See also NetSolve home page - URL
  2. 2.
    Beaumont, O., Boudet, V., Rastello, F., Robert, Y.: Matrix Multiplication on Heterogene-ous Platforms. IEEE Trans on Parallel and Distributed Systems 12, 1033–1051 (2001)CrossRefGoogle Scholar
  3. 3.
    Choi, J., Dongarra, J.J., Walker, D.W.: PUMMA: Parallel Universal Matrix Multiplication Algorithms. Concurrency: Practice and Experience 6, 543–570 (1994)CrossRefGoogle Scholar
  4. 4.
    Dongarra, J.: Performance of Various Computers Using Standard Linear Equations Soft-ware (Linpack Benchmark Report), University of Tennessee Computer Science Technical Report, CS-89-85 (2005), See also Top500 Supercomputers home page at URL
  5. 5.
    Foster, I., Kesselman, C.: Computational Grid. In: Foster, Kesselman (eds.) The Grid: Blueprint for a Future Gen-eration Computing Infrastructure, Morgan Kaufmann, San Francisco (1998)Google Scholar
  6. 6.
    Fox, G.: Message Passing from Parallel Computing to the Grid. In: IEEE Computing in Science and Engineering (September/October 2002)Google Scholar
  7. 7.
    GARR home page. - URL:
  8. 8.
    Litzkow, M., Livny, M., Mutka, M.: Condor: a hunter of idle workstation. In: Proc. of 8-th Int. Conf. Distributed Computing Systems, pp. 104–111. IEEE press, Los Alamitos (1988), See also URL Google Scholar
  9. 9.
    Kalinov, A., Lastovetsky, A.: Heterogeneous Distribution of Computations Solving Lin-ear Algebra Problems on Networks of Heterogeneous Computers. Journ. of Parallel and Distributed Computing 61, 520–535 (2001)CrossRefMATHGoogle Scholar
  10. 10.
    Seti@home home page - URL:

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Luisa D’Amore
    • 1
  • Giuliano Laccetti
    • 1
  • Marco Lapegna
    • 1
  1. 1.Department of Mathematics and ApplicationsUniversity of Naples Federico IINaplesItaly

Personalised recommendations