GPU-based ultrafast IMRT plan optimization

Abstract

The widespread adoption of on-board volumetric imaging in cancer radiotherapy has stimulated research efforts to develop online adaptive radiotherapy techniques to handle the inter-fraction variation of the patient's geometry. Such efforts face major technical challenges to perform treatment planning in real time. To overcome this challenge, we are developing a supercomputing online re-planning environment (SCORE) at the University of California, San Diego (UCSD). As part of the SCORE project, this paper presents our work on the implementation of an intensity-modulated radiation therapy (IMRT) optimization algorithm on graphics processing units (GPUs). We adopt a penalty-based quadratic optimization model, which is solved by using a gradient projection method with Armijo's line search rule. Our optimization algorithm has been implemented in CUDA for parallel GPU computing as well as in C for serial CPU computing for comparison purpose. A prostate IMRT case with various beamlet and voxel sizes was used to evaluate our implementation. On an NVIDIA Tesla C1060 GPU card, we have achieved speedup factors of 20-40 without losing accuracy, compared to the results from an Intel Xeon 2.27 GHz CPU. For a specific nine-field prostate IMRT case with 5 x 5 mm(2) beamlet size and 2.5 x 2.5 x 2.5 mm(3) voxel size, our GPU implementation takes only 2.8 s to generate an optimal IMRT plan. Our work has therefore solved a major problem in developing online re-planning technologies for adaptive radiotherapy.

Automated Radiotherapy Treatment Planning Using Fuzzy Inference Systems

“…The objective function usually considers a weighted sum of deviations from prescribed doses (underdose for PTVs and overdose for OARs). It is possible to find examples of linear models [15], mixed integer linear models [16], nonlinear models [17,18], multiobjective models [19] and parallel programming approaches [20,21]. …”

Binary Level-Set Shape Optimization Model and Algorithm for Volumetric Modulated Arc Therapy in Radiotherapy Treatment

“…The optimization problem is solved using a standard quadratic optimization approach with the constraint f (y, θ k ) > 0 for all y, θ k [28]. A comparison with the results of this approach shows that ours is actually very good, with both algorithms applying similarly high doses to the target but with ours applying much lower doses to the critical structures.…”

Enhancement of membrane computing model implementation on GPU by introducing matrix representation for balancing occupancy and reducing inter-block communications

“…The cost of a cluster of computers is very high [10,21,22]. So only the big companies can afford one.…”