Cost-effective parallel preconditioner for network-based computing

Hyoung Joong Kim, Hyung Soo Kim, Kyung Choi, Hyang Beom Lee, Hyun Kyo Jung, Song Yop Hahn

Research output: Contribution to journalArticlepeer-review


A linear solver, the QMR, for a very large linear system is implemented for network-based computing. Network-based computing with cluster of workstations or inexpensive personal computers recently has become an important and very successful technique. Network-based computing enables fast computation and resolves shortage of storage with inexpensive computers on the desks. Cluster of inexpensive computers offers them aggregated computing power and sufficient storage to challenge large-scale problems. Assume that the total storage available in computers is just sufficient for solving the problem. This is often the case in real-world applications since the linear system is too large. Thus, any preconditioner which requires more storage than that available is excluded. Classical Jacobi, Gauss-Seidel, and SOR and its variant, SSOR, is considered. Performance of preconditioners is analyzed.

Original languageEnglish
Pages (from-to)1800-1803
Number of pages4
JournalIEEE Transactions on Magnetics
Issue number2 PART 2
Publication statusPublished - 1997

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering


Dive into the research topics of 'Cost-effective parallel preconditioner for network-based computing'. Together they form a unique fingerprint.

Cite this