JVM's scheduling policy

Question

Greetings,
I would like to know what is the JVM's scheduling policy? what does it aims for (i.e., low waiting time, low response time, low turnaround time)?
If any of you have an idea, please share it with me...
Kind regards and thanks in advanced,
Ohad Raz

Answer 1

After investigating this a little more I found this
article
http://java.sun.com/docs/books/tutorial/essential/thre
ds/priority.html
Some points from the article
The Java runtime supports a very simple, deterministic
scheduling algorithm known as fixed priority
scheduling.
Scheduling of the CPU is fully preemptive. If a thread
with a higher priority than the currently executing
thread needs to execute, the higher priority thread is
immediately scheduled.
The Java runtime will not preempt the currently
running thread for another thread of the same
priority. In other words, the Java runtime does not
time-slice. However, the system implementation of
threads underlying the Java Thread class may support
time-slicing. Do not write code that relies on
time-slicing.
When all the runnable threads in the system have the
same priority, the scheduler chooses the next thread
to run in a simple, non-preemptive, round-robin
scheduling order
So it seems as though there is scheduling done in the
JVM but it the OS is also involved, which is shown
with the time slicing.Well, Sethaw, I think your answer might be sufficient for me.
I understand that the JVM implements the fixed priority scheduling, which aims at minimum turnaround time, under the limitation of priority.
Thanks!