java-threads

I am trying to do it using two threads like below. Can someone point the obvious mistake I am doing here? public class OddEven { public static boolean available = false; public static Queue<Integer> queue = new LinkedList<Integer>(); static Thread threadEven = new Thread() { @Override public void run() { printEven(); } public synchronized void printEven() { while (!available) { try { wait(); Thread.sleep(2000); } catch (InterruptedException e) { } } System.out.println(queue.remove()); available = false; notifyAll(); } }; static Thread threadOdd = new Thread() { @Override public void run() {

If I understand correctly the stack is for local primities and references to the objects in the heap. So what happens if you have more than one threads? Do they share the same stack space at the same time (but different areas) or does the JRE switch contexts and load-deload the stack content when switching between threads? Or does the JRE allocate separate stacks for each threads? Or does the JRE allocate separate stacks for each threads? Conceptually yes. (See this JVM spec link , for example.) How the spec's conceptualization gets implemented in a particular JVM is ... implementation

Parallel programming was possible in Java only from Java 7 with the advent of Join/Fork framework . Let's say in Java, using ExecutorService I create a thread pool of say 4 threads and submit to it say 10 tasks which means 4 threads will start executing the 4 tasks and other 6 tasks will be picked up by threads as and when any thread finishes its task. Let's assume I have a quad processor having 4 cores, I know a thread can be run on a single core(not taking hyper-threading concept here) so will all my 4 threads work in parallel, 1 thread running on 1 core? Isn't it a parallel programming?

I am just learning Threads in Java and I want to sort a list of words alphabetical. My program read the words of a txt-file and put them in a String-array. The user can choose how many threads they want to use themselves. I want to split the array in even (as possible) chunks that the threads can sort by themselves. So to my question: How can I split the array.length as even as possible across the threads? My mind is blanking and I can't think of a smart way to do this. e.g: If I have a array.length of 22 and 4 threads, how can give the threads in this case; 6, 6, 5 and 5 sized pieces of the

While learning Java 9 I came across a new method of Thread class, called onSpinWait​ . According to javadocs, this method is used for this: Indicates that the caller is momentarily unable to progress, until the occurrence of one or more actions on the part of other activities. Can someone help me understand this method giving a real-life example? It's the same (and probably compiles to) as the x86 opcode PAUSE and equivalent the Win32 macro YieldProcessor , GCC's __mm_pause() and the C# method Thread.SpinWait It's a very weakened form of yielding: it tells your CPU that you are in a loop that