This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| capacity=8 | |
| sizes = [1,2,4,8] | |
| # Look at all "interesting" two node scenarios where there is an incoming pod P. | |
| # Node are called A and B. | |
| # This is a list of (node_a_allocatable, node_b_allocatable, pod_p_limit) | |
| # A is always the less allocated node. | |
| # P is feasible on both A or B. (Ignore scenarios where there is no choice to make.) | |
| # P has a size in `sizes' | |
| scenarios = [(a,b,p) for a in range(9) for b in range(a+1,9) for p in sizes if a+p <= capacity] | |
| # scenarios = [(0, 1, 1), (0, 1, 2), ..., (0, 2, 1), ..., (6, 8, 2), (7, 8, 1)] |
OlderNewer