Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Efficient Evaluation of Image Expressions hermann.rodrigues@gmail.com (Hermann) (2007-07-18) |
| Re: Efficient Evaluation of Image Expressions torbenm@app-2.diku.dk (2007-07-19) |
| Re: Efficient Evaluation of Image Expressions tmk@netvision.net.il (Michael Tiomkin) (2007-07-19) |
| Re: Efficient Evaluation of Image Expressions Ibeam2000@gmail.com (Nick) (2007-07-22) |
| Re: Efficient Evaluation of Image Expressions hermann.rodrigues@gmail.com (Hermann) (2007-07-23) |
| Re: Efficient Evaluation of Image Expressions Ibeam2000@gmail.com (Nick) (2007-07-30) |
| Re: Efficient Evaluation of Image Expressions Ibeam2000@gmail.com (Nick) (2007-08-01) |
| From: | Nick <Ibeam2000@gmail.com> |
| Newsgroups: | comp.compilers |
| Date: | Wed, 01 Aug 2007 06:42:22 -0000 |
| Organization: | Compilers Central |
| References: | 07-07-06607-07-112 |
| Keywords: | optimize |
| Posted-Date: | 01 Aug 2007 13:16:42 EDT |
PS:
I ran your example on my computer (AMD XP-3200+, 512mb) with my array
language and find that to execute your expression for eight arrays (i1
through i8) array with 1 million elements takes about 400 ms. This
used double floats, so single floats should run correspondingly
faster, at least from moving half of the memory around.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.