LINPACK Benchmark Version 2.0 ================= Presented by University of Tennessee Knoxville and Innovative Computing Laboratory. Implementation: Piotr Luszczek This an optimized implementation of the LINPACK Benchmark....
LINPACK Benchmark Version 2.0 ================= Presented by University of Tennessee Knoxville and Innovative Computing Laboratory. Implementation: Piotr Luszczek This an optimized implementation of the LINPACK Benchmark. It is a yardstick of performance because it is widely used and performance numbers are available for almost all relevant systems. The LINPACK Benchmark was introduced by Jack Dongarra. A detailed description as well as a list of performance results on a wide variety of machines is available in PostScript(TM) form from Netlib: http://www.netlib.org/benchmark/. The test used in the LINPACK Benchmark is to solve a dense system of linear equations. The version of the benchmark for TOP500 allows the user to scale the size of the problem and to optimize the software in order to achieve the best performance for a given machine. This performance does not reflect the overall performance of a given system, as no single number ever can. It does, however, reflect the performance of a dedicated system for solving a dense system of linear equations. Since the problem is very regular, the performance achieved is quite high, and the performance numbers give a good correction of peak performance. By measuring the actual performance for different problem sizes N, a user can get not only the maximal achieved performance Rmax for the problem size Nmax but also the problem size N_1/2 where half of the performance Rmax is achieved. These numbers together with the theoretical peak performance Rpeak are the numbers given in the TOP500. 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 the standard operation count for LU factorization with partial pivoting. In particular, the operation count for the algorithm must be 2/3 N*N*N + O(N*N) floating point operations. This excludes the use of a fast matrix multiply algorithms like "Strassian's Method". This is done to provide a comparable set of performance numbers across all computers. If in the future a more realistic metric finds widespread usage, so that numbers for all systems in question are available, we may convert to that performance measure.
Requires iOS 4.0 or later. Compatible with iPad.
Previous Versions
Here you can find the changelog of LINPACK Benchmark since it was posted on our website on 2016-09-28 22:56:03.
The latest version is 2.0 and it was updated on 2024-04-22 13:37:15. See below the changes in each version.
LINPACK Benchmark version 2.0
Updated At: 2010-09-24
Related Apps
Here you can find apps that are similar with LINPACK Benchmark.
We do not host LINPACK Benchmark on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by Apple and passed their terms and conditions to be listed there. We recommend caution when installing it.
The App Store link for LINPACK Benchmark is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.
