Abstract
This chapter describes a message-passing implementation of KIVA-3 combustion engine code. KIVA-3 is a 3D finite-difference code, solving fluid, particle, and chemistry equations over a mesh made up of arbitrary hexahedrons. Although the pre-processor uses a block-structured mesh to begin with, the main code does not require any order in the grid structure. Each computational element is recognized through the neighborhood connectivity arrays and this leads to indirect addressing that complicates any type of loop decomposition on parallel machines. Dependencies in the code extend only one layer in each direction and the presence of ghost cells and cell-face boundary arrays in the code suits block-wise domain decomposition. The chapter mentions that internal boundaries are handled like the external boundaries, enabling the application of the same rules, physics, and computation to a part of the domain as well as to the whole domain. The code is currently being tested on the Intel Paragon at Center for Computational Sciences (CCS) of the Oak Ridge National Laboratory (ORNL).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
