Experimental RELAP5-3D Time Step Improvements Dr. George L Mesina RELAP5 International Users Seminar Nov 18-20, 2008 Idaho Falls, ID.

Slides:



Advertisements
Similar presentations
Basics of Recursion Programming with Recursion
Advertisements

Debugging ACL Scripts.
CMSC 611: Advanced Computer Architecture Performance Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.
DTSTEP: Development of an Integer Time Step Algorithm George L Mesina INL David L Aumiller BMPC September 2010.
Chapter 7 - Iteration. Chapter Goals Program repitiation statements – or loops – with the for, while, and do-while statements Program repitiation statements.
Order Statistics Sorted
Chapter 4: Trees Part II - AVL Tree
Week 5: Loops 1.  Repetition is the ability to do something over and over again  With repetition in the mix, we can solve practically any problem that.
CS0004: Introduction to Programming Repetition – Do Loops.
ECIV 201 Computational Methods for Civil Engineers Richard P. Ray, Ph.D., P.E. Error Analysis.
Radiative Transfer with Predictor-Corrector Methods ABSTRACT TITLE : Radiative Transfer with Predictor-Corrector Methods OBJECTIVE: To increase efficiency,
Introduction to Analysis of Algorithms
CS107 Introduction to Computer Science
Performance D. A. Patterson and J. L. Hennessey, Computer Organization & Design: The Hardware Software Interface, Morgan Kauffman, second edition 1998.
Classes, methods, and conditional statements We’re past the basics. These are the roots.
Dynamic lot sizing and tool management in automated manufacturing systems M. Selim Aktürk, Siraceddin Önen presented by Zümbül Bulut.
Governing equation for concentration as a function of x and t for a pulse input for an “open” reactor.
Chapter Resynchsonous Stabilizer Chapter 5.1 Resynchsonous Stabilizer Self-Stabilization Shlomi Dolev MIT Press, 2000 Draft of Jan 2004, Shlomi.
SIMULATION. Simulation Definition of Simulation Simulation Methodology Proposing a New Experiment Considerations When Using Computer Models Types of Simulations.
Monté Carlo Simulation MGS 3100 – Chapter 9. Simulation Defined A computer-based model used to run experiments on a real system.  Typically done on a.
CMSC 611: Advanced Computer Architecture Performance Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.
Improved results for a memory allocation problem Rob van Stee University of Karlsruhe Germany Leah Epstein University of Haifa Israel WADS 2007 WAOA 2007.
Automatic Mediation Of Privacy-sensitive Resource Access In Smartphone Applications Ben Livshits and Jaeyeon Jung Microsoft Research.
Fundamentals of Python: From First Programs Through Data Structures
Fundamentals of Python: First Programs
1 Doug Barber Lance Larsen Information Systems Laboratories, Inc. Information Systems Laboratories, Inc. RELAP5-3D Fluid Properties Modifications.
INL/CON Dr. George L Mesina (INL) Joshua Hykes (PSU), Riley Cumberland (UMR) Donna Guillen (INL) STREAMLINING OF RELAP5-3D RELAP5 International.
Chapter 6 Control Using Wireless Throttling Valves.
©Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 1 Defect testing l Testing programs to establish the presence of system defects.
Viscous Stress Terms for the RELAP5-3D Momentum Equations Adam Kraus and George Mesina RELAP5 International Users Seminar 2010 September 20-23,
Week 5 - Wednesday.  What did we talk about last time?  Exam 1!  And before that?  Review!  And before that?  if and switch statements.
Lecturer: Dr. AJ Bieszczad Chapter 11 COMP 150: Introduction to Object-Oriented Programming 11-1 l Basics of Recursion l Programming with Recursion Recursion.
A Framework for Elastic Execution of Existing MPI Programs Aarthi Raveendran Graduate Student Department Of CSE 1.
Artificial Intelligence Methods Neural Networks Lecture 4 Rakesh K. Bissoondeeal Rakesh K. Bissoondeeal.
Blackjack Betting and Playing Strategies: A Statistical Comparison By Jared Luffman MSIM /3/2007.
Optimising Cuts for HLT George Talbot Supervisor: Stewart Martin-Haugh.
1 SOP and POS Expressions from K-maps The examples so far have all generated minimal SOP expressions. POS expressions can be formed as follows: 1.Group.
Accuracy Based Generation of Thermodynamic Properties for Light Water in RELAP5-3D 2010 IRUG Meeting Cliff Davis.
RELAP5-3D Uncertainty Analysis A.J. Pawel and Dr. George L. Mesina International RELAP Users’ Seminar 2011 July 25-28, 2011.
Chapter 12. Recursion Basics of Recursion Programming with Recursion Computer Programming with JAVA.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Column Generation By Soumitra Pal Under the guidance of Prof. A. G. Ranade.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.
Chapter 11Java: an Introduction to Computer Science & Programming - Walter Savitch 1 Chapter 11 l Basics of Recursion l Programming with Recursion Recursion.
FORS 8450 Advanced Forest Planning Lecture 6 Threshold Accepting.
EGR 115 Introduction to Computing for Engineers MATLAB Basics 6: Debugging in MATLAB Monday 15 Sept 2014 EGR 115 Introduction to Computing for Engineers.
8.1 8 Algorithms Foundations of Computer Science  Cengage Learning.
MICROPROCESSOR DETAILS 1 Updated April 2011 ©Paul R. Godin prgodin gmail.com.
Adiabatic Quantum Computing Josh Ball with advisor Professor Harsh Mathur Problems which are classically difficult to solve may be solved much more quickly.
April 2002HEC-RAS Version 3.0 FY02Slide 1 of 12 HEC-RAS Version 3.1 Troubleshooting.
Principal Component Analysis
General Troubleshooting Nonlinear Diagnostics. Goal – In this workshop, our goal is to use the nonlinear diagnostics tools available in Solution Information.
CSC 212 – Data Structures Lecture 15: Big-Oh Notation.
Exercise 1: Maximum element for the following code a- what is the basic operation? b- what is C(n)? d-what is the running time?
The information systems lifecycle Far more boring than you ever dreamed possible!
Additional Examples CSE420/598, Fall 2008.
Sequential Equivalence Checking for Clock-Gated Circuits Hamid Savoj Robert Brayton Niklas Een Alan Mishchenko Department of EECS University of California,
Solving Common Fraction Equations
Shortest Paths and Minimum Spanning Trees
CSCE 212 Chapter 4: Assessing and Understanding Performance
Unit 2 Programming.
IMAGE BASED VISUAL SERVOING
CMSC 611: Advanced Computer Architecture
Iteration: Beyond the Basic PERFORM
Basics of Recursion Programming with Recursion
Principal Component Analysis
Java Programming Loops
International Data Encryption Algorithm
CMSC 611: Advanced Computer Architecture
Presentation transcript:

