Hacker News new | ask | show | jobs
by Nokinside 2960 days ago
The solution they pick is typical linear programming problem using die size, yield and price of different options after disabling failed areas.
2 comments

They also layout with some understanding of the yield (yield is almost entirely a function of die area at a given node). So if they decide to just entirely bin off the GPU, and they know this ahead of time enough, it makes more sense to not have a GPU in the first place. The GPU is about half the die area, so you would get better yield by just not having it at all (but all of this depends on having enough lead time to decide this before layout).
any links to such an LP problem? I am curious to see how they formulate the problem. thanks in advance.