Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.forth > #21479

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

Newsgroups comp.lang.forth
Date 2013-04-07 02:39 -0700
References (1 earlier) <920a596a-9d56-43cc-ac6d-6f1758058710@googlegroups.com> <98eb98de-b24c-47bd-9480-37f6bde941d8@googlegroups.com> <kjn8dn$bl6$1@dont-email.me> <p6udnXMLoZ8mwcLMnZ2dnUVZ_rOdnZ2d@supernews.com> <99WdnZyat6llP_3MnZ2dnUVZ_o6dnZ2d@supernews.com>
Message-ID <3afa40d0-a6cd-4ec0-88ae-2e2e3cd3c166@googlegroups.com> (permalink)
Subject Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!)
From AKE <assadebrahim2000@gmail.com>

Show all headers | View raw


On Saturday, April 6, 2013 11:34:31 PM UTC+1, Elizabeth D. Rather wrote:
>
> On 4/5/13 1:22 PM, Elizabeth D. Rather wrote:
> 
> A summary of the instruction set is here:
> http://elcodis.com/parts/6049569/HS-RTX2010_p29.html
> 
> Enjoy!
>

Very nice -- thanks for that.  

Do you know why the RTX2010 stopped being manufactured?  

Stephen suggested some circumstance directly or indirectly connected to the Gulf wars?  

Was there a replacement?  Can't imagine the need for radiation hardened chips suddenly disappeared?

If implemented in an FPGA, one would presumably get all of the capabilities, though perhaps not the radiation hardening?

Back to comp.lang.forth | Previous | NextPrevious 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