Experimental RELAP5-3D Time Step Improvements Dr. George L Mesina RELAP5 International Users Seminar Nov 18-20, 2008 Idaho Falls, ID

Overview Background on old method Improvements Measures Results

Background RELAP5-3D major time step controls –Material Courant Limit –Truncation Error –Upper and lower time step limits –Time-targeting Must exactly reach plot, output, restart times –Some other controls via input not relevant Trip stop, dump, etc.

Background: Material Courant Limit Material Courant Limit (MCL) In a control volume: Δt i n is the time required for fluid to cross from the entrance to the exit of volume i on time step n. Larger time steps with semi-implicit method cause instabilities. Cannot exceed Δt i n in any volume. Flow region MCL is:

Background: Time Step Limits Upper and Lower Limits –The user establishes upper and lower time step limits via input. –The upper limit creates a minimum number of steps to complete a transient (if Δt i n is never cut). Mass Error –The deviation from perfect solution of the continuity equation. The time step is cut if mass error becomes excessive or Δt i n exceeds MCL.... Ideally.

Background: Time Step Control However, to allow faster code execution, selective violation of MCL was implemented –5 “bins,” S J = {Δt n J+5i | i = 1, 2,..., NVOL/5}, J = 1,2,3,4,5 –MCL J = min(S J ).Note: MCL 1 == MCL. –Δt n = MCL 2.Note: Opt 15 sets Δt n = MCL 1 = MCL. To hit time targets exactly, use halving and doubling. –Plots, minor & major edits, restarts are multiples of DTMAX. –RULE: Never bypass a target time. –If we had T=1.75, plot time=2.0, and Δt n = 0.5, the T+dt > 2.0. Would need to HALVE Δt n to hit plot time. In practice, this is controlled differently.

