Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!lll-crg!caip!clyde!burl!ulysses!mhuxr!mhuxt!houxm!hjuxa!petsd!peora!joel
From: joel@peora.UUCP (Joel Upchurch)
Newsgroups: net.arch
Subject: Re: VERY LARGE main memories
Message-ID: <2289@peora.UUCP>
Date: Fri, 29-Aug-86 17:30:31 EDT
Article-I.D.: peora.2289
Posted: Fri Aug 29 17:30:31 1986
Date-Received: Sat, 30-Aug-86 10:12:10 EDT
References: <1130@bu-cs.bu-cs.BU.EDU>
Organization: Concurrent Computer Corporation, Orlando, Fl
Lines: 13


	One thing that no one has mentioned so far  that you could do
	with very large memories is table lookups. Sure everyone knows
	that a table lookup is faster than than a calculated solution
	almost all the time, but how many people would it occur to to use
	it if the resulting table would be several hundred megabytes
	or even larger? It seems to me that this could be significant
	in some applications, like weather forcasting.
-- 
     Joel Upchurch @ CONCURRENT Computer Corporation (A Perkin-Elmer Company)
     Southern Development Center
     2486 Sand Lake Road/ Orlando, Florida 32809/ (305)850-1031
     {decvax!ucf-cs, ihnp4!pesnta, vax135!petsd, akgua!codas}!peora!joel