On the processing time of a parallel linear system solver

  • A. Stafylopatis
  • A. Drigas
Session 10: Algorithms, Architectures And Performance III
Part of the Lecture Notes in Computer Science book series (LNCS, volume 297)


The speed-up obtained by the use of multiprocessor systems is of major importance for numerical applications involving the solution of large dense systems of linear equations. We are interested here in the performance evaluation of an algorithm for the parallel solution of linear systems. The structure of the algorithm's task graph is representative of a class of recently proposed parallel linear system solvers. We develop a probabilistic model for two different parallel execution schemes depending on the synchronization policy adopted. The analytical solution of the model provides the mean algorithm execution time and therefore the speed-up and efficiency obtained with respect to the single processor environment.


Parallel Algorithm Precedence Constraint Secondary Process Computation Graph Task Graph 
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.


  1. [1]
    D.Heller, "A Survey of Parallel Algorithms in Numerical Linear Algebra", SIAM Rev.20 (1978).Google Scholar
  2. [2]
    D.J.Evans, M.Hatzopoulos, "A Parallel Linear System Solver", Intern. J. Comput. Math.7 (1979).Google Scholar
  3. [3]
    B.Plateau, A.Staphylopatis, "Modeling of the Parallel Resolution of a Numerical Problem on a Locally Distributed Computing System", ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, Seattle, WA, Aug. 1982.Google Scholar
  4. [4]
    P.Heidelberger, K.S.Trivedi, "Queueing Network Models for Parallel Processing with Asynchronous Tasks", IEEE Trans. on Computers, Vol. C-31, No.11, Nov. 1982.Google Scholar
  5. [5]
    E.Gelenbe, A.Lichnewsky, A.Staphylopatis, "Experience with the Parallel Solution of Partial Differential Equations on a Distributed Computing System", IEEE Trans. on Computers, Vol. C-31, No.12, Dec. 1982.Google Scholar
  6. [6]
    G.Fayolle, P.J.B.King, I.Mitrani, "On the Execution of Programs by Many Processors", PERFORMANCE '83, A.K.Agrawala and S.K.Tripathi (editors), North-Holland, 1983.Google Scholar
  7. [7]
    L.M.Adams, T.W.Crockett, "Modeling Algorithm Execution Time on Processor Arrays", IEEE Computer, July 1984.Google Scholar
  8. [8]
    Ph. Mussi, Ph. Nain, "Evaluation of Parallel Execution of Program Tree Structures", ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, Cambridge, Mass., Aug. 1984Google Scholar
  9. [9]
    M.Hatzopoulos, N.M.Missirlis, "Advantages for Solving Linear Systems in an Asynchronous Environment", Journal of Computational and Applied Math. 12 & 13, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • A. Stafylopatis
    • 1
  • A. Drigas
    • 1
  1. 1.Department of Electrical Engineering Computer Science DivisionNational Technical University of AthensZographos, AthensGreece

Personalised recommendations