Release candidate version 2

Kobzol · Nov 12, 2024 · 91b5130 · 91b5130
1 parent 6102f20
commit 91b5130
Show file tree

Hide file tree

Showing 3 changed files with 9 additions and 9 deletions.
diff --git a/thesis/defence/estee.py b/thesis/defence/estee.py
@@ -42,7 +42,7 @@ def estee_code(slide: Box):
         slide = slide_header_top(slide, "ESTEE")
         slide.update_style("code", T(size=26))
 
-        slide.box(p_top=80).text("Framework for simulating task graph execution")
+        slide.box(p_top=80).text("Framework for simulating workflow execution")
 
         row = slide.box(horizontal=True, x=25, p_top=100, show="next+")
         width = 1030
@@ -78,7 +78,7 @@ def estee_analysis(slide: Box):
         slide.update_style("default", T(size=45))
         lst = unordered_list(slide.box())
         lst.item().text("Compare scheduler performance")
-        lst.item(show="next+").text("Analyze neglected factors")
+        lst.item(show="next+").text("Analyze factors that affect scheduling")
         # lst2 = lst.ul()
         # lst2.item().text("Knowledge about task durations", style="l2")
         # lst2.item().text("Delay between scheduler invocations", style="l2")

diff --git a/thesis/defence/hq.py b/thesis/defence/hq.py
@@ -92,15 +92,15 @@ def task_to_allocation_mapping(slide: Box):
         lst2.item().text("Massive overhead (millions of allocations)", style="l2")
         lst2.item().text("Allocation count limits", style="l2")
         lst2.item().text("Node granularity", style="l2")
-        lst.item(show="next+", p_top=10).text("One allocation for the whole task graph")
+        lst.item(show="next+", p_top=10).text("One allocation for the whole workflow")
         lst2 = lst.ul()
-        lst2.item().text("Only for small task graphs", style="l2")
+        lst2.item().text("Only for small workflows", style="l2")
         lst2.item().text("Leads to resource waste", style="l2")
-        lst.item(show="next+", p_top=10).text("Split task graph into multiple allocations")
+        lst.item(show="next+", p_top=10).text("Split workflow into multiple allocations")
         lst2 = lst.ul()
         lst2.item().text("Challenging to find good partitioning", style="l2")
         lst2.item().text("No load balancing across allocations", style="l2")
-        lst2.item().text("Difficult dependency management", style="l2")
+        lst2.item().text("Dependencies and fault tolerance are problematic", style="l2")
 
         task_size = 50
         node_size = 60
@@ -172,7 +172,7 @@ def get_color(index: int) -> str:
 
     @slides.slide()
     def metascheduling(slide: Box):
-        content = slide_header_top(slide, "Task graph partitioning")
+        content = slide_header_top(slide, "Workflow partitioning")
         content.update_style("default", T(size=42))
 
         margin_bottom = 30
@@ -513,7 +513,7 @@ def hq_solutions(slide: Box):
         lst.item(show="next+").text("Fault-tolerance")
         lst2 = lst.ul()
         lst2.item().text("Worker and server resilience", style="l2")
-        lst.item(show="next+").text("I/O streaming")
+        lst.item(show="next+").text("Output streaming")
         lst2 = lst.ul()
         lst2.item().text("Reduces networked filesystem contention", style="l2")
         lst.item(show="next+").text("Several programming interfaces")

diff --git a/thesis/defence/slides.py b/thesis/defence/slides.py
@@ -88,7 +88,7 @@ def topic_highlight(slides: elsie.Slides, text: str, header: Optional[str] = Non
 
 @slides.slide()
 def task_graph_challenges(slide: Box):
-    slide.box().text("Task graph challenges on HPC clusters", style=TextStyle(size=54))
+    slide.box().text("Workflow challenges on HPC clusters", style=TextStyle(size=54))
 
 
 challenges(slides)