Analysis of Performance Evaluation of Parallel Katsevich Algorithm for 3-D CT Image Reconstruction

Abstract

The first theoretically exact spiral cone-beam CT reconstruction algorithm developed was by Katsevich. Recently, Yu et al. implemented the algorithm numerically. Although the method is very promising, the computation is very intensive. It requires huge amount of computer time. Recently, people began to parallelize the algorithm for achieving high performance computation. This paper presents an analysis of data decomposition and data communication in the parallel Katsevich algorithm and develops an analysis expression to evaluate the performance of the algorithm parallelism. The results based on the analytical model and numerical benchmarks compared in a fare agreement. The analytical model provides a great tool to evaluate high performance computing benchmarks in the parallel Katsevich algorithms