Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!)

From	"Rod Pemberton" <do_not_have@notemailnotq.cpm>
Newsgroups	comp.lang.forth
Subject	Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!)
Date	2013-04-08 23:52 -0400
Organization	Aioe.org NNTP Server
Message-ID	<kk034g$fdi$1@speranza.aioe.org> (permalink)
References	<b70a9248-3dd3-4f6a-ac04-52300b7a7ac0@googlegroups.com> <920a596a-9d56-43cc-ac6d-6f1758058710@googlegroups.com> <98eb98de-b24c-47bd-9480-37f6bde941d8@googlegroups.com> <kjn8dn$bl6$1@dont-email.me> <0acb2a77-7021-4862-b299-bb935bd35b29@googlegroups.com>

Show all headers | View raw

"AKE" <assadebrahim2000@gmail.com> wrote in message
news:0acb2a77-7021-4862-b299-bb935bd35b29@googlegroups.com...

> I'm aware of [Rick's] separate thread (MISC - Stack Based vs.
> Register Based), and apart from some of the 'noise' around CISC
> that got injected, it's an interesting investigation, and a
> discusion which I've been following closely.  So do continue,
> and keep us apprised on what you find.

The discussion of CISC is not 'noise'.  Understanding RISC and
CISC is central to Rick understanding code density.  He seems to
be completely unfamiliar with CISC and RISC concepts.  In
response, numerous other people - while discussing CISC and CISC
like platforms - have provided specific details regarding the
implementation of instruction sets and their encodings for various
platforms.  Some of those details are not widely known and could
be helpful to Rick or inspire him.


Rod Pemberton

Back to comp.lang.forth | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) rickman <gnuarm@gmail.com> - 2013-04-05 15:27 -0400
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-04-05 15:02 -0700
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-04-08 23:52 -0400
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Elizabeth D. Rather" <erather@forth.com> - 2013-04-05 13:22 -1000
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Elizabeth D. Rather" <erather@forth.com> - 2013-04-06 12:34 -1000
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-04-07 02:39 -0700
        Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Elizabeth D. Rather" <erather@forth.com> - 2013-04-07 09:11 -1000
        Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-04-08 23:48 -0400
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-04-08 23:51 -0400

csiph-web