Update with new parallel benchmarks

RAIRLab · Apr 27, 2023 · c40a0cd · c40a0cd
1 parent 3a51a0a
commit c40a0cd
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 5 deletions.
diff --git a/benchmarks/quickbench.py b/benchmarks/quickbench.py
@@ -7,7 +7,7 @@
 #Quick bench Paramaters 
 
 #Proof to quickbench
-proof = "../proofs/hyperslate/benchmarks/Tree18.slt"
+proof = "../proofs/hyperslate/benchmarks/Branch100-150.slt"
 ranks = [1, 2, 3, 4, 5, 6, 7, 8] #Num Ranks to test
 #ParallelVerifier Args to test with
 MPIArgs = [

diff --git a/proofs/hyperslate/generateBenchmarks.py b/proofs/hyperslate/generateBenchmarks.py
@@ -9,8 +9,8 @@
 lineLengths: "list(int)" = [100, 150, 200, 250, 300, 350, 400] #Number of nodes in the the linear benchmark
 
 #Branch Proof Topology
-numBranchs: int = 12
-branchLengths: "list(int)" = [1, 25, 50, 75, 100, 125, 150]
+numBranchs: "list(int)" = [30, 50, 70, 90, 110, 130, 150]
+branchLengths: "list(int)" = [100]
 
 #Tree proof Topology
 treeDepths: "list(int)" = [8, 10, 12, 14, 16, 18, 20]  #The tree will have 2^treeDepth nodes
@@ -128,8 +128,9 @@ def genTreeTopology(treeLevels: int):
 for ll in lineLengths:
     genLineTopology(ll)
 
-for ll in branchLengths:
-    genBranchTopology(numBranchs, ll)
+for lb in numBranchs:
+    for ll in branchLengths:
+        genBranchTopology(lb, ll)
 
 for td in treeDepths:
     genTreeTopology(td)