import java.util.Collections;
import java.util.Random;
import java.util.concurrent.Phaser;
import java.util.Collections;

public class OneDimAveragingPhaser {
    int n;
    double[] myVal;
    double[] myNew;

    OneDimAveragingPhaser(int n) {
        this.n = n;
        myVal = new double[n + 2];
        Random random = new Random(System.currentTimeMillis());
        for (int i = 1; i < n; ++i)
            myVal[i] = random.nextInt(300);
        myVal[0] = myVal[1] = 0;

        myNew = new double[n + 2];
    }

    public void runSequential(final int iterations) {
        long startTime = System.nanoTime();

        for (int i = 0; i < iterations; ++i) {
            for (int j = 1; j < n; ++j) {
                myNew[j] = (myVal[j - 1] + myVal[j + 1]) / 2.0;
            }
            myVal = myNew;
        }
        
        long timeInNanoSec = System.nanoTime() - startTime;
        printResults("runSequential", timeInNanoSec);
    }

    public void runForAllBarrier(final int iterations, final int tasks) {
        Phaser ph = new Phaser(0);
        ph.bulkRegister(tasks);

        Thread[] threads = new Thread[tasks];

        for (int ii = 0; ii < tasks; ++ii) {
            int i = ii;
            threads[ii] = new Thread(() -> {
                double[] myVal = this.myVal;
                double[] myNew = this.myNew;

                for (int iter = 0; iter < iterations; ++iter) {
                    // Identify leftmost boundary element for group
                    int left = i * (n / tasks) + 1;
                    
                    // Identify the rightmost boundary element for group
                    int right = (i + 1) * (n / tasks);

                    // Iterate through all the elements of the group
                    for (int j = left; j <= right; ++j)
                        myNew[j] = (myVal[j - 1] + myVal[j + 1]) / 2.0;

                    ph.arriveAndAwaitAdvance();  // barrier

                    myVal = myNew;
                }
            });
            
            threads[ii].start();
        }
    }

    // Split the Phaser into arrive and awaitAdvance stages.
    public void runForAllFuzzyBarrier(final int iterations, final int tasks) {
        Phaser ph = new Phaser(0);
        ph.bulkRegister(tasks);

        Thread[] threads = new Thread[tasks];

        for (int ii = 0; ii < tasks; ++ii) {
            int i = ii;
            threads[ii] = new Thread(() -> {
                double[] myVal = this.myVal;
                double[] myNew = this.myNew;

                for (int iter = 0; iter < iterations; ++iter) {
                    // Identify leftmost boundary element for group
                    int left = i * (n / tasks) + 1;
                    myNew[left] = (myVal[left - 1] + myVal[left + 1]) / 2.0;
                    
                    // Identify the rightmost boundary element for group
                    int right = (i + 1) * (n / tasks);
                    myNew[right] = (myVal[right - 1] + myVal[right + 1]) / 2.0;

                    // Now the phaser has finished the shared task, thus it can signal that it has arrived.
                    int currentPhase = ph.arrive();

                    // Now it can do some local task, this task doesn't depend on any other task.
                    for (int j = left + 1; j <= right - 1; ++j)
                        myNew[j] = (myVal[j - 1] + myVal[j + 1]) / 2.0;

                    ph.awaitAdvance(currentPhase);  // wait

                    myVal = myNew;
                }
            });
            
            threads[ii].start();
        }
    }

