DORT and TORT workshop -- Outline for presentation for performance issues for large problems
Conference
·
OSTI ID:319815
This paper addresses the problem of running large TORT programs. The problem being a limited amount of time per job and limited amount of memory and disk space. The solution that the author outlines here is to break up the TORT run in time and space. For the time problem run multiple, sequential, dependent jobs. For the space problem use TORT internal memory conservation features. TORT is a three-dimensional discrete ordinates neutron/photon transport code.
- Research Organization:
- Knolls Atomic Power Lab. (KAPL), Niskayuna, NY (United States)
- Sponsoring Organization:
- USDOE Assistant Secretary for Nuclear Energy, Washington, DC (United States)
- DOE Contract Number:
- AC12-76SN00052
- OSTI ID:
- 319815
- Report Number(s):
- KAPL-P-000062; CONF-9804109-; ON: DE98007514; TRN: 99:003953
- Resource Relation:
- Conference: DORT and TORT workshop, Knoxville, TN (United States), 24 Apr 1998; Other Information: PBD: Apr 1998
- Country of Publication:
- United States
- Language:
- English
Similar Records
DORT and TORT workshop -- Outline for presentation for splicing with TORSED and TORSET
Multitasking TORT under UNICOS: Parallel performance models and measurements
3-D discrete ordinates calculations with parallel-vector processors
Conference
·
Wed Apr 01 00:00:00 EST 1998
·
OSTI ID:319815
Multitasking TORT under UNICOS: Parallel performance models and measurements
Conference
·
Mon Sep 27 00:00:00 EDT 1999
·
OSTI ID:319815
3-D discrete ordinates calculations with parallel-vector processors
Conference
·
Sun Jan 01 00:00:00 EST 1989
·
OSTI ID:319815