A multi-grained distributed implementation of the parallel Block Conjugate Gradient algorithm

The Block Conjugate Gradient algorithm (Block‐CG) was developed to solve sparse linear systems of equations that have multiple right‐hand sides. We have adapted it for use in heterogeneous, geographically distributed, parallel architectures. Once the main operations of the Block‐CG (Tasks) have been...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation Vol. 22; no. 15; pp. 2053 - 2072
Main Authors: Murli, A., D'Amore, L., Laccetti, G., Gregoretti, F., Oliva, G.
Format: Journal Article
Language:English
Published: Chichester, UK John Wiley & Sons, Ltd 01.10.2010
Subjects:
Algorithms
Block Conjugate Gradient
Blocking
Concurrency
Conjugate gradients
Linear systems
Mathematical analysis
Middleware
multi-grained parallelism
parallel and distributed algorithm
Tasks
ISSN:1532-0626, 1532-0634, 1532-0634
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Block Conjugate Gradient algorithm (Block‐CG) was developed to solve sparse linear systems of equations that have multiple right‐hand sides. We have adapted it for use in heterogeneous, geographically distributed, parallel architectures. Once the main operations of the Block‐CG (Tasks) have been collected into smaller groups (subjobs), each subjob is matched by the middleware MJMS (MPI Jobs Management System) with a suitable resource selected among those which are available. Moreover, within each subjob, concurrency is introduced at two different levels and with two different granularities: the coarse‐grained parallelism to perform independent tasks and the fine‐grained parallelism within the execution of a task. We refer to this algorithm as to multi‐grained distributed implementation of the parallel Block‐CG. We compare the performance of a parallel implementation with the one of the distributed implementation running on a variety of Grid computing environments. The middleware MJMS—developed by some of the authors and built on top of Globus Toolkit and Condor‐G—was used for co‐allocation, synchronization, scheduling and resource selection. Copyright © 2010 John Wiley & Sons, Ltd.
Bibliography:ark:/67375/WNG-SSD41004-9
ArticleID:CPE1548
MIUR-PON S.Co.P.E. Italian National Project
istex:0D211C5FE92447A6770226A2DA353DB3F16A0962
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1532-0626
1532-0634
1532-0634
DOI:10.1002/cpe.1548