Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!seismo!sundc!pitstop!sun!decwrl!labrea!jade!eris!mwm
From: mwm@eris.BERKELEY.EDU (Mike (My watch has windows) Meyer)
Newsgroups: comp.arch
Subject: Re: register windows Really Stack machines/stack-caches
Message-ID: <5761@jade.BERKELEY.EDU>
Date: Tue, 3-Nov-87 19:51:18 EST
Article-I.D.: jade.5761
Posted: Tue Nov  3 19:51:18 1987
Date-Received: Sat, 7-Nov-87 08:25:51 EST
References: <543@astroatc.UUCP>
Sender: usenet@jade.BERKELEY.EDU
Reply-To: mwm@eris.BERKELEY.EDU (Mike (My watch has windows) Meyer)
Organization: Missionaria Phonibalonica
Lines: 22

In article <543@astroatc.UUCP> johnw@astroatc.UUCP (John F. Wardale) writes:
<There has been discussion about using a stack, a stack
<architecture (I assume) and a stack-cache to get many of the gains
<of register windows cheaply.
<
<Unless I'm totally missing the boat, this requires using a stack

Sorry, but the boat left without you :-).

The idea behind caching the top of the stack is from the observation
that programs written in HLLs tend to have lots of accesses to the
last stack frame, and a small number to global variables.

So you cache the top N K of the stack, and then demonstrate that the
customers application always uses less than that much stack :-).

	<mike
--
[Our regularly scheduled .signature preempted.]		Mike Meyer
The Amiga 1000: Let's build _the_ hackers machine.	mwm@berkeley.edu
The Amiga 500: Let's build one as cheaply as possible!	ucbvax!mwm
The Amiga 2000: Let's build one inside an IBM PC!	mwm@ucbjade.BITNET