what instruction set did you code it for?Originally Posted by brentpresley
what instruction set did you code it for?Originally Posted by brentpresley
Fast computers breed slow, lazy programmers
The price of reliability is the pursuit of the utmost simplicity. It is a price which the very rich find most hard to pay.
http://www.lighterra.com/papers/modernmicroprocessors/
Modern Ram, makes an old overclocker miss BH-5 and the fun it was
Then you could have step the compiler to optimize it for SSE without much recodingOriginally Posted by brentpresley
![]()
Fast computers breed slow, lazy programmers
The price of reliability is the pursuit of the utmost simplicity. It is a price which the very rich find most hard to pay.
http://www.lighterra.com/papers/modernmicroprocessors/
Modern Ram, makes an old overclocker miss BH-5 and the fun it was
If you went to the trouble to optimize the performance of this math intensive app, it seems counterproductive to ignore the huge benefits from SSE/SSE2 that the compiler can give almost for free.
Presumably it was only a few inner loops that really needed turboing, and a runtime selection of different code paths wouldn't make much of a dent in the 650KB. Not as if it would require significant Q/A either.
Such is the PHB.![]()
Heckuva project to cut your teeth on. I can understand how real-world requirements would affect your choices, but if this was all in C then I don't see the boss's reluctance to compile with various optimization flags.
And really, why wasn't it written in FORTRAN?![]()
Bookmarks