FFTE

FFTE is a package by Daisuke Takahashi to compute Discrete Fourier Transforms of 1-, 2- and 3- dimensional sequences of length (2^p)*(3^q)*(5^r).

To run this test with the Phoronix Test Suite, the basic command is: phoronix-test-suite benchmark ffte.

Performance Metrics

FFTE 6.0

Test: N=256, 1D Complex FFT Routine

OpenBenchmarking.org metrics for this test profile configuration based on 246 public results since 4 March 2018 with the latest data as of 12 July 2023.

Below is an overview of the generalized performance for components where there is sufficient statistically significant data based upon user-uploaded results. It is important to keep in mind particularly in the Linux/open-source space there can be vastly different OS configurations, with this overview intended to offer just general guidance as to the performance expectations.

Based on OpenBenchmarking.org data, the selected test / test configuration (FFTE 6.0 - Test: N=256, 1D Complex FFT Routine) has an average run-time of 2 minutes. By default this test profile is set to run at least 3 times but may increase if the standard deviation exceeds pre-defined defaults or other calculations deem additional runs necessary for greater statistical accuracy of the result.

Based on public OpenBenchmarking.org results, the selected test / test configuration has an average standard deviation of 0.4%.

Notable Instruction Set Usage

Notable instruction set extensions supported by this test, based on an automatic analysis by the Phoronix Test Suite / OpenBenchmarking.org analytics engine.

This test profile binary relies on the shared libraries libgfortran.so.5, libm.so.6, libgomp.so.1, libc.so.6, libquadmath.so.0.

Tested CPU Architectures

This benchmark has been successfully tested on the below mentioned architectures. The CPU architectures listed is where successful OpenBenchmarking.org result uploads occurred, namely for helping to determine if a given test is compatible with various alternative CPU architectures.

Recent Test Results