Could anyone suggest a source about incorporation of "caching" into job-shop-like scheduling problem formulation?
In other words, i would like to explore a way to approach a problem of statically scheduling (heterogenous) computations and data transfers between multuple tiers of caches (disk, ram, vram) in OR fashion (e.g. formulating MILP).
You may or may not be aware of COIN-OR (https://www.coin-or.org/) which contains multiple projects exploring and implementing OR algorithms with some forms of caching and parallelism.
What isn’t clear is how completely any of the COIN-OR projects address your rather interesting question; I’m commenting partly to share if the resource is helpful and partly as a reminder to come back to see what other smart folks here may contribute :-)
Great project, congrats to the author if its around here.
I am working on something similar, but for the Cerebras CS-3 engine, visualizing stuff like this really helps when designing algos for these architectures.
Could anyone suggest a source about incorporation of "caching" into job-shop-like scheduling problem formulation?
In other words, i would like to explore a way to approach a problem of statically scheduling (heterogenous) computations and data transfers between multuple tiers of caches (disk, ram, vram) in OR fashion (e.g. formulating MILP).
You may or may not be aware of COIN-OR (https://www.coin-or.org/) which contains multiple projects exploring and implementing OR algorithms with some forms of caching and parallelism.
What isn’t clear is how completely any of the COIN-OR projects address your rather interesting question; I’m commenting partly to share if the resource is helpful and partly as a reminder to come back to see what other smart folks here may contribute :-)
Great project, congrats to the author if its around here.
I am working on something similar, but for the Cerebras CS-3 engine, visualizing stuff like this really helps when designing algos for these architectures.