Abstract
The first exact spiral cone-beam CT reconstruction algorithm was developed by Katsevich (2002, 2004). Recently, Yu and Wang (2004a, 2004b) implemented the algorithm numerically. Although the method is very promising, the computation is very intensive. It requires huge amounts of computational time. Recently, people (Deng et al., 2006; Yang et al., 2006) began to parallelise the algorithm for achieving high performance computing (HPC). This paper presents a performance analysis of the parallel Katsevich algorithm (Deng et al., 2006) by developing an analytical expression to evaluate the performance of the algorithm parallelism. The results from the analytical model and numerical experiments are compared in a fair agreement. The analytical model provides a useful tool to estimate HPC benchmarks in the parallel Katsevich algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