Background: Time Step Control To hit time targets exactly, only double on even time steps. Controlled by integer, NREPET. NREPET = Number of Δt n steps needed to reach next multiple of DTMAX. –Example: Δt n = 0.25*DTMAX, and the cumulative time is: T n = 5.25*DTMAX, NREPET n = 3. –Double Δt n implies halve NREPET n. In example, 3/2=1. Wrong! –Need Δt n+1 =0.25*DTMAX. Then T n+1 =5.5*DTMAX, NREPET n+1 =2. –Double now. Δt n+2 =0.5*DTMAX. NREPET n+2 =1.

Background: Halving & Doubling Halving and doubling algorithm based on DTMAX –Δt n = 2 -k DTMAX,0 < k < log 2 (DTMAX/DTMIN). –Halve if MCL or mass error condition violated. –Double if mass error “low” & Δt n < MCL/2. Combining DTMAX limit with selective MCL violation, the flow region MCL is given by:

Improvements Deficiencies & possible improvements –Should never violate MCL Many users run with exact MCL only. –Allow time steps other than 2 -k DTMAX. However, still hit time targets exactly –Allow code to run above DTMAX (user option). Must stay “safely” below MCL. Apply multiplier, m<1.0, such that Δt n < m*MCL

Integer Time-step All work was done in the context of the integer time- stepping revision of subroutine DTSTEP. –This work enables exact calculation of time in long-running transients –Important for working with coupled codes. To understand integer time-stepping, thing of your computer’s clock cycle. –If it is a 4 GHz machine, it performs 4,000,000,000 ticks per second. –Each tick is 1/ sec. –An integer, t, can count the ticks from 1 to –Floating point time T = t/

Time Targets A 4-step approach is used to hit time targets. –Check for target 3 steps in advance.

Approach MCL if above DTMAX DTMAX is often far below MCL If the user could allow violation of DTMAX, larger time steps could often be taken. –Propose making the option controlled on the time step card. –The user could turn it on and off to examine important parts of the transient as needed.

MCL vs Current Time-step (DTMAX) Typpwr

Typpwr Violating DTMAX

Selecting the MCL Multiplier, m Multiplying the MCL by safety value ensures the time step does not come “too close” to instability. A study was done by running numerous test models with a variety of values of m. –m = 0.5k, k = 1, 2,..., 20. –The input models were taken from the set of problems transmitted with the code. The study showed that generally,.85 <= m <=.95 was best. –In fact, m = 0.9 proved about the best choice.

Background b

b

Combining DTMAX violation and m Combined improvements –Sometimes the number of time steps is reduced significantly. –Sometimes there is no change. Note that use of excessively frequent time targets interferes with every improvement –Because code must reduce time step to hit target For Typical PWR, the reduction is most pronounced.

End end

Conclusions The existing algorithm for semi-implicit time- stepping was reviewed. Several improvements were suggested. Two improvements were combined and shown to allow significant reduction in code runtime These are the MCL multiplier and DTMAX violation It is proposed that these be made a user option.