Coupled placement of items using stable marriage techniques
AssigneeInternational Business Machines Corporation
InventorsMadhukar R. Korupolu, Aameek Singh
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsMadhukar R. Korupolu, Aameek Singh
Estimating the term…
A program and method are disclosed for placing coupled items in a resource graph using stable marriage techniques. Each coupled item requires resources of a first resource and a second resource in a resource graph. The resource nodes in the graph provide either the first resource or the second resource or both. Coupled placement defines each item as having two elements, one representing the first resource requirement and the other representing the second resource requirement, which must be placed on a pair of connected resource nodes. The objective is to place the coupled item elements among nodes of the resource graph without exceeding the first resource capacities and second resource capacities at resource nodes while keeping the total cost over all items small. A stable marriage process guides the placement that may also employ knapsacking of multiple elements on resource nodes and a swapping analysis to further optimize placement.
A computer program embodied on a computer readable medium, comprising:
A method, comprising the steps of:
Dependencies are inferred from the claim text.