Skip to content

Commit 7b1d5d4

Browse files
committed
fix: math rendering in dark mode
1 parent f899c84 commit 7b1d5d4

File tree

1 file changed

+8
-8
lines changed
  • kep/61-Trimaran-real-load-aware-scheduling

1 file changed

+8
-8
lines changed

kep/61-Trimaran-real-load-aware-scheduling/README.md

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -220,19 +220,19 @@ Following is the algorithm:
220220
**Algorithm**
221221

222222

223-
1. Get the requested resource for the pod to be scheduled as, <img src="https://render.githubusercontent.com/render/math?math=r">.
224-
2. Get the sliding window average (<img src="https://render.githubusercontent.com/render/math?math=M">) and standard deviation (<img src="https://render.githubusercontent.com/render/math?math=V">) of resource utilization fraction (range from 0 to 1) for all types of resources (CPU, Memory, GPU, etc.) of the current node to be scored.
225-
3. Calculate the score of the current node for each type of resource: <img src="https://render.githubusercontent.com/render/math?math=S_i = M %2B r %2B V">
226-
4. Get a score for each type of resource and bound it to [0,1]: <img src="https://render.githubusercontent.com/render/math?math=S_i = \min(S_i, 1.0)">
227-
5. Calculate the node priority score per resource as: <img src="https://render.githubusercontent.com/render/math?math=U_i = (1 - S_i) \times MaxPriority ">
228-
6. Get the final node score as: <img src="https://render.githubusercontent.com/render/math?math=U =\min(U_i)">
223+
1. Get the requested resource for the pod to be scheduled as, $r$.
224+
2. Get the sliding window average $M$ and standard deviation $V$ of resource utilization fraction (range from 0 to 1) for all types of resources (CPU, Memory, GPU, etc.) of the current node to be scored.
225+
3. Calculate the score of the current node for each type of resource: $S_i = M + r + V$
226+
4. Get a score for each type of resource and bound it to [0,1]: $S_i = min(S_i, 1.0)$
227+
5. Calculate the node priority score per resource as: $U_i = (1 - S_i) \times MaxPriority$
228+
6. Get the final node score as: $U = min(U_i)$
229229

230230
**Example**
231231

232232

233233
For example, let's say we have three nodes `N1`, `N2`, and `N3`, and the pod to be scheduled have CPU and Memory requests as 500 milicores and 1 GB. All nodes have a capacity of 4 cores and 8 GB.
234234

235-
The pod request fraction can be computed as <img src="https://render.githubusercontent.com/render/math?math=r_{cpu} = \frac{1}{8}, r_{memory} = \frac{1}{8}">.
235+
The pod request fraction can be computed as $r_{cpu} = \frac{1}{8}, r_{memory} = \frac{1}{8}$.
236236

237237

238238
<img src="images/image6.png" alt="node-capacity" width="700" height="200"/>
@@ -555,4 +555,4 @@ Unit tests and Integration tests will be added.
555555
"data"
556556
]
557557
}
558-
```
558+
```

0 commit comments

Comments
 (0)