I sort of "under-sold" it on the "better design" part of my last bullet. I agree on the memory model being the most interesting thing about this card. So, to summarize, if in 2000 the fastest supercomputer on the planet ran at about 4.9 TFLOPs, does that mean, apples-apples on the LINPACK (and only the LINPACK), that Pascal today would outperform that Supercomputer?
Fp64 cores pascal full#
This excludes the use of a fast matrix multiply algorithm like "Strassen's Method" or algorithms which compute a solution in a precision lower than full precision (64 bit floating point arithmetic) and refine the solution using an iterative approach. In particular, the operation count for the algorithm must be 2/3 n^3 + O(n^2) double precision floating point operations. In an attempt to obtain uniformity across all computers in performance reporting, the algorithm used in solving the system of equations in the benchmark procedure must conform to LU factorization with partial pivoting. That is, on the top 500 list, the first 4.9 Teraflop computer was in 2000, but does that mean that Pascal could provide performance similar to the Supercomputer on the LINPACK benchmark? What I'm trying to figure out, is whether a teraflop directly comparable.
0 kommentar(er)
