By Topic

A New Parallel Paradigm for Block-Based Gauss-Jordan Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ling Shang ; LIFL, Univ. of Sci. & Technol. of Lille, Lille, France ; Petiton, S. ; Hugues, M.

Two kinds of parallel possibilities which are intrastep and inter-steps parallelism exist in the block-based Gauss-Jordan algorithm which is a classical method of large scale matrix inversion. But the existing parallel paradigm of block-based Gauss-Jordan algorithm just aiming at the intra-step parallelism, canpsilat meet the requirement of making more tasks executed simultaneously in high performance platform can be harnessed more and more computing resources. To overcome the problem described above, this paper presents a hybrid parallel paradigm exploiting all the possible parallelizable parts of the Gauss-Jordan algorithm. In this hybrid parallel paradigm, 1) divide and conquer paradigm is responsible for decomposing the large granularity task into sub-tasks as much as possible; 2) single program multi data (SPMD) paradigm deals with intra-step parallelism in the algorithm; 3) data pipelining paradigm helps to solve the problem of inter-steps parallelism. Finally some experiments based on comparison the hybrid parallel paradigm with the existing parallel paradigm show us the good performance of our paradigm.

Published in:

Grid and Cooperative Computing, 2009. GCC '09. Eighth International Conference on

Date of Conference:

27-29 Aug. 2009