Vector and parallel algorithms for chemical process simulation on supercomputers
Mallya, Jayarama U.
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/20121
Description
Title
Vector and parallel algorithms for chemical process simulation on supercomputers
Author(s)
Mallya, Jayarama U.
Issue Date
1996
Doctoral Committee Chair(s)
Stadtherr, Mark A.
Department of Study
Chemical and Biomolecular Engineering
Discipline
Chemical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Chemical
Language
eng
Abstract
Impressive gains in computer technology, including vector and parallel processing architectures, provide the computational power to realistically model, simulate, design, and optimize complex chemical processes. A critical computational step in large-scale chemical process simulation using rigorous equation-based models is the solution of a large sparse linear system of equations. Most of the currently used sparse solvers were developed for use on conventional serial machines and these do not take full advantage of the power of modern parallel-vector supercomputers.
This dissertation presents new vector and parallel algorithms for solution of sparse linear systems arising in chemical process simulation. New multifrontal algorithms (MFA1P and MFA2P) exploit vector processing by relying on vectorized dense matrix kernels. These algorithms are also designed to take advantage of good initial structure present in the process flowsheeting matrices. PFAMP is a new parallel frontal solver using a multiple fronts scheme. PFAMP exploits both parallel and vector processing by identifying coarse task granularity in the solution of equation-based (EB) flowsheeting problems.
The results of the computational experiments on a CRAY-C916 parallel-vector supercomputer indicated that in the presence of a good initial structure in the matrix, MFA1P and MFA2P outperformed most of the currently available linear solvers. PFAMP is attractive because it exploits both vector and parallel processing architecture of the modern supercomputers. Considerable reduction in real (wallclock) time for the overall solution was achieved by using PFAMP. Speedups upto 2.5 on four processors are achieved on industrial-scale problems.
Use of vector and parallel processing capabilities of modern supercomputers for chemical process design, simulation, and optimization will be a crucial factor for chemical, petroleum, and other material processing industries, in maintaining competitiveness in the global marketplace into the twenty-first century. This makes PFAMP particularly attractive as a sparse linear solver for the next generation process simulation packages.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
