summaryrefslogtreecommitdiffstats
path: root/content/zettel/1c2a.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/zettel/1c2a.md')
-rw-r--r--content/zettel/1c2a.md17
1 files changed, 17 insertions, 0 deletions
diff --git a/content/zettel/1c2a.md b/content/zettel/1c2a.md
new file mode 100644
index 0000000..7b17b7f
--- /dev/null
+++ b/content/zettel/1c2a.md
@@ -0,0 +1,17 @@
++++
+title = "Scheduling as an ILP"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["1c2"]
+forwardlinks = ["1c2b", "1c2a1"]
+zettelid = "1c2a"
++++
+
+Scheduling can be expressed as an integer linear program (ILP) by
+setting constraints that have to be held and solving for the optimal
+solution. Constraints could be dependencies between different
+instructions and would therefore say that these instructions cannot run
+in parallel. The result of solving the ILP is therefore a mathematically
+correct schedule that adheres to the constraints that were used in the
+ILP.