Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor:

Abstract: "The Fortran code ARC2D from the Perfect Benchmark Suite is described, and its optimization for a hierarchical shared memory multiprocessor (Cedar) is presented. First sequential optimizations are described, which reduce the number of floating point operations by 33% and improve data...

Full description

Saved in:
Bibliographic Details
Main Author: Bramley, Randy (Author)
Format: Book
Language:English
Published: Urbana, Ill. 1991
Series:Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report 1128
Subjects:
Summary:Abstract: "The Fortran code ARC2D from the Perfect Benchmark Suite is described, and its optimization for a hierarchical shared memory multiprocessor (Cedar) is presented. First sequential optimizations are described, which reduce the number of floating point operations by 33% and improve data locality. For the Cedar version, the data is distributed among the cluster memories, instead of placing the data into global memory and simply using Cedar as a 32 processor shared memory machine. The approach is commonly called domain decomposition but is more accurately described as data decomposition or data distribution."
Physical Description:48 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!