Re: Optimizing stack access for a stack based VM

Tony Finch <dot@dotat.at>
16 Sep 2007 21:09:50 +0100 (BST)

          From comp.compilers
Related articles
[4 earlier articles]
Re: Optimizing stack access for a stack based VM DrDiettrich1@aol.com (Hans-Peter Diettrich) (2007-09-13)
Re: Optimizing stack access for a stack based VM DrDiettrich1@aol.com (Hans-Peter Diettrich) (2007-09-13)
Re: Optimizing stack access for a stack based VM jvorbrueggen@not-mediasec.de (=?ISO-8859-1?Q?Jan_Vorbr=FCggen?=) (2007-09-14)
Re: Optimizing stack access for a stack based VM blog@rivadpm.com (Alex McDonald) (2007-09-14)
Re: Optimizing stack access for a stack based VM kenney@cix.compulink.co.uk (2007-09-14)
Re: Optimizing stack access for a stack based VM jeffrey.kenton@comcast.net (Jeff Kenton) (2007-09-16)
Re: Optimizing stack access for a stack based VM dot@dotat.at (Tony Finch) (2007-09-16)
Re: Optimizing stack access for a stack based VM anton@mips.complang.tuwien.ac.at (2007-10-01)
| List of all articles for this month |
From: Tony Finch <dot@dotat.at>
Newsgroups: comp.compilers
Date: 16 Sep 2007 21:09:50 +0100 (BST)
Organization: dotat labs
References: 07-09-030 07-09-038 07-09-051
Keywords: architecture
Posted-Date: 16 Sep 2007 19:29:15 EDT

Jan Vorbruggen <jvorbrueggen@not-mediasec.de> wrote:
>> Did you have a look at the i80x87 FPU instruction set? Or at the Java
>> VM, or at FORTH?
>
>In my biased opinion, the prototypical non-ancient stack-based ISA is
>that of the transputer.


The transputer is unusual in that its stack has only three entries. It
was designed to be enough to compile a typical high-level language
statement, but local variables live off the stack in the
workspace. This means the CPU has very little per-process state so
context switching can be very fast.


Tony.
--
f.a.n.finch <dot@dotat.at> http://dotat.at/

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.