Related articles |
---|
Stack based machines thand@pmail.net (Linus Thand) (2000-03-23) |
Re: Stack based machines plakal@cs.wisc.edu (2000-03-23) |
Re: Stack based machines dvdeug@x8b4e53cd.dhcp.okstate.edu (2000-03-25) |
Re: Stack based machines pieter@cs.kun.nl (Pieter Koopman) (2000-03-25) |
Re: Stack based machines galexand@sietch.bloomington.in.us (2000-03-25) |
Re: Stack based machines bonzini@my-deja.com (2000-03-25) |
Re: Stack based machines gneuner@dyn.com (2000-03-25) |
Re: Stack based machines dxj@mnsinc.com (Deepak Janardhanan) (2000-03-25) |
[4 later articles] |
From: | plakal@cs.wisc.edu |
Newsgroups: | comp.compilers,comp.arch |
Date: | 23 Mar 2000 23:45:32 -0500 |
Organization: | University of WI, Madison -- Computer Sciences Dept. |
References: | 00-03-101 |
Keywords: | architecture |
Linus Thand <thand@pmail.net> wrote:
> What is happening in the world of stack-based machines?
> Are there any active groups working on processors or
> compilers (I'm especially interested in functional languages).
>
> [Other than forth, not much I'm aware of. Registers give an architecture
> a big performance boost, and it's hard to fake that by caching to top of
> the stack. -John]
Well, there's the whole Java thing and Sun making
those processor cores: {micro,pico,ultra}Java which
I believe are all stack machines. I do remember
reading a design document from Sun a long time back
which described mapping the top elements of the stack
to registers in at least one of these processors.
Manoj
[There have been lots of stack architectures that kept the top of the
stack in registers, but it's my impression that performance is worse
than real registers. Registers hold common subexpression values and
hot loop variables as well as expression temporaries, and stack
caching doesn't easily get either of those. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.