NVIDA 680 v 670

Quote:

---

Originally Posted by pinhodecarlos

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. :-bd

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. :D

Quote:

---

Originally Posted by Mad Matt

+1 +1 Carlos. :-bd

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. :D

---

OT: Carlos, any plans on a GPU version for NFS@home?

Quote:

---

Originally Posted by Mike029

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.

Quote:

---

Originally Posted by pinhodecarlos

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.