We describe an implementation of a 2D-FFT (Complex-Complex) program in MPI-F on the SP2 and show its actual performance. The purpose of this paper is to illustrate how we use the new tracing utility UTE/MPI provided in MPI-F to verify the correctness of our algorithm, to provide timing statistics summaries, and to unravel other system activities, often unexpected by the user, that affect the total elapsed time of the program. (ScalParSys)
By: Joefon Jann and Hubertus Franke
Published in: RC20085 in 1995
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .