Article View: net.arch
Article #2436CRAY Question
From: Ehud Reiter
Date: Wed, 30 Apr 1986 13:38
Date: Wed, 30 Apr 1986 13:38
11 lines
1000 bytes
1000 bytes
In one of Jack Dongarra's articles on LINPACK performance (Computer Archicture News, vol 11, no 5 (Dec 83)), he says that a CRAY 1-M executes the benchmark faster than a CRAY 1-S because the 1-M has slower memory. I fail to see how it is even theoretically possible for slower memory to mean higher performance, and would appreciate someone who knows about CRAY's explaining this to me (Dongarra talks about a "missed chain-slot"). Thanks. Ehud Reiter harvard!reiter.UUCP reiter@harvard.ARPA
Technical Details
Message-ID:
<905@harvard.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!linus!philabs!cmcl2!harvard!reiterShow Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: arc1-ca.pugleaf.net!utzoo!linus!philabs!cmcl2!harvard!reiter From: reiter@harvard.UUCP (Ehud Reiter) Newsgroups: net.arch Subject: CRAY Question Message-ID: <905@harvard.UUCP> Date: Wed, 30-Apr-86 09:38:23 EDT Article-I.D.: harvard.905 Posted: Wed Apr 30 09:38:23 1986 Date-Received: Sat, 3-May-86 01:34:24 EDT Reply-To: reiter@harvard.UUCP (Ehud Reiter) Distribution: net Organization: Aiken Comp Lab, Harvard Lines: 11