MMM
Results 1 to 25 of 102

Thread: CUDA Factorial Benchmark from TOC.ru

Threaded View

  1. 08-30-2009, 03:59 PM #6
    poke349
    poke349 is offline
    Xtreme Enthusiast
    Join Date
    Mar 2009
    Location
    Bay Area, California
    Posts
    705
    Quote Originally Posted by [XC] riptide View Post
    Have you got mathematica? Can you show us the result? We already know there are insanely fast algorithms and approximations that can be used http://www.luschny.de/math/factorial/Benchmark.html .... but we also know there are many algorithms for calculation Pi to 1million places.. all with diff times.
    Code:
    Timing[750000!;]
{0.405, Null}
    i7 920 @ 3.5 GHz

    Mathematica can't multi-thread high-precision arithmetic. So there's no way see how much better it can go.


    On the other hand... I can mod the program in my siggy to do multi-threaded factorials (using a sub-optimal algorithm)... And I'm certain I can beat 0.405 seconds.

    But again... off topic.
    Last edited by poke349; 08-30-2009 at 04:01 PM.
    Main Machine:
    AMD FX8350 @ stock --- 16 GB DDR3 @ 1333 MHz --- Asus M5A99FX Pro R2.0 --- 2.0 TB Seagate

    Miscellaneous Workstations for Code-Testing:
    Intel Core i7 4770K @ 4.0 GHz --- 32 GB DDR3 @ 1866 MHz --- Asus Z87-Plus --- 1.5 TB (boot) --- 4 x 1 TB + 4 x 2 TB (swap)
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Bookmarks

Bookmarks

Posting Permissions

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

Forum Rules