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:48 -0400
Organization	Aioe.org NNTP Server
Message-ID	<kk02u4$f1i$1@speranza.aioe.org> (permalink)
References	(2 earlier) <98eb98de-b24c-47bd-9480-37f6bde941d8@googlegroups.com> <kjn8dn$bl6$1@dont-email.me> <p6udnXMLoZ8mwcLMnZ2dnUVZ_rOdnZ2d@supernews.com> <99WdnZyat6llP_3MnZ2dnUVZ_o6dnZ2d@supernews.com> <3afa40d0-a6cd-4ec0-88ae-2e2e3cd3c166@googlegroups.com>

Show all headers | View raw

"AKE" <assadebrahim2000@gmail.com> wrote in message
news:3afa40d0-a6cd-4ec0-88ae-2e2e3cd3c166@googlegroups.com...

> [I] [c]an't imagine the need for radiation hardened chips
> suddenly disappeared?

No.  It seems to me that those who need radiation hardened chips,
just needed more powerful processors.  E.g., one example:
http://www.theregister.co.uk/2008/07/11/stealth_bomber_upgrades/


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