Home | Contact Us | FAQ | Search & Site Map | Link to Us
Sign In | Join | Other 45 Sites in Network
HomeAnnouncementsWhite Papers
Discussion GroupsFirst AidDatabasesJavaBeansGUIJava 3DVirtual MachineCORBASecurityToolsGeneral
Java DirectoryOpen Source ProjectsSample Book ChaptersUser GroupsWeb Resources
Related Topics
Databases.NETMore Topics ...

Java Forum / General / June 2006

Tip: Looking for answers? Try searching our database.

Java Performence

Thread view: 
kris - 05 Jun 2006 13:20 GMT
Hi, I need the info of how to tune the performence based on data
structures used. Like Collections.

Thanks & Regards
Krishna Prasad.
teja - 05 Jun 2006 22:21 GMT
hi,
try
http://www.javaperformancetuning.com/

/tejas

> Hi, I need the info of how to tune the performence based on data
> structures used. Like Collections.
>
> Thanks & Regards
> Krishna Prasad.
Scott Ellsworth - 05 Jun 2006 22:31 GMT
> Hi, I need the info of how to tune the performence based on data
> structures used. Like Collections.

The very first step: measure.  Either acquire a profiler, or write in
some performance tests with System.getTimeMillis.  Look for hot spots,
high execution counts, and memory blowouts.

The second step: interpret.  Ask yourself whether the results you are
getting 'make sense'.  For example, if your app or your microbenchmark
takes a long time to query for a piece of data, ask whether it _should_
take a long time to query that data.  Is the data store keyed by some
key, and stored in a Map, or is it testing against a linked list with
.equals.

The third step: decide if you have a problem to fix.  For example, if
your test case is storing a hundred names, then searching for 'Herb
Philbrick' five times, you probably saw no problems, but if you are
searching for all names containing 'Bob or Robert' out of ten million,
then you just might.

The fourth step: decide the problem level.  If your problem is that
retrievals are slow, you would be better served using a database or a
map than trying to write a better sort-and-binary-search.

The fifth step: with a goal in mind, and a plan, recode.

The final step: measure again, and write down what you found.  You will
find that the notes are worth more than the numbers, as new VMs change.    
Jack Shirazi's "Java Performance Tuning" is a bit dated by now, but you
can run his tests on recent VMs and get results that are still
applicable.

Scott

Signature

Scott Ellsworth
scott@alodar.nospam.com
Java and database consulting for the life sciences

kris - 06 Jun 2006 06:24 GMT
Thanks Scott Ellsworth

Thanks & Regards
Krishna Prasad.VCVR.
Thomas Hawtin - 06 Jun 2006 11:38 GMT
> The very first step: measure.  Either acquire a profiler, or write in
> some performance tests with System.getTimeMillis.  Look for hot spots,
> high execution counts, and memory blowouts.

It's also worth doing back-of-an-envelope calculations. Say I have an
O(n^2) algorithm, are there realistic but not necessarily particularly
common situations when it's going to blow up? You need to know what to
measure.

Tom Hawtin
Signature

Unemployed English Java programmer
http://jroller.com/page/tackline/



Free Magazines

Get these publications absolutely FREE for up to 12 months. There are no hidden fees and no obligation. Simply choose a title, complete the application form and submit it. Read more ...

Oracle MagazineNetwork ComputingComputer WorldBio-IT WorldeWeekInformation WeekInfosecurity
 
Sign In
Join
My Latest Posts
My Monitored Threads
My Blog
My Photo Gallery
My Profile
My Homepage

Start New Thread
Enable EMail Alerts
Rate this Thread



©2008 Advenet LLC   Privacy Policy - Terms of Use
This website includes both content owned or controlled by Advenet as well as content owned or controlled by third parties.