mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Hardware > GPU Computing

Reply
 
Thread Tools
Old 2013-06-23, 13:35   #23
msft
 
msft's Avatar
 
Jul 2009
Tokyo

61010 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
Can I help testing the windows version?
It would be helpful if you do so.
msft is offline   Reply With Quote
Old 2013-06-23, 14:39   #24
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

2·5·11·47 Posts
Default

My Windows 7 laptop graphic card is an ATI RADEON HD7670M but I don't think it has DP capability.
pinhodecarlos is online now   Reply With Quote
Old 2013-06-23, 21:12   #25
kracker
 
kracker's Avatar
 
"Mr. Meeseeks"
Jan 2012
California, USA

37×59 Posts
Default

finally, getting somewhere. My problem was trying to compile 64 bit code(the samples) on a 32 bit compiler... Stupid me.
kracker is offline   Reply With Quote
Old 2013-06-23, 21:43   #26
msft
 
msft's Avatar
 
Jul 2009
Tokyo

2·5·61 Posts
Default

Quote:
Originally Posted by kracker View Post
Yes, This code abducted from MatrixMulDouble.
msft is offline   Reply With Quote
Old 2013-06-23, 21:45   #27
msft
 
msft's Avatar
 
Jul 2009
Tokyo

2·5·61 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
My Windows 7 laptop graphic card is an ATI RADEON HD7670M but I don't think it has DP capability.
I agree.
msft is offline   Reply With Quote
Old 2013-06-24, 02:15   #28
msft
 
msft's Avatar
 
Jul 2009
Tokyo

10011000102 Posts
Default

Quote:
Originally Posted by msft View Post
Sometime clAmdFft-1.10.321 have precision problem.
posted.
msft is offline   Reply With Quote
Old 2013-06-24, 10:07   #29
msft
 
msft's Avatar
 
Jul 2009
Tokyo

26216 Posts
Default

Quote:
Originally Posted by msft View Post
Additional information.
ooura fft.
Code:
#include <math.h>
#include <stdio.h>
void fft(int n, double theta, double ar[], double ai[])
{
    int m, mh, i, j, k;
    double wr, wi, xr, xi;

    for (m = n; (mh = m >> 1) >= 1; m = mh) {
        for (i = 0; i < mh; i++) {
            wr = cos(theta * i);
            wi = sin(theta * i);
            for (j = i; j < n; j += m) {
                k = j + mh;
                xr = ar[j] - ar[k];
                xi = ai[j] - ai[k];
                ar[j] += ar[k];
                ai[j] += ai[k];
                ar[k] = wr * xr - wi * xi;
                ai[k] = wr * xi + wi * xr;
            }
        }
        theta *= 2;
    }
    /* ---- unscrambler ---- */
    i = 0;
    for (j = 1; j < n - 1; j++) {
        for (k = n >> 1; k > (i ^= k); k >>= 1);
        if (j < i) {
            xr = ar[j];
            xi = ai[j];
            ar[j] = ar[i];
            ai[j] = ai[i];
            ar[i] = xr;
            ai[i] = xi;
        }
    }
}
int main()
{
        double ar[1024],ai[1024];
        double pi,theta;
        int i,j,k,n;
        n=32;
        pi = 3.141592653589793;
        theta=-2.0*pi/n;
        for(i=0;i<n;i++)
        {
                ar[i]=i;
                ai[i]=i;
        }
        fft(n,theta,ar,ai);
        printf("ooura %.15e %.15e \n",ar[1],ai[1]);
}
result:
Quote:
ooura -1.784507262017418e+02 1.464507262017418e+02
msft is offline   Reply With Quote
Old 2013-06-26, 02:55   #30
msft
 
msft's Avatar
 
Jul 2009
Tokyo

26216 Posts
Default

New Version.
Speed UP.
Fix Compile warning error.
HD7750:
Quote:
Iteration 1380000 M( 1398269 )C, 0x6650b95f00196d18, n = 73728, CUDALucas v1.66 err = 0.1108 (0:18 real, 1.7757 ms/iter, ETA 0:17)
Iteration 1390000 M( 1398269 )C, 0x554ae339bfea8fae, n = 73728, CUDALucas v1.66 err = 0.1108 (0:17 real, 1.7712 ms/iter, ETA 0:00)
M( 1398269 )P, n = 73728, CUDALucas v1.66
476.88user 2099.99system 41:21.70elapsed 103%CPU (0avgtext+0avgdata 220496maxresident)k
0inputs+163464outputs (0major+2656901minor)pagefaults 0swaps
Attached Files
File Type: bz2 0.36.tar.bz2 (19.6 KB, 459 views)
msft is offline   Reply With Quote
Old 2013-07-09, 08:12   #31
Bdot
 
Bdot's Avatar
 
Nov 2010
Germany

25516 Posts
Default

Hi msft,

I just wanted to check if you are aware that the AMD support guy is waiting for some data from you?

Quote:
What value N does it fail for? Is N=40 or N=32 or does it fail irrespective of N? What about N=16?What is your desired tolerance in terms of RMSE? Or can you report the maximum relative error between corresponding numerical values that you are observing?
With the test program you delivered, he could have tested this in his own, but this is how support works ...

When I see your results here, it really seems as if only specific FFTs are failing, and sometimes you get valid results?

(I'm just very interested in this project - please don't feel pushed by me.)
Bdot is offline   Reply With Quote
Old 2013-07-09, 14:18   #32
kracker
 
kracker's Avatar
 
"Mr. Meeseeks"
Jan 2012
California, USA

37·59 Posts
Default

In PM, he said he is on a trip and will be back this weekend.

@Bdot: So I finally got Ubuntu x64 working.. do you think it is easier to compile for windows on windows or on linux(gcc-mingw)?
kracker is offline   Reply With Quote
Old 2013-07-11, 03:42   #33
msft
 
msft's Avatar
 
Jul 2009
Tokyo

61010 Posts
Default

Hi Bdot,
Thank you for your support.
msft is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
mfakto: an OpenCL program for Mersenne prefactoring Bdot GPU Computing 1724 2023-06-04 23:31
Can't get OpenCL to work on HD7950 Ubuntu 14.04.5 LTS VictordeHolland Linux 4 2018-04-11 13:44
OpenCL accellerated lattice siever pstach Factoring 1 2014-05-23 01:03
OpenCL for FPGAs TObject GPU Computing 2 2013-10-12 21:09
AMD's Graphics Core Next- a reason to accelerate towards OpenCL? Belteshazzar GPU Computing 19 2012-03-07 18:58

All times are UTC. The time now is 15:37.


Fri Jul 7 15:37:43 UTC 2023 up 323 days, 13:06, 0 users, load averages: 1.47, 1.16, 1.09

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