Invention Grant
US08224955B2 Ensuring affinity at all affinity domains by folding at each affinity level possible for a partition spanning multiple nodes
失效
通过在跨越多个节点的分区的每个亲和力级别折叠来确保所有关联性域的亲和力
- Patent Title: Ensuring affinity at all affinity domains by folding at each affinity level possible for a partition spanning multiple nodes
- Patent Title (中): 通过在跨越多个节点的分区的每个亲和力级别折叠来确保所有关联性域的亲和力
-
Application No.: US12437035Application Date: 2009-05-07
-
Publication No.: US08224955B2Publication Date: 2012-07-17
- Inventor: Basu Vaidyanathan , Marcos A. Villarreal
- Applicant: Basu Vaidyanathan , Marcos A. Villarreal
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Yee & Associates, P.C.
- Agent David A. Mims, Jr.
- Main IPC: G06F15/173
- IPC: G06F15/173
Abstract:
The different illustrative embodiments provide a method, apparatus, and computer program product for folding at each affinity level for a partition spanning multiple nodes. In one illustrative embodiment, a method is provided for identifying a number of domains in a number of affinity levels. A lightest loaded domain is identified in the number of domains identified. A number of nodes are identified in the lightest loaded domain identified. A lightest loaded node is identified in the number of nodes. A lightest loaded processing unit on the lightest loaded node is identified and the lightest loaded processing unit is folded.
Public/Granted literature
Information query
