summaryrefslogtreecommitdiffstats
path: root/content/zettel/1c2a2c.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/zettel/1c2a2c.md')
-rw-r--r--content/zettel/1c2a2c.md23
1 files changed, 23 insertions, 0 deletions
diff --git a/content/zettel/1c2a2c.md b/content/zettel/1c2a2c.md
new file mode 100644
index 0000000..845004b
--- /dev/null
+++ b/content/zettel/1c2a2c.md
@@ -0,0 +1,23 @@
++++
+title = "Resource constraints"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["1c2a2b"]
+forwardlinks = []
+zettelid = "1c2a2c"
++++
+
+Resource constraints
+: These are the constraints that lead to resource constraint
+ managements and the implementation of pipelined operations.
+
+The first important step is to derive a linear order for the operations,
+so that one gets a good estimation of the operations in between two
+operations. This can be defined by getting the ALAP scheduling and then
+the ASAP scheduling for tie breakers.
+
+We then go through the operations of type *res*, and count how many
+different operations are in between. If there are $c-1$ operations in
+between, where *c* is the maximum number of functional units for *res*,
+we can then schedule the operation to start *II* cycles later.