blob: 7b17b7f38bbbe65dcee6da8d640347aa4123aa71 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
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.
|
