In this paper, we discuss some of the issues in obtaining high performance for block-structured adaptive mesh refinement software for partial differential equations. We show examples in which AMR scales to thousands of processors. We also discuss a number of metrics for performance and scalability that can provide a basis for understanding the advantages and disadvantages of this approach.
Publisher Info:
"Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (United States)"
Place of Publication:
Berkeley, California
Provided By
UNT Libraries Government Documents Department
Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.
Descriptive information to help identify this article.
Follow the links below to find similar items on the Digital Library.
Description
In this paper, we discuss some of the issues in obtaining high performance for block-structured adaptive mesh refinement software for partial differential equations. We show examples in which AMR scales to thousands of processors. We also discuss a number of metrics for performance and scalability that can provide a basis for understanding the advantages and disadvantages of this approach.
Colella, Phillip; Bell, John; Keen, Noel; Ligocki, Terry; Lijewski, Michael & Van Straalen, Brian.Performance and scaling of locally-structured grid methods forpartial differential equations,
article,
July 19, 2007;
Berkeley, California.
(digital.library.unt.edu/ark:/67531/metadc893575/:
accessed August 21, 2017),
University of North Texas Libraries, Digital Library, digital.library.unt.edu;
crediting UNT Libraries Government Documents Department.