Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!rutgers!uwm.edu!wuarchive!udel!nigel.ee.udel.edu!mccalpin From: mccalpin@perelandra.cms.udel.edu (John D. McCalpin) Newsgroups: comp.benchmarks Subject: Re: LLNL Loops Message-ID: Date: 29 Nov 90 13:39:04 GMT References: <7628@eos.arc.nasa.gov> Sender: usenet@ee.udel.edu Organization: College of Marine Studies, U. Del. Lines: 22 Nntp-Posting-Host: perelandra.cms.udel.edu In-reply-to: eugene@eos.arc.nasa.gov's message of 29 Nov 90 01:11:56 GMT >>>>> On 29 Nov 90 01:11:56 GMT, eugene@eos.arc.nasa.gov (Eugene Miya) said: Eugene> [....] Frank's latest copy of the Livermore Eugene> Loops, aka the MFLOPS program, the Livermore Fortran Kernels Eugene> (LFK), etc. Eugene> I personally like Frank's Loops alot, even if they do not run Eugene> very long on a Cray. They have their problems, but the source Eugene> is well thought out. Unfortunately, they run *too* well on cached machines. Even the longest loops are mostly cacheable on my RS/6000-320, and *none* of my applications are that small. I posted the full results to comp.unix.aix a few weeks ago (before we got comp.benchmarks turned on here), and the top quartile was running at speeds of 15-22 MFLOPS, which is not characteristic of larger jobs on the same hardware (by a factor of about 3). -- John D. McCalpin mccalpin@perelandra.cms.udel.edu Assistant Professor mccalpin@brahms.udel.edu College of Marine Studies, U. Del. J.MCCALPIN/OMNET Brought to you by Super Global Mega Corp .com