skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: DORT and TORT workshop -- Outline for presentation for performance issues for large problems

Abstract

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.

Authors:
Publication Date:
Research Org.:
Knolls Atomic Power Lab. (KAPL), Niskayuna, NY (United States)
Sponsoring Org.:
USDOE Assistant Secretary for Nuclear Energy, Washington, DC (United States)
OSTI Identifier:
319815
Report Number(s):
KAPL-P-000062; CONF-9804109-
ON: DE98007514; TRN: 99:003953
DOE Contract Number:  
AC12-76SN00052
Resource Type:
Conference
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
Subject:
66 PHYSICS; 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; T CODES; PERFORMANCE; NEUTRAL-PARTICLE TRANSPORT; MEMORY MANAGEMENT; TASK SCHEDULING; DISCRETE ORDINATE METHOD

Citation Formats

Barnett, A. DORT and TORT workshop -- Outline for presentation for performance issues for large problems. United States: N. p., 1998. Web.
Barnett, A. DORT and TORT workshop -- Outline for presentation for performance issues for large problems. United States.
Barnett, A. 1998. "DORT and TORT workshop -- Outline for presentation for performance issues for large problems". United States. https://www.osti.gov/servlets/purl/319815.
@article{osti_319815,
title = {DORT and TORT workshop -- Outline for presentation for performance issues for large problems},
author = {Barnett, A},
abstractNote = {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.},
doi = {},
url = {https://www.osti.gov/biblio/319815}, journal = {},
number = ,
volume = ,
place = {United States},
year = {Wed Apr 01 00:00:00 EST 1998},
month = {Wed Apr 01 00:00:00 EST 1998}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: