no seriously the first hit is a paper with an algorithm
-
-
Replying to @FioraAeterna @stephentyrone
the minimum schedule induces extra edges in the graph (corresponding to ordering in the schedule) that connect what would otherwise be parallel components of your graph.
1 reply 0 retweets 0 likes -
I believe if your program is in SSA, then you can just assign registers first come first serve and it ends up optimal. Could be wrong.
2 replies 0 retweets 0 likes -
yes, but i don't have a *schedule*. that's the problem.
1 reply 0 retweets 1 like -
Replying to @FioraAeterna @pcwalton and
i know i can schedule first come first serve, and that works, but i'll get a dramatically inflated number because the code isn't scheduled yet.
1 reply 0 retweets 0 likes -
Ah, I see the problem. Um…you could try just visiting all live intervals and greedily splitting each one if possible
2 replies 0 retweets 0 likes -
don't you need a schedule to have live-intervals?
1 reply 0 retweets 0 likes
Yeah. I mean, start with a naive schedule and then greedily refine it
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.