NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Parallel solution of closely coupled systemsThe odd-even permutation and associated unitary transformations for reordering the matrix coefficient A are employed as means of breaking the strong seriality which is characteristic of closely coupled systems. The nested dissection technique is also reviewed, and the equivalence between reordering A and dissecting its network is established. The effect of transforming A with odd-even permutation on its topology and the topology of its Cholesky factors is discussed. This leads to the construction of directed graphs showing the computational steps required for factoring A, their precedence relationships and their sequential and concurrent assignment to the available processors. Expressions for the speed-up and efficiency of using N processors in parallel relative to the sequential use of a single processor are derived from the directed graph. Similar expressions are also derived when the number of available processors is fewer than required.
Document ID
19870041746
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Utku, S.
(Duke University Durham, NC, United States)
Salama, M.
(California Institute of Technology Jet Propulsion Laboratory, Pasadena, United States)
Date Acquired
August 13, 2013
Publication Date
December 1, 1986
Publication Information
Publication: International Journal for Numerical Methods in Engineering
Volume: 23
ISSN: 0029-5981
Subject Category
Computer Systems
Accession Number
87A29020
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available