Supercomputing in compression of temporal fringe pattern analysis

T. W. Ng; K. T. Ang; G. Argentini

doi:10.1117/12.614710

18 August 2005 Supercomputing in compression of temporal fringe pattern analysis

T. W. Ng, K. T. Ang, G. Argentini

Proceedings Volume 5880, Optical Diagnostics; 588005 (2005) https://doi.org/10.1117/12.614710
Event: Optics and Photonics 2005, 2005, San Diego, California, United States

Abstract

Temporal fringe pattern analysis is invaluable in transient phenomena studies but necessitates long processing times. Here, we describe a parallel computing strategy based on the single program multiple data (SPMD) model and hyper-threading processor technology to reduce the execution time. In a two-node cluster workstation configuration, we found that execution periods reduced by 1.6 times using four virtual processors. To allow even lower execution times with increasing number of processors, the time allocated for data transfer, data read, and waiting should be minimized. Parallel or super computing is found here to present a feasible approach to reduce execution times in temporal fringe pattern analysis.

Citation Download Citation

T. W. Ng, K. T. Ang, and G. Argentini "Supercomputing in compression of temporal fringe pattern analysis", Proc. SPIE 5880, Optical Diagnostics, 588005 (18 August 2005); https://doi.org/10.1117/12.614710

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available