|
| |
| | LINPACK - Wikipedia, the free encyclopedia |
 | | LINPACK is a software library for performing numerical linear algebra on digital computers. | | | The best Linpack benchmark performance is used as a performance measure for ranking supercomputers in the TOP500 list of the world's fastest computers. | | | This benchmark represents a measure of a system's floating point computing power. |
|
http://en.wikipedia.org/wiki/Linpack
(192 words)
|
|
| |
| | Dell Power Solutions - Federal International |
| | Linpack, a popular benchmark, is typically used to evaluate computing horsepower, whether that of simple machines or complex, high-performance clusters. | | | Linpack is a collection of computer programs and subroutines that solve linear algebraic equations and linear least-squares problems. | | | A compute-intensive benchmark, Linpack was developed for symmetric multiprocessing (SMP) systems, not for high-performance clusters, with Streaming SIMD (single-instruction, multiple-data) Extensions 2 (SSE2) optimizations. |
|
http://www1.us.dell.com/content/topics/global.aspx/power/en/ps3q02_khalid?c=us&cs=RC977746&l=en&s=fin
(1828 words)
|
|
| |
| | Frequent Asked Questions on the LINPACK Benchmark |
| | Linpack is not the most efficient software for solving matrix problems. | | | The best Linpack benchmark performance achieved is used as a performance measure in ranking the computers. | | | The appendix comprised data for one commonly used path in Linpack for a matrix problem of size 100, on a collection of widely used computers (23 in all), so users could estimate the time required to solve their matrix problem. |
|
http://cm.bell-labs.com/netlib/benchmark/faq-linpack.html
(3938 words)
|
|
| |
| | LINPACK: numerical library for linear equation solution |
| | The LINPACK library has been used extensively in the computing industry as a performance benchmark, and results have been tabulated for a very large number of computers in a report that is updated approximately twice a year. | | | The LINPACK benchmark is used to compare high-performance computers: the ranking of the world's top 500 supercomputers is frequently cited. | | | LINPACK is one of several other xxxpack projects, among them, EISPACK (for matrix eigenvalues and eigenvectors, and singular-value decompositions), MINPACK (for function minimization and least-squares solutions), and LAPACK (for linear equations, least-squares, singular-value decomposition, and eigenvalue/eigenvector solution). |
|
http://www.math.utah.edu/software/linpack.html
(509 words)
|
|
| |
| | TOP500 AND HPCC BENCHMARKS -- WHAT THEY CAN AND CAN'T DO |
| | Linpack is a benchmark from dense linear algebra. | | | Indeed, the Linpack R_max performance number, which is an _upper bound_ on performance when there is _exceptional_ temporal locality, offers no insights to the application developer into how the algorithmic characteristics of his application will affect execution time, and no insights to the system designer into which architectural characteristics of a computer system are important. | | | The simplest punchline is that HPCC Linpack plus the four HPCC memory-access benchmarks give you data so that you can use the locality characteristics of the computational phases of your applications to predict when you will get Linpack-class performance from a given phase and when you will get much less. |
|
http://www.taborcommunications.com/hpcwire/hpcwireWWW/04/0625/107896.html
(3984 words)
|
|
| |
| | The Linpack Benchmark |
| | The benchmark used in the LINPACK Benchmark is to solve a dense system of linear equations. | | | For the TOP500, we used that version of the benchmark that 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. | | | A parallel implementation of the Linpack benchmark and instructions on how to run it can be found at |
|
http://www.top500.org/lists/linpack.php
(443 words)
|
|
| |
| | Announcements |
| | The intent of the LINPACK benchmark is to provide a measure of realistic peak performance (as opposed to theoretical peak performance) of the computer system under consideration, where the focus is on large scale computing, specifically, on a computer's ability to efficiently solve numerically intensive problems. | | | A key to obtaining the highest possible LINPACK score on a given computer system is the computational kernel used in solving the large system of linear equations. | | | The benchmark itself was run using HPL (www.netlib.org/benchmark/hpl), a portable and freely available implementation of the high performance computing LINPACK benchmark. |
|
http://www.ccr.buffalo.edu/newsReleases/newsRelease.htm
(506 words)
|
|
| |
| | LINPACK |
| | NCAR users: the LINPACK binary library is available to NCAR computer users, for linking with Fortran programs, on some of SCD's compute-servers. | | | See "SCD Computers, Products, and Libraries" for the names of those computers. | | | Library overview documentation is available as the readme file in netlib's linpack directory. |
|
http://www.scd.ucar.edu/softlib/LINPACK.html
(149 words)
|
|
| |
| | Intel® Math Kernel Library â“ Linpack Benchmark information |
| | Intel Optimized LINPACK packages are built using BLAS and LAPACK software that has been highly optimized for Intel processors and is available to software developers via the Intel® Math Kernel Library and Intel® Cluster Math Kernel Library. | | | For use on distributed memory computer systems (clusters), this package is an implementation of the Massively Parallel MP LINPACK* benchmark. | | | These free packages are implementations of the LINPACK benchmarks that have been highly tuned for maximum performance on Intel® Xeon® and Itanium® 2 processor-based SMP and Cluster systems. |
|
http://www.intel.com/cd/software/products/asmo-na/eng/perflib/mkl/219821.htm
(554 words)
|
|
| |
| | Los Alamos takes second, third spots on Top500 supercomputing list The Newsbulletin November 22, 2002 |
| | The project uses the Linpack benchmark, a mathematical code that all computers are required to run, as a performance measure to rank the computer systems. | | | Each section of the Q computer currently operates independently during system checkout, with one section in the classified environment and the other in the unclassified computing environment. | | | In recent Linpack runs, little Q has performed at speeds that would place it close to the current top 20 computers in the world. |
|
http://www.lanl.gov/orgs/pa/newsbulletin/2002/11/22/text02.shtml
(719 words)
|
|
| |
| | Linpack benchmark |
| | The 1000x1000 linpack problem can be formulated in terms of dgemm() operations involving subblocks of the large matrix, and that is how optimal performance is achieved. | | | As you have seen for yourself, it is about a factor of 10 slower than an optimal implementation for the linpack benchmark. | | | This will give you an estimate (and a reasonable upper bound) to the 1000x1000 linpack benchmark results using an optimal algorithm. |
|
http://www.codecomments.com/message209059.html
(919 words)
|
|
| |
| | MSN Tech & Gadgets |
| | Linpack measures how fast a system can solve complicated algebraic calculations--a test that measures processor performance well but not other aspects of a supercomputer. | | | For one thing, the decades-old Linpack permits historical comparisons in high-performance computing, or HPC, and for another, a system that can't get a high Linpack won't do well on other tests, he said. | | | No one understands these additional benchmarks in terms of what they are and what they are not," said Dave Turek, leader of IBM's "Deep Computing" team. |
|
http://msn.com.com/2100-9584_22-5238405.html
(932 words)
|
|
| |
| | NEC holds record for Linpack TPP |
| | LINPACK (LINear equations software PACKage) is a library of subroutines used for solving linear equations. | | | The TPP result is often considered to be the performance level that could be obtained on technical applications when programme optimization has been performed. | | | There are three LINPACK tables published that are differentiated by the matrix solution size. |
|
http://www.hoise.com/primeur/99/articles/monthly/SW-PR-02-99-36.html
(145 words)
|
|
| |
| | linpack/general-information.html |
| | A few copies of this book, as well as microfiche copies of the HELP files, compilation listings, and test results are available from the College of Science Computer Office, 210 South Physics. | | | The routines which support double precision complex (IBM's COMPLEX*16) cannot be implemented on the DEC-20. | | | On UNIX, do something like f77 -o foo foo.f -llinpack The COMPLEX*16 type is supported by the Sun and Ardent Fortran compilers, and the z* routines are therefore present in the library. |
|
http://www.math.utah.edu:8080/software/linpack/linpack/general-information.html
(281 words)
|
|
| |
| | HPL - A Portable Implementation of the High-Performance Linpack Benchmark for Distributed-Memory Computers |
| | HPL - A Portable Implementation of the High-Performance Linpack Benchmark for Distributed-Memory Computers | | | It can thus be regarded as a portable as well as freely available implementation of the High Performance Computing Linpack Benchmark. | | | The HPL package provides a testing and timing program to quantify the accuracy of the obtained solution as well as the time it took to compute it. |
|
http://www.netlib.org/benchmark/hpl
(291 words)
|
|
| |
| | ARSC T3D Users' Newsletter 25 |
| | "Linpack" when it was introduced in 1979 by Jack Dongarra, Cleve Moler, J.R. Bunch and Pete Steward, it was not a benchmark but a collection of linear algebra routines and the "Linpack Benchmark" grew from an appendix of the Linpack Users' Guide that compared various machines solving a 100x100 system of linear equations. | | | In 1992, the Lapack package was introduced as a replacement for Linpack and Eispack (a package of eigenvalue routines). | | | It contains replacements for the linpack routines sgefa and sgesl, and the linpack benchmark can be modified to run with Lapack routine with only the following changes: |
|
http://www.arsc.edu/support/news/T3Dnews/T3Dnews25.shtml
(1167 words)
|
|
| |
| | Which test is best? |
| | As for Linpack, the Defense Advanced Research Projects Agency has funded the development of what it hopes will be a more comprehensive benchmark, called the High Performance Computing Challenge Benchmark. | | | Twice a year a coalition of computer scientists compiles a list of the world’s 500 fastest computers. | | | One of the dirty little secrets of the government high-performance computing world, though, is that Linpack doesn’t measure anything useful, other than how quickly a supercomputer can execute the Linpack test. |
|
http://www.gcn.com/23_33/mgmt_edition/27899-1.html
(1584 words)
|
|
| |
| | A.java |
| | * * to compute inverse(a) * c where c is a matrix * with p columns * dgeco(a,lda,n,ipvt,rcond,z) * if (!rcond is too small){ * for (j=0,jlinpack. |
|
http://www.newspiritcompany.com/src/LinPackSrc.htm
(1126 words)
|
|
| |
| | List of Software - linpack |
| | LINPACK is a transportable library of Fortran 77 subroutines for solving linear algebra problems. | | | For further information on lapack have a look at the linpack home page. | | | For more information on each routine, you should consult the comments at the head of each subroutine file. |
|
http://www.maths.soton.ac.uk/support/catal/linpack.U.L.html
(3183 words)
|
|
| |
| | Sidebar: The Linpack Benchmark - Computerworld |
| | The benchmark is based on Linpack, a software library for performing numerical linear algebra on digital computers that was written in Fortran by computer scientists Jack Dongarra, Jim Bunch, Cleve Moler and Pete Stewart in the 1970s. | | | The Linpack benchmark measures how fast a computer solves dense systems of linear equations and measures a system's floating-point computing power. | | | Dongarra, now a distinguished professor of computer science at the University of Tennessee, later introduced the Linpack benchmark, which is used as the performance measure for ranking supercomputers in the Top500 list of the world's fastest computers. |
|
http://www.computerworld.com/hardwaretopics/hardware/story/0,10801,102050,00.html?source=x407
(823 words)
|
|
| |
| | MP Linpack Teraflop Info |
| | The benchmark results are maintained by in the LINPACK Performance Report, "Performance of Various Computers Using Standard Linear Equations Software" by Dr. Jack Dongarra at the University of Tennessee [4]. | | | The MP LINPACK Teraflop run was made with OSF running in the service partition, and Cougar running in the compute partition. | | | The initial implementation was based on work that Robert van de Geijn did to capture the world record in 1991 on the Intel Touchstone Delta [7]. |
|
http://now.cs.berkeley.edu/cs267/lectures/teraflop_info.html
(729 words)
|
|
| |
| | 2/25/98 - SUN OUT PERFORMS COMPETITION ON LINPACK HIGHLY PARALLEL COMPUTING BENCHMARK WITH NEW 336 MHZ ULTRASPARC II ... |
| | A single node Sun HPC 10000 server--popularly known as the Starfire™ server--demonstrated 34.17 gigaflops (Gflop/s) for the Highly Parallel Computing version of the Linpack benchmark with a matrix size of 20,352 (Nmax). | | | There are several metrics for each Linpack benchmark, which define performance expectations and testing limitations. | | | Results for the system were achieved using 64 UltraSPARC II (336 MHz) CPUs(1), each with 4 megabytes (MB) second-level cache, running the Solaris 2.6 operating environment. |
|
http://www.sun.com/smi/Press/sunflash/9802/sunflash.980225.2.html
(1027 words)
|
|
| |
| | 11/10/98 - SUN HPC 10000 SERVER BEATS SGI, HP AND IBM ON LINPACK BENCHMARK |
| | The LINPACK Benchmark is a widely used set of tests emphasizing floating point addition and multiplication that measures the performance for solving linear equations used in scientific and engineering environments. | | | The TOP 500 list uses Parallel LINPACK Benchmark performance results to rank the most powerful computers in the world. | | | There are multiple metrics for each LINPACK Benchmark, which define performance expectations and testing limitations. |
|
http://www.sun.com/smi/Press/sunflash/9811/sunflash.981110.5.html
(1146 words)
|
|
| |
| | Software Folder - Kane Computing Ltd: GDD7000 Optimised LINPACK Library for C6000 |
| | The library is a set of about 100 functions and macros that solve algebraic systems of linear equations with various matrices, including; real or complex, general, band, symmetric, Toeplitz and others. | | | BLAS Level 1 functions are hand-coded in assembly to obtain maximum possible performance from the TMS320C6000 DSPs. | | | Kane Computing Ltd: GDD7000 Optimised LINPACK Library for C6000 |
|
http://focus.ti.com/catalog/docs/thirdpartysoftwarefolder.tsp?softwareId=4973
(283 words)
|
|
| |
| | Cray X1 supercomputer demonstrates superior processor speed and efficiency on industry-standard Linpack test |
| | Cray officials said Linpack is a processor-centric benchmark test and was not designed to measure other system attributes that can contribute significantly to real-world performance, including internal memory speed, disks, and external networks. | | | On Cray X1 systems varying from 4 to 60 processors, the per-processor speed averaged 11.55 Gflop/s), 2.5 to 10.6 times faster than the published per-processor speeds of HPC products from other U.S. vendors. | | | "These initial Linpack results confirm the strong capability of the Cray X1 processors, however." |
|
http://www.hoise.com/primeur/03/articles/monthly/AE-PR-06-03-56.html
(331 words)
|
|
| |
| | Performance Comparison of Java/.NET Runtimes (Oct 2004) |
| | All these versions of Linpack benchmark are not well optimized (ex. | | | For C# version of Linpack benchmark and Eratosthenes Sieve. | | | Only this runtime ran on Windows XP and others were on Linux. |
|
http://www.shudo.net/jit/perf
(921 words)
|
|
| |
| | Ace's Hardware |
| | As the array size increases, the benchmark shows the limits imposed by the memory hierarchy. | | | (Ace's Hardware binary is based on the C port of the original FORTRAN benchmark, based on the Linpack libraries.) | | | Pay special attention to the performance between the 0 and 261 KB marks. |
|
http://www.aceshardware.com/Spades/read.php?article_id=15000198
(1035 words)
|
|
| |
| | Makefile |
| | If you use the LINPACK and BLAS source code for the auto-double version of MGGHAT, refer to the object files as | | | NOTE: This is not the double precision version of LINPACK and BLAS. | | | On most UNIX systems, if LINPACK is in the library |
|
http://math.nist.gov/reports/mgghat/userguide/node13.html
(343 words)
|
|
| |
| | HPC - HP Integrity servers trounce the competition on Linpack and SPEC benchmarks |
| | (2) More information on the Linpack benchmark is available at http://netlib.org/benchmark/performance.ps. | | | November 20, 2003 HP Integrity servers, based on the Intel® Itanium® 2 processor, have achieved record results on several standard high performance computing benchmarks, including: Linpack N*N, SPEC ENV2002, SPEC CHEM2002, SPEC OMP, and SPECfp benchmarks. | | | HP Integrity systems have also maintained the No. 1 position at the top of the list in the Linpack report |
|
http://www.hp.com/techservers/news/news_integrity_server_benchmarks.html
(760 words)
|
|
| |
| | NAO Classes for Linpack |
| | These classes present the Linpack matrices as NALinearMatrix objects, which are operators. | | | The classes correspond to the different storage formats in Linpack. | | | Linpack is available from Netlib, as is Lapack. |
|
http://www.research.ibm.com/nao/Reference/Classes/Linpack.html
(57 words)
|
|
| |
| | HP Linpack on LeMieux |
| | Effect on the Linpack benchmark of using the ATLAS (Automatically Tuned Linear Algebra Software) library vs. HP's own CXML library | | | For reference, here are the relevant lines from the Linpack runs: | | | We build the HPL executable from source, using the configuration file |
|
http://www.psc.edu/~gomez/Benchmarking
(1511 words)
|
|
| |
| | [No title] |
| | Information on specific routines in LINPACK can be obtained through the DOCUM command, which is described in the Computer Center document Documentation for FORTRAN Library Subroutines. | | | A document giving detailed information on the package is available in the Computer Center's Supercomputer Support Office (contact Bob Goldstein, U09872, 996-6664). | | | The routines are automatically available with all FORTRAN catalogued procedures at UIC and with the FORTRAN execs on CMS. |
|
http://www.uic.edu/depts/adn/infwww/txt/v3724001.txt
(177 words)
|
|
| |
| | R: Singular Value Decomposition of a Matrix |
| | The SVD decomposition of the matrix as computed by LINPACK, | | | Unsuccessful results from the underlying LAPACK code will result in an error giving a positive error code: these can only be interpreted by detailed study of the FORTRAN code. | | | provides an interface to the LINPACK routine DSVDC, purely for backwards compatibility. |
|
http://rweb.stat.umn.edu/R/library/base/html/svd.html
(321 words)
|
|
| |
| | [No title] |
| | Handling of lsode dependencies: Cpp-style preprocessing at compile time is used to switch between single precision and double precision versions of the linpack routines (and r1mach and d1mach) upon which lsode depends. | | | A library lsode_linpack is provided which contains only the linpack routines upon which lsode depends (both single and double precision versions). | | | The user can use this library, if a complete linpack is not locally available. |
|
http://w3.pppl.gov/ntcc/LSODE/README
(889 words)
|
|
| |
| | [No title] |
| | ******** Installing the linpack library for use with InterCall ******** Get a copy of linpack.tar.Z, and copy it to your unix machine. | | | To use these libraries from within Mathematica you will need the InterCall package. | | | You will also need the library archive files. |
|
http://library.wolfram.com/infocenter/MathSource/1998/README.txt
(154 words)
|
|
| |
| | LINPACK/BLAS |
| | MGGHAT uses a few routines from the LINPACK and BLAS packages. | | | If you follow the email instructions, you will receive two return mailings, one for the LINPACK request and one for the BLAS request. | | | Each of these should be saved to a file, for example |
|
http://math.nist.gov/reports/mgghat/userguide/node8.html
(222 words)
|
|
| |
| | HPC - Compaq Extended Math Library: LAPACK |
| | LAPACK extends the functionality of LINPACK and EISPACK by including equilibration, iterative refinement, error bounds, and driver routines for linear systems, routines for computing and re-ordering the Schur factorization, and condition estimation routines for eigenvalue problems. | | | LAPACK improves on the accuracy of the standard algorithms in EISPACK by including high accuracy algorithms for finding singular values and eigenvalues of bidiagonal and tridiagonal matrices respectively that arise in SVD and symmetric eigenvalue problems. | | | This utility is designed to provide assistance in converting programs that currently call LINPACK or EISPACK routines, to call LAPACK routines instead. |
|
http://www.hp.com/techservers/software/lapack.html
(579 words)
|
|
| |
| | Sun Performance Library Reference: 2 - LINPACK Subroutines |
| | Sun Performance Library contains double complex (COMPLEX*16) although double complex is not a standard FORTRAN 77 data type. | | | Also, this version of Sun Performance Library contains a native C/C++ interface to LINPACK. | | | Sun Performance Library Reference: 2 - LINPACK Subroutines |
|
http://www.math.ias.edu/mcomputer/SUNWspro/html_docs/perflib/perflib_ref/chapter2.doc4.html
(85 words)
|
|
| |
| | Optimizing Java Linpack |
| | I took the original Java Linpack benchmark, by Jack Dongarra and Reed Wade, and applied some of the optimizations from my Java Optimization page: | | | Consider this a salutory reminder of the dangers of optimization! | | | Used temporary scalars to hold frequently-used elements of 1D arrays (common subexpression elimination). |
|
http://www.cs.cmu.edu/~jch/java/linpack.html
(196 words)
|
|
| |
| | DoE, IBM Supercomputer Shatters LINPACK Test |
| | Teraflops, or one trillion floating points per second, are the key metrics when determining the processing speed of computing systems. | | | The U.S. Department of Energy (DoE) Thursday said that a BlueGene/L supercomputer built by IBM (Quote, Chart) for nuclear arms research runs at a record 70.72 teraflops, making it the fastest computer on the LINPACK benchmark test. | | | Jack Dongarra, LINPACK test creator and co-author of the well-regarded Top500 report of the world's most powerful computing systems, confirmed the record in an e-mail to internetnews.com. |
|
http://www.internetnews.com/bus-news/article.php/3431451
(774 words)
|
|
| |
| | LINPACK Performance on a Geographically Distributed Linux Cluster |
| | In this paper, our work of improving LINPACK performance is reported, and the impact of math kernel, LINPACK problem size and network tuning is analyzed based on the performance model of LINPACK. | | | LINPACK Performance on a Geographically Distributed Linux Cluster | | | It achieved 1.169 tera-flops running the LINPACK benchmark. |
|
http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/ipdps/2004/2132/15/2132toc.xml&DOI=10.1109/IPDPS.2004.1303301
(183 words)
|
|
| |
| | ExtremeTech: The Portable Linpack Benchmark |
| | Because its computational code mimics that of the Linux/Unix Linpack benchmark and because it's been programmed to run on distributed-memory systems, HPL is considered a portable version of the Linpack bench. | | | HPL is a set of linear-algebra routines written in double-precision arithmetic for distributed-computing systems. |
|
http://www.findarticles.com/p/articles/mi_zdext/is_200105/ai_ziff1476
(133 words)
|
|
| |
| | Blas_f77 |
| | This method calculates the Euclidean norm of the vector stored in dx[ ] with storage increment incx. | | | For example, you will see for (i = 1; i | | | This class was translated by a statistician from FORTRAN versions of the LINPACK blas. |
|
http://www1.fpl.fs.fed.us/linear_algebra/Blas_f77.html
(2300 words)
|
|
| |
| | Running Linpack |
| | Are there any other linpack benchmark > implementations? | | | On Thu, 28 Jun 2001, Ferdinand Mahr wrote: > Has anyone experience with the High Performance Linpack benchmark from > netlib.org? | | | Is there a script that analyzes the > output of the program? |
|
http://www.scyld.com/pipermail/beowulf/2001-June/004144.html
(278 words)
|
|
| |
| | LINPACK - Computing Reference - eLook.org |
| | The kernel benchmark developed from the "LINPACK" package of linear algebra routines. | | | It was written by Jack Dongarra in Fortran and is commonly used in that language but there is also a C version. |
|
http://www.elook.org/computing/linpack.htm
(49 words)
|
|
| |
| | Jack Dongarra : Papers |
| | The LINPACK Benchmark: Past, Present, and Future, J. Dongarra, P. Luszczek, and A. Petitet, Concurrency and Computation: Practice and Experience 15(9):803—820, August 2003, ISSN 1532-0634. | | | Performance of Various Computers Using Standard Linear Equations Software, (Linpack Benchmark Report), Jack J. Dongarra, University of Tennessee Computer Science Technical Report, CS-89-85, 2005. | | | The LINPACK Benchmark: Past, Present, and Future,Jack Dongarra, Piotr Luszczek, and Antoine Petitet. |
|
http://www.netlib.org/utk/people/JackDongarra/papers.htm
(11190 words)
|
|
| |
| | LINPACK |
| | LINPACK uses column-oriented algorithms to increase efficiency by preserving locality of reference. | | | LINPACK was designed for supercomputers in use in the 1970s and early 1980s. | | | LINPACK is a collection of Fortran subroutines that analyze and solve linear equations and linear least-squares problems. |
|
http://www.netlib.org/linpack
(229 words)
|
|
| |
| | LINPACK_BENCH - The LINPACK Benchmark |
| | LINPACK_BENCH is the LINPACK Benchmark, a test problem used to rate the performance of a computer. | | | SGESL solves a real general linear system A * X = B. returns a uniformly distributed random number between 0 and 1. | | | The test problem requires the user to set up a random dense matrix A, and a right hand side vector B which is the product of A and a vector of all 1's. |
|
http://orion.math.iastate.edu/burkardt/f_src/linpack_bench/linpack_bench.html
(144 words)
|
|
| |
| | Hardware Analysis - Pentium 4 Scaling with DDR Memory - Results - Linpack & Cachemem |
| | Linpack measures simple arithmetic performance using data sets varying from 1 byte to over 512 kilobytes, in this case. | | | Both can be used to graphically illustrate our earlier explanation of scaling, and reliance on the memory bus. | | | As such, they often do not relate directly to practical performance, however from a theoretical standpoint, they're quite excellent. |
|
http://www.hardwareanalysis.com/content/article/1475.5
(464 words)
|
|
| |
| | LINPACK - OneLook Dictionary Search |
| | LINPACK : Free On-line Dictionary of Computing [home, info] | | | Tip: Click on the first link on a line below to go directly to a page where "LINPACK" is defined. | | | We found 3 dictionaries with English definitions that include the word LINPACK: |
|
http://www.onelook.com/cgi-bin/cgiwrap/bware/dofind.cgi?word=LINPACK
(77 words)
|
|
|
