Tiling Models for Spatial Decomposition in AMTRAN

PDF Version Also Available for Download.

Description

Effective spatial domain decomposition for discrete ordinate (S{sub n}) neutron transport calculations has been critical for exploiting massively parallel architectures typified by the ASCI White computer at Lawrence Livermore National Laboratory. A combination of geometrical and computational constraints has posed a unique challenge as problems have been scaled up to several thousand processors. Carefully scripted decomposition and corresponding execution algorithms have been developed to handle a range of geometrical and hardware configurations.

Physical Description

PDF-file: 17 pages; size: 0.3 Mbytes

Creation Information

Compton, J. C. & Clouse, C. J. May 27, 2005.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Publisher

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.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

Effective spatial domain decomposition for discrete ordinate (S{sub n}) neutron transport calculations has been critical for exploiting massively parallel architectures typified by the ASCI White computer at Lawrence Livermore National Laboratory. A combination of geometrical and computational constraints has posed a unique challenge as problems have been scaled up to several thousand processors. Carefully scripted decomposition and corresponding execution algorithms have been developed to handle a range of geometrical and hardware configurations.

Physical Description

PDF-file: 17 pages; size: 0.3 Mbytes

Source

  • Presented at: Join Russian-American Five-Laboratory Conference on Computational Mathematics/Physics, Vienna, Austria, Jun 19 - Jun 23, 2005

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Report No.: UCRL-CONF-212607
  • Grant Number: W-7405-ENG-48
  • Office of Scientific & Technical Information Report Number: 877776
  • Archival Resource Key: ark:/67531/metadc873342

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • May 27, 2005

Added to The UNT Digital Library

  • Sept. 21, 2016, 2:29 a.m.

Description Last Updated

  • Dec. 2, 2016, 3:41 p.m.

Usage Statistics

When was this article last used?

Congratulations! It looks like you are the first person to view this item online.

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Compton, J. C. & Clouse, C. J. Tiling Models for Spatial Decomposition in AMTRAN, article, May 27, 2005; Livermore, California. (digital.library.unt.edu/ark:/67531/metadc873342/: accessed September 26, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.