Skip to main content

array bounds check performance?

2 replies [Last post]
thiloharich
Offline
Joined: 2006-12-21
Points: 0

Inspired by the links:
http://www.cs.umd.edu/~vibha/330/array-bounds.pdf
http://lingpipe-blog.com/2009/03/30/jdk-7-twice-as-fast-as-jdk-6-for-arr...
I downloaded the latest version jdk-7-ea-bin-b53-windows-i586-02_apr_2009
I did not see any performance improvements on the array bounds check relative to jdk 1.6.07
My mail loop is something like this

int xIndex, int factor, byte factorLength, int length

while (xIndex < length)
{
qLength [xIndex] -= factorLength;
xIndex += factor;
}

length is 400000. factor multiplied with a small constant is length.

Reply viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.
thiloharich
Offline
Joined: 2006-12-21
Points: 0

Now I read all the comments of the blog. The improvements of the array bounds check aber not included in the trunk version.

thiloharich
Offline
Joined: 2006-12-21
Points: 0

java version "1.7.0-ea"
Java(TM) SE Runtime Environment (build 1.7.0-ea-b53)
Java HotSpot(TM) Client VM (build 15.0-b04, mixed mode, sharing)

32 bit