skip to main content

Title: (U) Computation acceleration using dynamic memory

Many computational applications require the repeated use of quantities, whose calculations can be expensive. In order to speed up the overall execution of the program, it is often advantageous to replace computation with extra memory usage. In this approach, computed values are stored and then, when they are needed again, they are quickly retrieved from memory rather than being calculated again at great cost. Sometimes, however, the precise amount of memory needed to store such a collection is not known in advance, and only emerges in the course of running the calculation. One problem accompanying such a situation is wasted memory space in overdimensioned (and possibly sparse) arrays. Another issue is the overhead of copying existing values to a new, larger memory space, if the original allocation turns out to be insufficient. In order to handle these runtime problems, the programmer therefore has the extra task of addressing them in the code.
Authors:
 [1]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
OSTI Identifier:
1215623
Report Number(s):
LA-UR--14-28888
DOE Contract Number:
AC52-06NA25396
Resource Type:
Conference
Resource Relation:
Conference: 18. Biennial Nuclear Explosives Code Development Conference, Los Alamos, NM (United States), 20-24 Oct 2014
Research Org:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Org:
USDOE
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING