Speedup performance analysis of parallel Katsevich algorithm for 3D CT image reconstruction
by Jun Ni, Junjun Deng, Tao He, Hengyong Yu, Ge Wang
International Journal of Computational Science and Engineering (IJCSE), Vol. 6, No. 3, 2011

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.

Online publication date: Wed, 18-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com