Support of non-trivial scheduling policies along with topological properties

• US 10,387,194 B2
• Filed: 07/25/2016
• Issued: 08/20/2019
• Est. Priority Date: 05/11/2004
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Shpigelman, Igor
• Primary Examiner(s): Tang, Kenneth
• Application Number:
  US15/219,071
• Publication Number:
  US 20160335013A1
• Time in Patent Office: 1,121 Days
• Field of Search: None
• CPC Class Codes: G06F 13/1663 Access to shared memory
• CPC Class Codes: G06F 2209/483 Multiproc
• CPC Class Codes: G06F 2212/2542 Non-uniform memory access [NUMA] architecture
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/0629 Configuration or reconfiguration of storage systems
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/0689 Disk arrays, e.g. RAID, JBOD
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• CPC Class Codes: G06F 9/5016 the resource being the memory

Abstract

A system includes a topology monitoring unit to generate a topology map of a machine where the machine includes node boards in host computers. The topology map is indicative of interconnections of resources of the machine. The topology monitoring unit queries the machine to identify elements of the machine, stores all the elements of the machine in a string array, generates a key for each element as an array of integers where each integer in the array represents an offset into the string array, and generates the topology map of the machine using the generated keys.

Claims

1. A computer system, comprising:

a processor for executing computing instructions;

a memory for storing the computing instructions; and

a topology monitoring unit associated with the processor and the memory to generate a topology map of a machine, the machine having node boards in host computers, the topology map indicative of interconnections of resources of the machine, the topology monitoring unit operable to;

query the machine and identify the resources of the machine;

store all the resources of the machine in a string array;

generate a key for each resource as an array of integers, each integer in the array representing an offset into the string array;

generate the topology map of the machine using the generated keys;

assess a status of the resources and generate status signals indicative of the status of the resources; and

dispatch a job to the resources based on a mapping of resources via the keys.

2. The computer system of claim 1, wherein each integer in the key represents a different level in the machine.

3. The computer system of claim 1, wherein each key is unique for a respective resource.

4. The computer system of claim 2, wherein a lowest level in the key corresponds to a respective node board.

5. The computer system of claim 1, wherein the key includes a bit-mask to represent a central processing unit of a respective node board.

6. A method, comprising:

querying a machine to identify resources of the machine, the machine having node boards in host computers;

storing all the resources of the machine in a string array;

generating a key for each resource as an array of integers, each integer in the array representing an offset into the string array;

generating a topology map of the machine using the generated keys, the topology map indicative of interconnections of the resources of the machine;

assessing a status of the resources and generating status signals indicative of the status of the resources; and

dispatching a job to the resources based on a mapping of resources via the keys.

7. The method of claim 6, further comprising setting each integer in the key to represent a different level in the machine.

8. The method of claim 6, further comprising generating each key being unique for a respective resource.

9. The method of claim 7, further comprising setting a lowest level in the key as corresponding to a respective node board.

10. The method of claim 6, further comprising including a bit-mask in the key to represent a central processing unit of a respective node board.

11. A computer program product for generating a topology map of a machine, the computer program product comprising:

a non-transitory computer readable medium having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to;

query the machine to identify resources of the machine, the machine having node boards in host computers;

store all the resources of the machine in a string array;

generate a key for each resource as an array of integers, each integer in the array representing an offset into the string array;

generate the topology map of the machine using the generated keys, the topology map indicative of interconnections of the resources of the machine;

assess a status of the resources and generate status signals indicative of the status of the resources; and

dispatch a job to the resources based on a mapping of resources via the keys.

12. The computer program product of claim 11, wherein the computer readable program code is configured to set each integer in the key to represent a different level in the machine.

13. The computer program product of claim 11, wherein the computer readable program code is configured to generate each key being unique for a respective resource.

14. The computer program product of claim 12, wherein the computer readable program code is configured to set a lowest level in the key as corresponding to a respective node board.

15. The computer program product of claim 11, wherein the computer readable program code is configured to include a bit-mask in the key to represent a central processing unit of a respective node board.