Mixing
bin packing with constraints?
$begingroup$
I recently implemented a bin packing algorithm to help me decide how to re-balance some collections in my database cluster. I was very excited to see it balance all the collections by size as I wanted, but the way it fills bins places large collections together and then the last bin is full of tiny collections.
For example
BIN 1 BIN 2 BIN N
----- ----- .... -----
500GB 500GB 0.07GB
200GB 200GB 0.06GB
100GB 100GB .....
It would be more optimal for me if I could have bins that sought to maximize the number of small collections per large collection in each bin. Something like this:
BIN 1 BIN 2 BIN N
----- ----- .... -----
500GB 500GB 200GB
100GB 100GB 200GB
0.76GB 0.76GB 0.76GB
... ... ...
The reason being that the large collections and small collections of complimentary usage patterns; by pairing them together I can more efficiently use my resources.
combinatorics
asked Feb 1 at 14:21
BreedlyBreedly
143114
$endgroup$
add a comment |
$begingroup$
I recently implemented a bin packing algorithm to help me decide how to re-balance some collections in my database cluster. I was very excited to see it balance all the collections by size as I wanted, but the way it fills bins places large collections together and then the last bin is full of tiny collections.
For example
BIN 1 BIN 2 BIN N
----- ----- .... -----
500GB 500GB 0.07GB
200GB 200GB 0.06GB
100GB 100GB .....
It would be more optimal for me if I could have bins that sought to maximize the number of small collections per large collection in each bin. Something like this:
BIN 1 BIN 2 BIN N
----- ----- .... -----
500GB 500GB 200GB
100GB 100GB 200GB
0.76GB 0.76GB 0.76GB
... ... ...
The reason being that the large collections and small collections of complimentary usage patterns; by pairing them together I can more efficiently use my resources.
combinatorics
asked Feb 1 at 14:21
BreedlyBreedly
143114
$endgroup$
$begingroup$
Just of the top, I would try putting the largest collection into the bin with the largest available space. Continuing for all collections. This should result in your second distribution.
$endgroup$
– Daniel Mathias
Feb 1 at 14:51
add a comment |
$begingroup$
I recently implemented a bin packing algorithm to help me decide how to re-balance some collections in my database cluster. I was very excited to see it balance all the collections by size as I wanted, but the way it fills bins places large collections together and then the last bin is full of tiny collections.
For example
BIN 1 BIN 2 BIN N
----- ----- .... -----
500GB 500GB 0.07GB
200GB 200GB 0.06GB
100GB 100GB .....
It would be more optimal for me if I could have bins that sought to maximize the number of small collections per large collection in each bin. Something like this:
BIN 1 BIN 2 BIN N
----- ----- .... -----
500GB 500GB 200GB
100GB 100GB 200GB
0.76GB 0.76GB 0.76GB
... ... ...
The reason being that the large collections and small collections of complimentary usage patterns; by pairing them together I can more efficiently use my resources.
combinatorics
asked Feb 1 at 14:21
BreedlyBreedly
143114
$endgroup$
I recently implemented a bin packing algorithm to help me decide how to re-balance some collections in my database cluster. I was very excited to see it balance all the collections by size as I wanted, but the way it fills bins places large collections together and then the last bin is full of tiny collections.
For example
BIN 1 BIN 2 BIN N
----- ----- .... -----
500GB 500GB 0.07GB
200GB 200GB 0.06GB
100GB 100GB .....
It would be more optimal for me if I could have bins that sought to maximize the number of small collections per large collection in each bin. Something like this:
BIN 1 BIN 2 BIN N
----- ----- .... -----
500GB 500GB 200GB
100GB 100GB 200GB
0.76GB 0.76GB 0.76GB
... ... ...
The reason being that the large collections and small collections of complimentary usage patterns; by pairing them together I can more efficiently use my resources.
combinatorics
combinatorics
asked Feb 1 at 14:21
BreedlyBreedly
143114
asked Feb 1 at 14:21
BreedlyBreedly
143114
asked Feb 1 at 14:21
BreedlyBreedly
143114
asked Feb 1 at 14:21
BreedlyBreedly
143114
asked Feb 1 at 14:21
BreedlyBreedly
143114
143114
$begingroup$
Just of the top, I would try putting the largest collection into the bin with the largest available space. Continuing for all collections. This should result in your second distribution.
$endgroup$
– Daniel Mathias
Feb 1 at 14:51
add a comment |
$begingroup$
Just of the top, I would try putting the largest collection into the bin with the largest available space. Continuing for all collections. This should result in your second distribution.
$endgroup$
– Daniel Mathias
Feb 1 at 14:51
$begingroup$
Just of the top, I would try putting the largest collection into the bin with the largest available space. Continuing for all collections. This should result in your second distribution.
$endgroup$
– Daniel Mathias
Feb 1 at 14:51
$begingroup$
Just of the top, I would try putting the largest collection into the bin with the largest available space. Continuing for all collections. This should result in your second distribution.
$endgroup$
– Daniel Mathias
Feb 1 at 14:51
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3096279%2fbin-packing-with-constraints%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3096279%2fbin-packing-with-constraints%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Just of the top, I would try putting the largest collection into the bin with the largest available space. Continuing for all collections. This should result in your second distribution.
$endgroup$
– Daniel Mathias
Feb 1 at 14:51