Path: utzoo!yunexus!geac!john
From: john@geac.UUCP (John Henshaw)
Newsgroups: comp.arch
Subject: Code size vs. Data size (was 16 & 32 bit vs 32 bit only...)
Message-ID: <2377@geac.UUCP>
Date: 3 Mar 88 14:37:35 GMT
Article-I.D.: geac.2377
Posted: Thu Mar  3 09:37:35 1988
References: <9651@steinmetz.steinmetz.UUCP> <9678@steinmetz.steinmetz.UUCP> <2574@im4u.UUCP> <2116@saturn.ucsc.edu> <449@imagine.PAWL.RPI.EDU> <7520@apple.Apple.Com>
Reply-To: john@geac.UUCP (John Henshaw)
Organization: The little blue rock next to that twinkly star.
Lines: 22

In article <7520@apple.Apple.Com> bcase@apple.UUCP (Brian Case) writes:

>One thing is for sure though, code size is almost always much less important
>that data size.


I find this statement interesting.

The both code and data require memory accesses so that we can perform
useful work. It seems to me that we do many more accesses to fetch
instructions than we do to fetch data. This is of course, offset by the
fact that the code is held in very fast cache memory (if we do things
right :-)).

I would appreciate it if Brian, (or anyone else of course) would care
to expand on the above.

-john-
-- 
John Henshaw,			(mnetor, yunexus, utgpu !geac!john)
Geac Computers Ltd.		If we don't pay for education now, are we
Markham, Ontario, Canada, eh?	going to be able to pay for ignorance later?