Cart (Loading....) | Create Account
Close category search window

Performance evaluation of total focusing method on GPP and GPU

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
6 Author(s)
Lambert, J. ; LIST, CEA, Gif-sur-Yvette, France ; Pedron, A. ; Gens, G. ; Bimbard, F.
more authors

Ultrasonic imaging and reconstruction tools are commonly used to detect, identify and measure defects in different mechanical parts. Due to the complexity of the underlying physics and to the evergrowing quantity of acquired data, computation time is becoming a limitation to the optimal inspection of a mechanical part. This article presents the performances of several implementations of a computational heavy algorithm, named Total Focusing Method (TFM), on both Graphics Processing Units (GPU) and General Purpose Processors (GPP). Combination of algorithmic and architectural optimizations have been used. More specifically, on GPU, details are given on shared memory usage and manual thread handling to improve cache localty, whereas on GPP, benefits of SIM-Dization and multithreading are disucussed. With those optimizations, domain specific dimensions enabled the maximum usage of architectural capabilities resulting in a refined algorithm similar to the Berkley dwarf of MapReduce. Both GPU and GPP optimized implementations result in a memory-bound behavior where GPU outperforms the GPP of a factor ×4.

Published in:

Design and Architectures for Signal and Image Processing (DASIP), 2012 Conference on

Date of Conference:

23-25 Oct. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.