PRACE NPT

#include <stdio.h>

void prthead( int nodes )

{

   printf( "Program mod2f computes 1-D, complex-to-complex FFTs:\n" );

   printf( "----------------------------------------------------\n" );

   printf( "No. of processes = %d\n", nodes );

   printf( "        FFT results, Radix-4 algorithm\n" );

   printf( "------------------------------------------------------------" );

   printf( "------------\n" );

   printf( " Length |  Total Time  |    Speed     |  Comm. Time  |" );

   printf( "  Frac.  | Check |\n" );

   printf( "   n =  |     (sec)    |  (Mflop/s)   |     (sec)    |" );

   printf( "    (%)  |   OK  |\n" );

   printf( "------------------------------------------------------------" );

   printf( "------------\n" );

}