|
Quick Lists
|
|
Bug ID:
|
6340864
|
|
Votes
|
8
|
|
Synopsis
|
Implement vectorization optimizations in hotspot-server
|
|
Category
|
hotspot:compiler2
|
|
Reported Against
|
|
|
Release Fixed
|
|
|
State
|
3-Accepted,
request for enhancement
|
|
Priority:
|
4-Low
|
|
Related Bugs
|
6559557
|
|
Submit Date
|
24-OCT-2005
|
|
Description
|
A DESCRIPTION OF THE REQUEST :
Almost all C-compilers available are able to vectorize code, so that simple code in loops for example can be processed in parallel by using the SIMD registers of modern CPUs like SSE1/2 or AltiVec.
Hotspot-server still uses SSE only for batch-procession of fpu-operations and it would be great if hotspot would be also able to optimize this caseses since it sometimes can even double performance.
JUSTIFICATION :
to archive higher performance on algorythmic code.
EXPECTED VERSUS ACTUAL BEHAVIOR :
EXPECTED -
code like this should be vectorized:
int x;
int[] a = new int[10000];
for(int i=0; i < a.length; i++)
{
x += a[i];
}
ACTUAL -
the generated code does not make any use of SIMD commands
CUSTOMER SUBMITTED WORKAROUND :
Write C libraries which handle all the complex stuff and write java-code just for the stuff arround itl
Posted Date : 2005-10-24 17:20:02.0
|
|
Work Around
|
N/A
|
|
Evaluation
|
N/A
|
|
Comments
|
Submitted On 25-OCT-2005
This is critical for demanding applications like 3d or other complex games.
PLEASE NOTE: JDK6 is formerly known as Project Mustang
|
|
|
 |