An optimal plan in modern treatment planning tools is found through the use of an iterative optimization algorithm, which deals with a high amount of patient-related data and number of treatment parameters to be optimized. Thus, calculating a good plan is a very time-consuming process which limits the application for patients in clinics and for research activities aiming for more accuracy. A common technique to handle the vast amount of radiation dose data is the concept of the influence matrix (DIJ), which stores the dose contribution of each bixel to the patient in the main memory of the computer. This study revealed that a bottleneck for the optimization time arises from the data transfer of the dose data between the memory and the CPU. In this note, we introduce a new method which speeds up the data transportation from stored dose data to the CPU. As an example we used the DIJ approach as is implemented in our treatment planning tool KonRad , developed at the German Cancer Research Center (DKFZ) in Heidelberg. A data cycle reordering method is proposed to take the advantage of modern memory hardware. This induces a minimal eviction policy which results in a memory behaviour exhibiting a 2.6 times faster algorithm compared to the naive implementation. Although our method is described for the DIJ approach implemented in KonRad, we believe that any other planning tool which uses a similar approach to store the dose data will also benefit from the described methods.     «

An optimal plan in modern treatment planning tools is found through the use of an iterative optimization algorithm, which deals with a high amount of patient-related data and number of treatment parameters to be optimized. Thus, calculating a good plan is a very time-consuming process which limits the application for patients in clinics and for research activities aiming for more accuracy. A common technique to handle the vast amount of radiation dose data is the concept of the influence matrix...     »