JAVA EXAMPLE PROGRAMS

JAVA EXAMPLE PROGRAMS

Checkout for Promo Codes

Java Thread Yield Examples

  • When a thread executes a thread yield, the executing thread is suspended and the CPU is given to some other runnable thread. This thread will wait until the CPU becomes available again.
  • Technically, in process scheduler's terminology, the executing thread is put back into the ready queue of the processor and waits for its next turn.

Thread Yield Sample Code

Code:
package com.myjava.threads;

import java.util.ArrayList;
import java.util.List;

public class MyThreadYield {
    public static void main(String a[]){
        List<ExmpThread> list = new ArrayList<ExmpThread>();
        for(int i=0;i<3;i++){
            ExmpThread et = new ExmpThread(i+5);
            list.add(et);
            et.start();
        }
        for(ExmpThread et:list){
            try {
                et.join();
            } catch (InterruptedException ex) { }
        }
    }
}

class ExmpThread extends Thread{
    
    private int stopCount;
    public ExmpThread(int count){
        this.stopCount = count;
    }
    public void run(){
        for(int i=0;i<50;i++){
            if(i%stopCount == 0){
                System.out.println("Stoping thread: "+getName());
                yield();
            }
        }
    }
}

Example Output

Stoping thread: Thread-0
Stoping thread: Thread-1
Stoping thread: Thread-3
Stoping thread: Thread-1
Stoping thread: Thread-3
Stoping thread: Thread-1
Stoping thread: Thread-3
Stoping thread: Thread-1
Stoping thread: Thread-3
Stoping thread: Thread-1
Stoping thread: Thread-2
Stoping thread: Thread-2
Stoping thread: Thread-0
Stoping thread: Thread-2
Stoping thread: Thread-0
Stoping thread: Thread-2
Stoping thread: Thread-0
Stoping thread: Thread-2
Stoping thread: Thread-0

Other Thread Examples

Knowledge Centre
When to use LinkedList or ArrayList?
Accessing elements are faster with ArrayList, because it is index based. But accessing is difficult with LinkedList. It is slow access. This is to access any element, you need to navigate through the elements one by one. But insertion and deletion is much faster with LinkedList, because if you know the node, just change the pointers before or after nodes. Insertion and deletion is slow with ArrayList, this is because, during these operations ArrayList need to adjust the indexes according to deletion or insetion if you are performing on middle indexes. Means, an ArrayList having 10 elements, if you are inserting at index 5, then you need to shift the indexes above 5 to one more.
Famous Quotations
If you don’t make mistakes, you’re not working on hard enough problems. And that’s a big mistake.
-- Frank Wilczek

About Author

I'm Nataraja Gootooru, programmer by profession and passionate about technologies. All examples given here are as simple as possible to help beginners. The source code is compiled and tested in my dev environment.

If you come across any mistakes or bugs, please email me to [email protected].

Most Visited Pages

Other Interesting Sites

Reference: Java™ Platform Standard Ed. 7 - API Specification | Java™ Platform Standard Ed. 8 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2020 by Nataraja Gootooru. All Rights Reserved.