Re: Optimizing basic operations

new topic     » goto parent     » topic index » view thread      » older message » newer message
James_at_Euphoria said...

Thanks for such a quick response. I will continue with some testing to compare results. The motivation behind this question is that certain routines involving mathematical functions (factorials, for example) can involve billions or trillions of comparisons as they create a geometric explosion of possibilities. If I use heuristics, IE, trimming the search space / search tree, the probability is that I will find local but not global minimums or maximums. Perhaps after I improve the feature extraction process, assuming that this is possible, the geometric explosion will be smaller (but still very large). In the meantime, every microsecond would help. Again, thanks. P.S. This problem involves pattern recognition.

One of the cool things about Euphoria is that if you have a list of values on which to perform a single operation, then you can do so in a single statement, and it generally works faster than in other languages. It's not always possible, however; I've found that when trying to translate benchmark tests from other languages to Euphoria, you can't always rely on that feature, but it's still there.

Hopefully at some point we will even be able to leverage some processors' SIMD instruction sets in order to make this even more efficient, while at the same time retaining Euphoria's type-neutral character.

As for stuff outside of basic computer math, that's a bit out of my element so my advice is really limited to that.

new topic     » goto parent     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu