-
Notifications
You must be signed in to change notification settings - Fork 77
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Resource allocation of firmament #47
Comments
Hi @cxxly, Sorry for the delayed response -- I'm currently travelling. I'll respond in more detail a bit later. The bottom line is this: Firmament does use "slots" in the sense that each running task "uses" a leaf of the resource topology (= a PU/CPU core). This makes it easy to implement slot-based allocation policies, but does not mean that you must use slots. Instead, you can see the leaves as an upper limit on the number of tasks that can run on a machine, which can be greater than the number of CPU cores (just add another level, or make up some "fake" cores, or increase the per-leaf capacity To address your questions quickly:
Hope that makes sense! |
Thanks! @ms705 I 'm interested in @joshbambrick work, is there any published paper I can learn. And I have some question about admission control in COCO cost model, I will open a new issue. |
Hi @cxxly, We're going to have a blog post on @joshbambrick's work soon; if you're interested in a longer writeup, his BA dissertation is available here. Did you end up opening a new issue about the CoCo admission control questions? I don't see any, but I may have missed it while travelling. |
Hi @ms705 I‘m really sorry for the delayed response. I’m very busy nowadays for my graduation. I will open a new issue later. |
Hi:
As far as I know, there are two ways to allocate resource:
I have seen that both your work and Quincy use constant integer K to represent the capacity of a machine, like coarse-grained allocate. But there are some fine-grained resource information in cost model.
I want to know
The text was updated successfully, but these errors were encountered: