From e74ed9dbca0acdb9a283cba1cc9cdc47c43fa19a Mon Sep 17 00:00:00 2001 From: Caleb Fontenot Date: Mon, 19 Feb 2024 09:58:49 -0600 Subject: [PATCH] Markou moment --- .../java/edu/slcc/asdv/caleb/maxtask/ParallelMax.java | 10 +++++++--- 1 file changed, 7 insertions(+), 3 deletions(-) diff --git a/Semester 3/Assignments/MaxTask/src/main/java/edu/slcc/asdv/caleb/maxtask/ParallelMax.java b/Semester 3/Assignments/MaxTask/src/main/java/edu/slcc/asdv/caleb/maxtask/ParallelMax.java index 39b3027..101efe4 100644 --- a/Semester 3/Assignments/MaxTask/src/main/java/edu/slcc/asdv/caleb/maxtask/ParallelMax.java +++ b/Semester 3/Assignments/MaxTask/src/main/java/edu/slcc/asdv/caleb/maxtask/ParallelMax.java @@ -14,7 +14,7 @@ public class ParallelMax public static void main(String[] args) { // Create a list - final int N = 200000000; + final int N = 20; int[] list = new int[N]; for (int i = 0; i < list.length; i++) list[i] = i; @@ -51,7 +51,7 @@ public class ParallelMax extends RecursiveTask { - private final static int THRESHOLD = 25000; + private final static int THRESHOLD = 3; private int[] list; @@ -81,9 +81,13 @@ public class ParallelMax { int mid = (low + high) / 2; RecursiveTask left = new MaxTask(list, low, mid); + System.out.println("left: " + low +", " + high); RecursiveTask right = new MaxTask(list, mid+1, high); + System.out.println("right: " + (mid + 1) +", " + high); + System.out.println("fork right"); right.fork(); - left.fork(); + System.out.println("fork left"); + left.fork(); return new Integer(Math.max( left.join().intValue(), right.join().intValue()) );