    public static void main(String[] args) {
        // clear the screen.
        System.out.print("\033[H\033[2J");
        System.out.flush();
        
        int tasks = 4;
        int n = 100000;
        int iterations = 10000;
        int rounds = 5;

        System.out.println("Configuration : ");
        System.out.println("  # of tasks for parallel run: " + tasks);
        System.out.println("  Array size n: " + n);
        System.out.println("  # iterations: " + iterations);
        System.out.println("  Rounds: " + rounds);
        System.out.println("\n\n");

        OneDimAveragingPhaser averagingPhaser = new OneDimAveragingPhaser(n);
 
        for (int i = 0; i < rounds; ++i) {
            System.out.println("Run " + (i + 1));
            averagingPhaser.runSequential(iterations);
            averagingPhaser.runForAllBarrier(iterations, tasks);
            averagingPhaser.runForAllFuzzyBarrier(iterations, tasks);
            try {
                Thread.sleep(1000);
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        System.out.println("\n");
    }

    private static void printResults(String name, long time) {
        System.out.printf("   %18s Time: %8.3f ms. \n", name, time / 1e6);
    }
}
 

Java online compiler

Write, Run & Share Java code online using OneCompiler's Java online compiler for free. It's one of the robust, feature-rich online compilers for Java language, running the Java LTS version 17. Getting started with the OneCompiler's Java editor is easy and fast. The editor shows sample boilerplate code when you choose language as Java and start coding.

Taking inputs (stdin)

OneCompiler's Java online editor supports stdin and users can give inputs to the programs using the STDIN textbox under the I/O tab. Using Scanner class in Java program, you can read the inputs. Following is a sample program that shows reading STDIN ( A string in this case ).

import java.util.Scanner;
class Input {
    public static void main(String[] args) {
    	Scanner input = new Scanner(System.in);
    	System.out.println("Enter your name: ");
    	String inp = input.next();
    	System.out.println("Hello, " + inp);
    }
}

Adding dependencies

OneCompiler supports Gradle for dependency management. Users can add dependencies in the build.gradle file and use them in their programs. When you add the dependencies for the first time, the first run might be a little slow as we download the dependencies, but the subsequent runs will be faster. Following sample Gradle configuration shows how to add dependencies

apply plugin:'application'
mainClassName = 'HelloWorld'

run { standardInput = System.in }
sourceSets { main { java { srcDir './' } } }

repositories {
    jcenter()
}

dependencies {
    // add dependencies here as below
    implementation group: 'org.apache.commons', name: 'commons-lang3', version: '3.9'
}

About Java

Java is a very popular general-purpose programming language, it is class-based and object-oriented. Java was developed by James Gosling at Sun Microsystems ( later acquired by Oracle) the initial release of Java was in 1995. Java 17 is the latest long-term supported version (LTS). As of today, Java is the world's number one server programming language with a 12 million developer community, 5 million students studying worldwide and it's #1 choice for the cloud development.

Syntax help

Variables

short x = 999; 			// -32768 to 32767
int   x = 99999; 		// -2147483648 to 2147483647
long  x = 99999999999L; // -9223372036854775808 to 9223372036854775807

float x = 1.2;
double x = 99.99d;

byte x = 99; // -128 to 127
char x = 'A';
boolean x = true;

Loops

1. If Else:

When ever you want to perform a set of operations based on a condition If-Else is used.

if(conditional-expression) {
  // code
} else {
  // code
}

Example:

int i = 10;
if(i % 2 == 0) {
  System.out.println("i is even number");
} else {
  System.out.println("i is odd number");
}

2. Switch:

Switch is an alternative to If-Else-If ladder and to select one among many blocks of code.

switch(<conditional-expression>) {    
case value1:    
 // code    
 break;  // optional  
case value2:    
 // code    
 break;  // optional  
...    
    
default:     
 //code to be executed when all the above cases are not matched;    
} 

3. For:

For loop is used to iterate a set of statements based on a condition. Usually for loop is preferred when number of iterations is known in advance.

for(Initialization; Condition; Increment/decrement){  
    //code  
} 

4. While:

While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.

while(<condition>){  
 // code 
}  

5. Do-While:

Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.

do {
  // code 
} while (<condition>); 

Classes and Objects

Class is the blueprint of an object, which is also referred as user-defined data type with variables and functions. Object is a basic unit in OOP, and is an instance of the class.

How to create a Class:

class keyword is required to create a class.

Example:

class Mobile {
    public:    // access specifier which specifies that accessibility of class members 
    string name; // string variable (attribute)
    int price; // int variable (attribute)
};

How to create a Object:

Mobile m1 = new Mobile();

How to define methods in a class:

public class Greeting {
    static void hello() {
        System.out.println("Hello.. Happy learning!");
    }

    public static void main(String[] args) {
        hello();
    }
}

Collections

Collection is a group of objects which can be represented as a single unit. Collections are introduced to bring a unified common interface to all the objects.

Collection Framework was introduced since JDK 1.2 which is used to represent and manage Collections and it contains:

  1. Interfaces
  2. Classes
  3. Algorithms

This framework also defines map interfaces and several classes in addition to Collections.

Advantages:

  • High performance
  • Reduces developer's effort
  • Unified architecture which has common methods for all objects.
CollectionDescription
SetSet is a collection of elements which can not contain duplicate values. Set is implemented in HashSets, LinkedHashSets, TreeSet etc
ListList is a ordered collection of elements which can have duplicates. Lists are classified into ArrayList, LinkedList, Vectors
QueueFIFO approach, while instantiating Queue interface you can either choose LinkedList or PriorityQueue.
DequeDeque(Double Ended Queue) is used to add or remove elements from both the ends of the Queue(both head and tail)
MapMap contains key-values pairs which don't have any duplicates. Map is implemented in HashMap, TreeMap etc.