Building and Running Application Codes on the ARL Linux Networx Cluster (JVN)

2006 ◽  
Author(s):  
George Petit
Keyword(s):  
Application Codes

scholarly journals MiniApps derived from production HPC applications using multiple programing models

2016 ◽  
Vol 32 (4) ◽  
pp. 582-593 ◽  
Author(s):  
OE Bronson Messer ◽  
Ed D’Azevedo ◽  
Judy Hill ◽  
Wayne Joubert ◽  
Mark Berrill ◽  
...  
Keyword(s):  
Large Scale ◽  
Performance Characteristics ◽  
Production Mode ◽  
Actual Performance ◽  
Oak Ridge ◽  
Application Codes

We have developed a set of reduced, proxy applications (“MiniApps”) based on large-scale application codes supported at the Oak Ridge Leadership Computing Facility (OLCF). The MiniApps are designed to encapsulate the details of the most important (i.e. the most time-consuming and/or unique) facets of the applications that run in production mode on the OLCF. In each case, we have produced or plan to produce individual versions of the MiniApps using different specific programing models (e.g., OpenACC, CUDA, OpenMP). We describe some of our initial observations regarding these different implementations along with estimates of how closely the MiniApps track the actual performance characteristics (in particular, the overall scalability) of the large-scale applications from which they are derived.

scholarly journals AGS to RHIC Beam Line: Application Codes

1994 ◽  
Author(s):  
W. MacKay ◽  
T. Satogata
Keyword(s):  
Beam Line ◽  
Application Codes

scholarly journals Exploring the feasibility of lossy compression for PDE simulations

2018 ◽  
Vol 33 (2) ◽  
pp. 397-410 ◽  
Author(s):  
Jon Calhoun ◽  
Franck Cappello ◽  
Luke N Olson ◽  
Marc Snir ◽  
William D Gropp
Keyword(s):  
Energy Cost ◽  
High Performance ◽  
Truncation Error ◽  
Computational Cost ◽  
Lossy Compression ◽  
Data Movement ◽  
Hardware Failure ◽  
Traditional Approaches ◽  
Application Codes ◽  
Performance Computing

Checkpoint restart plays an important role in high-performance computing (HPC) applications, allowing simulation runtime to extend beyond a single job allocation and facilitating recovery from hardware failure. Yet, as machines grow in size and in complexity, traditional approaches to checkpoint restart are becoming prohibitive. Current methods store a subset of the application’s state and exploit the memory hierarchy in the machine. However, as the energy cost of data movement continues to dominate, further reductions in checkpoint size are needed. Lossy compression, which can significantly reduce checkpoint sizes, offers a potential to reduce computational cost in checkpoint restart. This article investigates the use of numerical properties of partial differential equation (PDE) simulations, such as bounds on the truncation error, to evaluate the feasibility of using lossy compression in checkpointing PDE simulations. Restart from a checkpoint with lossy compression is considered for a fail-stop error in two time-dependent HPC application codes: PlasComCM and Nek5000. Results show that error in application variables due to a restart from a lossy compressed checkpoint can be masked by the numerical error in the discretization, leading to increased efficiency in checkpoint restart without influencing overall accuracy in the simulation.

scholarly journals The Fortran-P Translator: Towards Automatic Translation of Fortran 77 Programs for Massively Parallel Processors

1995 ◽  
Vol 4 (1) ◽  
pp. 1-21 ◽  
Author(s):  
Matthew O'keefe ◽  
Terence Parr ◽  
B. Kevin Edgar ◽  
Steve Anderson ◽  
Paul Woodward ◽  
...  
Keyword(s):  
High Performance ◽  
Parallel Machines ◽  
Parallel Processors ◽  
Massively Parallel ◽  
Automatic Translation ◽  
Efficient Code ◽  
Self Similar ◽  
User Friendly ◽  
Application Codes ◽  
Fortran 77

Massively parallel processors (MPPs) hold the promise of extremely high performance that, if realized, could be used to study problems of unprecedented size and complexity. One of the primary stumbling blocks to this promise has been the lack of tools to translate application codes to MPP form. In this article we show how applications codes written in a subset of Fortran 77, called Fortran-P, can be translated to achieve good performance on several massively parallel machines. This subset can express codes that are self-similar, where the algorithm applied to the global data domain is also applied to each subdomain. We have found many codes that match the Fortran-P programming style and have converted them using our tools. We believe a self-similar coding style will accomplish what a vectorizable style has accomplished for vector machines by allowing the construction of robust, user-friendly, automatic translation systems that increase programmer productivity and generate fast, efficient code for MPPs.

The IAPWS Industrial Formulation 1997 for the Thermodynamic Properties of Water and Steam

2000 ◽  
Vol 122 (1) ◽  
pp. 150-184 ◽  
Author(s):  
W. Wagner ◽  
J. R. Cooper ◽  
A. Dittmann ◽  
J. Kijima ◽  
H.-J. Kretzschmar ◽  
...  
Keyword(s):  
Thermodynamic Properties ◽  
International Association ◽  
Scientific Basis ◽  
Industrial Use ◽  
The Individual ◽  
New Formulation ◽  
Application Codes ◽  
Computation Speed ◽  
Energy Engineering

In 1997, the International Association for the Properties of Water and Steam (IAPWS) adopted a new formulation for the thermodynamic properties of water and steam for industrial use. This new formulation, called IAPWS Industrial Formulation 1997 for the Thermodynamic Properties of Water and Steam (IAPWS-IF97), replaces the previous industrial formulation, IFC-67, that had formed the basis for power-plant calculations and other applications in energy engineering since the late 1960’s. IAPWS-IF97 improves significantly both the accuracy and the speed of the calculation of the thermodynamic properties compared with IFC-67. The differences between IAPWS-IF97 and IFC-67 will require many users, particularly boiler and turbine manufacturers, to modify design and application codes. This paper summarizes the need and the requirements for such a new industrial formulation and gives the entire numerical information about the individual equations of IAPWS-IF97. Moreover, the scientific basis for the development of the equations is summarized and the achieved quality of IAPWS-IF97 is presented regarding the three criterions accuracy, consistency along region boundaries, and computation speed. For comparison, corresponding results for the previous standard IFC-67 are also presented. [S0742-4795(00)02201-8]

Xevolver: A code transformation framework for separation of system‐awareness from application codes

2019 ◽  
Vol 32 (7) ◽  
Author(s):  
Kazuhiko Komatsu ◽  
Ayumu Gomi ◽  
Ryusuke Egawa ◽  
Daisuke Takahashi ◽  
Reiji Suda ◽  
...  
Keyword(s):  
Code Transformation ◽  
Application Codes

Query Languages in NoSQL Databases

2015 ◽  
pp. 415-437 ◽  
Author(s):  
Maristela Holanda ◽  
Jane Adriana Souza
Keyword(s):  
Query Language ◽  
Data Retrieval ◽  
Query Languages ◽  
Nosql Databases ◽  
Different Types ◽  
Application Codes

This chapter aims to investigate how NoSQL (Not Only SQL) databases provide query language and data retrieval mechanisms. Users attest to many advantages in using the NoSQL databases for specific applications, however, they also report that querying and retrieving data easily continues to be a problem. The NoSQL operations require that, during the project, the queries must be thought of as built-in application codes. The authors intend to contribute to the investigation of querying, considering different types of NoSQL databases.

Sign in / Sign up

Export Citation Format

Share Document