public class Solver {
    final int N;
    final float[][] data;
    final CyclicBarrier barrier;
    volatile boolean over = false;
    public Solver(float[][] matrix) throws InterruptedException {
        data = matrix;
        N = matrix.length;
        //每一輪循環(huán)都會執(zhí)行，并且需要run執(zhí)行完才會觸發(fā)下一輪開啟.
        Runnable barrierAction =
                new Runnable() {
                    @Override
                    public void run() {
                        System.out.println("Solver.run");
                        over = true;
                    }
                };
        //初始化CyclicBarrier
        barrier = new CyclicBarrier(N, barrierAction);
        List<Thread> threads = new ArrayList<>(N);
        for (int i = 0; i < N; i++) {
            Thread thread = new Thread(new Worker(i));
            threads.add(thread);
            thread.start();
        }
        // wait until done
        for (Thread thread : threads) {
            thread.join();
        }
    }
    //程序入口
    public static void main(String[] args) throws InterruptedException {
        float[][] matrix = {{1.2F}, {2.2F}};
        Solver solver = new Solver(matrix);
    }
    class Worker implements Runnable {
        int myRow;
        Worker(int row) {
            myRow = row;
        }
        @Override
        public void run() {
            while (!done()) {
                processRow(myRow);
                try {
                    barrier.await();
                } catch (InterruptedException | BrokenBarrierException ex) {
                    return;
                }
            }
        }
        private void processRow(int myRow) {
            System.out.println("Worker.processRow:" + myRow);
        }
        private boolean done() {
            return over;
        }
    }
}

 if (barrier.await() == 0) {
   // log the completion of this iteration
 }

CyclicBarrier(int parties, Runnable barrierAction) 
//添加線程在屏障達到時觸發(fā)！線程會阻塞下一輪開始直到該線程執(zhí)行完畢。

int getParties()  //獲取當前設置的屏障數

int await()       //等待直到所有線程執(zhí)行await達到屏障數

int await(long timeout, TimeUnit unit)  //等待直到所有線程執(zhí)行await達到屏障數或者超過指定超時時間

boolean isBroken()   //查詢當前屏障是否處于broken狀態(tài)

void reset()         //重置當前屏障數到初始時數量

int getNumberWaiting() //查詢當前等待未到達屏障值的線程數