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

From	Bernd Paysan <bernd.paysan@gmx.de>
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-05 22:12 +0200
Organization	1&1 Internet AG
Message-ID	<kjnb87$jo8$1@online.de> (permalink)
References	(5 earlier) <b1ec4e9c-da7d-403d-b2f7-692e0d71efc1@googlegroups.com> <5148cdc6.512138193@news.demon.co.uk> <af2804a7-cbc0-4f39-b751-84da1b379026@googlegroups.com> <5149ff2c.590320497@news.demon.co.uk> <kjn7fb$agu$2@dont-email.me>

Show all headers | View raw

rickman wrote:
> I get tired of hearing the myth that FPGAs are not cheap.  You can get
> low end FPGAs under $3 with more than enough capacity to implement
> multiple processors.  At high volumes I am led to believe the cost can
> get under $1.

Altera still has this "Hardcopy" program, which is about the last logic gate 
array standing.  The hardcopy chips can be programmed with a single mask or 
so, because Altera converted all the setting bits into vias; and the result 
is that they had the cheapest gate array on the market (all other gate 
arrays require three masks), "cheap" as in "setup costs", the die area is 
bigger than other gate arrays; but then you have the embedded RAMs and 
multipliers, which - when used - gives you a much better density.

-- 
Bernd Paysan
"If you want it done right, you have to do it yourself"
http://bernd-paysan.de/

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 10:44 -0400
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-04-05 22:12 +0200
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-04-06 02:46 -0500
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-04-08 17:53 +0200

csiph-web