× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



I was assuming dynamic calls in both cases (i.e. OPM dynamic and ILE dynamic).

Obviously a bound call will be faster. But as OPM doesn't have anything comparable to that, it's hard to make a comparison :)


On 3/18/2010 3:07 PM, Florin Todor - YYZ Concord wrote:
Probably it is a little too late and my brain doesn't work as it is
supposed to do anymore, but I don't understand! From the numbers Charles
posted doesn't result at all that "OPM is faster", on the contrary! For
example, over 5M iterations, Bound Procedures are six times faster (1s
vs. 6s), over 50M iterations is over 15 times faster (4s vs.
62s)....(???)

As an Amazon Associate we earn from qualifying purchases.

This thread ...

Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.