Page 3 of 3 FirstFirst 123
Results 21 to 24 of 24

Thread: NVIDA 680 v 670

  1. #21
    Friend of SETI.USA Mad Matt's Avatar
    Join Date
    November 17th, 2010
    Location
    Riding with the Red Baron
    Posts
    1,192

    Re: NVIDA 680 v 670

    Quote Originally Posted by pinhodecarlos View Post
    Mad Matt,

    Despite we all are here as a hobby we need to have an environment concern, at least a tine one...lol

    John P. Myers,

    GFLOPS/watt is more accurate than my ratio but we can go even further, there's must be an even accurate way to measure the work done, maybe number of work units done per energy consumed per day. Of course these calculations must be taking in care for the project you will be concentrating on.

    Carlos
    +1 +1 Carlos.

    It's a heckload of work, I did some of those calculations regarding POEM vs other projects. And I found a pretty clear result (for now). Will see how long this will last as chips and apps progress.

  2. #22
    Past Admin
    Mike029's Avatar
    Join Date
    October 24th, 2010
    Location
    Bronx, New York
    Posts
    3,377

    Re: NVIDA 680 v 670

    Quote Originally Posted by Mad Matt View Post
    +1 +1 Carlos.

    It's a heckload of work, I did some of those calculations regarding POEM vs other projects. And I found a pretty clear result (for now). Will see how long this will last as chips and apps progress.
    OT: Carlos, any plans on a GPU version for NFS@home?



  3. #23
    Gold Member

    Join Date
    August 16th, 2012
    Location
    Milton Keynes, UK
    Posts
    1,314

    Re: NVIDA 680 v 670

    Quote Originally Posted by Mike029 View Post
    OT: Carlos, any plans on a GPU version for NFS@home?
    For the sieve stage I don't think so. The algorithm is very difficult, people of mersenneforum.org can't even port the code to windows 64 bits. If I had the skills I would help but I don't have it. Also there's the memory issue, memory requirements grow roughly with the square root of the sieving time. A paper to read.

    For the polynomial stage there's already one. The same client that does the post-processing stage can take advantage of the GPU for the polynomial search. If you look at NFS@Home details/status when you have a number that it is SNFS then no polynomial search is needed, if GNFS then msieve is used to search for the best polynomial.
    Last edited by pinhodecarlos; 10-01-12 at 04:28 AM.

  4. #24
    Past Admin
    Mike029's Avatar
    Join Date
    October 24th, 2010
    Location
    Bronx, New York
    Posts
    3,377

    Re: NVIDA 680 v 670

    Quote Originally Posted by pinhodecarlos View Post
    For the sieve stage I don't think so. The algorithm is very difficult, people of mersenneforum.org can't even port the code to windows 64 bits. If I had the skills I would help but I don't have it. Also there's the memory issue, memory requirements grow roughly with the square root of the sieving time. A paper to read.

    For the polynomial stage there's already one. The same client that does the post-processing stage can take advantage of the GPU for the polynomial search. If you look at NFS@Home details/status when you have a number that it is SNFS then no polynomial search is needed, if GNFS then msieve is used to search for the best polynomial.
    Thank you.



Page 3 of 3 FirstFirst 123

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •