|
|
| (15 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| == Assumptions ==
| | [[Serial and Parallel Pi Calculation]] |
| Our program assumes that both the number of data points and the number of processors are powers of two. Also, input files are expected to be in the valid data format for our code (see below).
| |
|
| |
| == Setting up ==
| |
| The project has the following requirements to build: build-essential mpicc git
| |
| To build the project merely issue the following commands:
| |
| $ git clone https://github.com/skylerberg/Parallel_FFT.git
| |
| $ make
| |
|
| |
|
| == Running ==
| | [[Decision Forests]] |
| To run the project, the system must have mpiexec
| |
| Once the project is built the parallel FFT program can be run using the following command:
| |
| $ mpiexec -n 4 ./ptest testdata.txt
| |
| | |
| This can be run on a single computer or a distributed system such as our cluster.
| |
| | |
| == Code ==
| |
| All code is available at https://github.com/skylerberg/Parallel_FFT.
| |
| | |
| == Data format ==
| |
| The data files read by our 1D FFT program consist of a line containing a single integer, n, where n is the number of samples, followed by n lines. Each following line contains to numbers r, i, seperated by a comma and represents a complex number.
| |
| For example:
| |
| | |
| 4
| |
| | |
| 1, 0
| |
| | |
| 1, 0
| |
| | |
| 0, 0
| |
| | |
| 0, 0
| |
| | |
| is a valid file.
| |
| | |
| | |
| == Useful links ==
| |
| [https://www.cs.unm.edu/~brayer/vision/fourier.html Git tutorial] | |
| [https://www.cs.unm.edu/~brayer/vision/fourier.html FFT for images]
| |
Latest revision as of 09:46, 19 March 2016