A parallel implementation of the Karmarkar algorithm using a parallel Linear Algebra library

  • Johannes G. G. van de Vorst
Application Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 384)


An important decision in the construction of a parallel Linear Algebra library is the choice of the process structure. The structure that is presented in this article allows for simple functional specifications of the processes and for their compositionality. In the functional specification of a process, matrices and vectors occur as ordinary variables and nothing is said about the communication behaviour of the instances of a process. The representations of the matrices and vectors are distributed across the process instances. A number of distributions are introduced. All library processes conform to the same representation details and communication conventions. The library processes can be composed sequentially, without requiring global synchronisation between process calls. As an example, a parallel implementation of the Karmarkar algorithm is briefly discussed.

Key words

Parallel computing Linear Algebra Library Interfaces Karmarkar 


  1. [1]
    Adler I, Resende MGC, Veiga G (1986) An implementation of Karmarkar's algorithm for linear programming. Operations Research Centre, ORC 86-8Google Scholar
  2. [2]
    Burns A (1988) Programming in occam2. Addison-Wesley, WokinghamGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Johannes G. G. van de Vorst
    • 1
  1. 1.Koninklijke/Shell-Laboratorium, Amsterdam (Shell Research BV)AmsterdamThe Netherlands

Personalised recommendations