From ...
From: Erik Naggum <erik@naggum.no>
Subject: Re: Heap- vs. stack-based fn call frames, was: how to validate input?
Date: 2000/04/26
Message-ID: <3165723214520205@naggum.no>#1/1
X-Deja-AN: 615812917
References: <87wvlv75lf.fsf@inka.de> <3165639388940721@naggum.no> <uya62jnx8.fsf@alum.mit.edu> <3165662049043666@naggum.no> <3905c241$0$226@nntp1.ba.best.com>
mail-copies-to: never
Content-Type: text/plain; charset=us-ascii
X-Complaints-To: newsmaster@eunet.no
X-Trace: oslo-nntp.eunet.no 956735801 29310 195.0.192.66 (26 Apr 2000 07:56:41 GMT)
Organization: Naggum Software; vox: +47 8800 8879; fax: +47 8800 8601; http://www.naggum.no
User-Agent: Gnus/5.0803 (Gnus v5.8.3) Emacs/20.5
Mime-Version: 1.0
NNTP-Posting-Date: 26 Apr 2000 07:56:41 GMT
Newsgroups: comp.lang.lisp

* chucko@best.com (Chuck Fry)
| As a one-time student of computer architecture, this begs the question:
| What choices could the CPU designer make to lessen the expense of
| heap-based call frames?

  predictive cache line acquisition in the heap allocation direction.
  the stack is fast because it's nearly always in the fastest cache.
  if it weren't, it would be disastrously slow on modern hardware.

#:Erik