Skip to main content
Log in

A Parallel Adaptive Gauss-Jordan Algorithm

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This paper presents a parallel adaptive version of the block-based Gauss-Jordan algorithm, utilized to invert large matrices. This version includes a characterization of the workload and a mechanism of its folding/unfolding. Furthermore, this paper proposes a work scheduling strategy and an application-oriented solution for the fault tolerance problem. The application is implemented and experimented with MARS1 in dedicated and non-dedicated environments. The results show that an absolute efficiency of 92% is possible on a cluster of DEC/ALPHA processors interconnected by a Gigaswitch network and an absolute efficiency of 67% can be obtained on an Ethernet network of SUN-Sparc 4 workstations. Moreover, the algorithm is tested on a meta-system including both the two parks of machines. Finally, an out-of-core solution for the algorithm is proposed. This solution allows a gain of 66% of data input operations and reduces the central memory space required for storing the data space of the algorithm by a factor q, where q is the dimension of the matrix to be inverted in terms of data blocks.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K. P. Birman. Building Secure and Reliable Network Applications. Manning Publications Co, 1996.

  2. S. Dowaji. Contribution à l'étude des problémes d'équilibrage de charge dans les environnements distributés: Ph.D. thesis, Université de Versailles, 1995.

  3. E. N. Elnozahy, D. B. Johnson, and Y. M. Wang. A survey of rollback-recovery protocols in message-passing systems. TR CMU-CS-96-181, School of Computer Science, Carnegie Mellon University, September 1996.

  4. L. S. Blackford, et al. Scalapack: A linearalgebra library for message-passing computers. SIAM Conference on Parallel Processing, March 1997.

  5. MPI forum.MPI: A message passing interface standard. Technical report, Apr. 1994.

  6. A. Geist, A. Beguelin, and J. Dongarra, et al., eds., PVM: Parallel Virtual Machine. A User's Guide and Tutorial for Networked Parallel Computing, MIT Press, Cambridge, Mass., 1994.

    Google Scholar 

  7. Z. Hafidi. MARS: Un environnement de programmationparallèle adaptative dans les réseaux de machines hétérogènes multi-utilisateurs. Ph.D. Thesis, Université de Lille I, 1998.

  8. R. Haimes and D. E. Edwards. Visualization in a parallelprocessing environment. AIAA Paper 97-0348 (invited), Reno NV, January 1997.

  9. D. Kebbal, E. G. Talbi,and J. M. Geib. A new approach for checkpointing parallel adaptive applications. PDPTA '97 proceedings, Las Vegas, NV, pp. 1643-1651, June 1997.

  10. N. Melab, N. Devesa, M. P. Lecouffe, and B. Toursel. Adaptive load balancingof irregular applications. A case study: IDA* applied to the 15-puzzle problem. In Proceedings of the Third International Workshop, IRREGULAR '96, Santa Barbara, CA, 19-21 August, Springer-Verlag LNCS 1117, 1996.

  11. R. Namyst and J. F. Méhaut. PM2: Parallel multithreaded machine. A computing environment for distributed architectures. In Parco'95 Proceedings, Gent, Belgium, pp. 279-285, September, North-Holland, 1995.

  12. S. G. Petiton.Parallelization on an MIMD computer with real-time scheduler, Gauss-Jordan example. In M. H. Wright, ed., Aspects of Computation on Asynchronous Parallel Processors. Elsevier Science, IFIP, 1989.

  13. J. S. Plank, Y. Kim, and J. J. Dongarra. Algorithm-based diskless checkpointing for fault tolerant matrix operations. In 25th Symposium on Fault-Tolerant Computing, Pasadena, CA, June 1995.

  14. C. Reinsch and F. Bauer. Inversion of positive matrices by theGauss-Jordan method. I. J. Wilkinson and C. Reinsch, eds., Handbook of Automatic Computation, Contribution I/3, Vol. II. Springer-Verlag, Berlin, 1987.

    Google Scholar 

  15. E.-G. Talbi, J.M. Geib, Z. Hafidi, and D. Kebbal. Mars: Anadaptive parallel programming environment. In High Performance Cluster Computing: Architectures and Systems, Vol. 1, Prentice Hall, Upper Saddle River, NJ, 1999.

    Google Scholar 

  16. E.-G. Talbi, J.-M. Geib, Z. Hafidi, and D. Kebbal. Stealingidle time in large networks of workstations. In R. K. Watts, ed., Submicron Cluster Computing, pp. 5-27. John Wiley, New York, 1999.

    Google Scholar 

  17. O. Tingleff. Systems of linear equations solved by block Gauss-Jordan method using atransputer cube. Technical report IMM-REP-1995-08. Institute of Mathematical Modelling, Technical University of Denmark, 1995. ??

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Melab, N., Talbi, EG. & Petiton, S. A Parallel Adaptive Gauss-Jordan Algorithm. The Journal of Supercomputing 17, 167–185 (2000). https://doi.org/10.1023/A:1008182404262

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008182404262

Navigation