Java Bytecode Profiler
skumars at earthlink.net
Tue Nov 10 14:22:54 PST 1998
Archie Cobbs wrote:
> Senthil Kumar writes:
> > 3. upper bound to interpret it. This result is quite interesting
> In general, it's is provably impossible to determine a (non-infinite)
> upper bound on the running time of a method :-) Perhaps you mean
> lower bound?
Yes, of course.
That is why I said that the result was an approximation, or rather,
it is probably true for about 90 % of the cases.
Also, it really is the upper bound.
This is good enough to make a first guess at the time it
will take to interpret some method.
More information about the kaffe