PRIMARY ANALYSIS


1 Number of computations

  • FP adds and multiplies generally dictate computation speed

  • Split-Radix and FHT elicit the integer to FP tradeoff


    • 2 Computation speed

  • The FHT is clearly the fastest algorithm on all machines

  • UltraSparc performs better than DEC Alpha at higher orders - cache utilization

  • Efficient compiler optimization could effect speed up to 15%

  • Degree of optimization is implementation dependent


    •