Dynamic optimization of command issuance in a computing cluster

US9350633B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9350633-B2
Application numberUS-201213557186-A
CountryUS
Kind codeB2
Filing dateJul 24, 2012
Priority dateJul 24, 2012
Publication dateMay 24, 2016
Grant dateMay 24, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Embodiments of the present invention provide a method, system and computer program product for dynamic optimization of command sequencing in a computing cluster. In an embodiment of the invention, a method for dynamic optimization of command sequencing in a computing cluster can include selecting a set of nodes in the computing cluster to receive a single command and probing the nodes of the set to compute a computer communications latency for each of the nodes. Thereafter, the single command can be transmitted to the nodes in the set according to a sequence determined by the computed computer communications latency for each of the nodes.

First claim

Opening claim text (preview).

We claim: 1. A method for dynamic optimization of command sequencing in a computing cluster, the method comprising: selecting a set of a multiplicity of nodes in the computing cluster to receive a single command; probing the nodes of the set to compute a computer communications latency for each of the nodes; generating a sequence of the multiplicity of nodes in the set in which the single command is to be transmitted to each of the multiplicity of the nodes in the set based upon the computed latency for each of the multiplicity of the nodes; and, transmitting the single command to the multiplicity of the nodes in the set according to the determined sequence. 2. The method of claim 1 , wherein the nodes are probed using a ping directive to each of the nodes. 3. The method of claim 2 , wherein the computed computer communications latency accounts for a time consumed in sending data to the nodes using the ping directive. 4. The method of claim 1 , wherein the nodes are probed using a traceroute directive to each of the nodes. 5. The method of claim 4 , wherein the computed computer communications latency accounts for a number of hops necessary to reach each of the nodes using the traceroute directive. 6. The method of claim 1 , wherein the nodes are probed with a test directive and the computed computer communications latency accounts for a period of time consumed by the nodes to each complete performance of the test directive. 7. The method of claim 1 , wherein the sequence is managed within a data structure of nodes sorted according to the computed computer communications latency for each of the nodes. 8. A clustered computing system configured for dynamic optimization of command sequencing, the system comprising: a plurality of computers, each comprising memory and at least one processor, each coupled to the other over a computer communications network; multiple different nodes each supported by one or more of the computers and forming a computing cluster; and, a command sequencer executing in memory of one of the computers in association with an originating one of the nodes, the sequencer comprising program code enabled to select a set of the multiplicity of the nodes to receive a single command, to probe the nodes of the set to compute a computer communications latency for each of the nodes, to generate a sequence of the multiplicity of nodes in the set in which the single command is to be transmitted to each of the multiplicity of the nodes in the set based upon the computed latency for each of the nodes, and to transmit the single command to the multiplicity of the nodes in the set according to the determined sequence. 9. The system of claim 8 , wherein the nodes are probed using a ping directive to each of the nodes. 10. The system of claim 9 , wherein the computed computer communications latency accounts for a time consumed in sending data to the nodes using the ping directive. 11. The system of claim 8 , wherein the nodes are probed using a traceroute directive to each of the nodes. 12. The system of claim 11 , wherein the computed computer communications latency accounts for a number of hops necessary to reach each of the nodes using the traceroute directive. 13. The system of claim 8 , wherein the nodes are probed with a test directive and the computed computer communications latency accounts for a period of time consumed by the nodes to each complete performance of the test directive. 14. The system of claim 8 , wherein the sequence is managed within a data structure of nodes sorted according to the computed computer communications latency for each of the nodes. 15. A computer program product for dynamic optimization of command sequencing in a computing cluster, the computer program product comprising: a non-transitory computer readable storage medium comprising a memory device having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for selecting a set of a multiplicity of nodes in the computing cluster to receive a single command; computer readable program code for probing the nodes of the set to compute a computer communications latency for each of the nodes; computer readable program code for generating a sequence of the multiplicity of nodes in the set in which the single command is to be transmitted to each of the multiplicity of the nodes in the set based upon the computed latency for each of the multiplicity of the nodes; and, computer readable program code for transmitting the single command to the multiplicity of the nodes in the set according to the determined sequence. 16. The computer program product of claim 15 , wherein the nodes are probed using a ping directive to each of the nodes. 17. The computer program product of claim 16 , wherein the computed computer communications latency accounts for a time consumed in sending data to the nodes using the ping directive. 18. The computer program product of claim 15 , wherein the nodes are probed using a traceroute directive to each of the nodes. 19. The computer program product of claim 18 , wherein the computed computer communications latency accounts for a number of hops necessary to reach each of the nodes using the traceroute directive. 20. The computer program product of claim 15 , wherein the nodes are probed with a test directive and the computed computer communications latency accounts for a period of time consumed by the nodes to each complete performance of the test directive. 21. The computer program product of claim 15 , wherein the sequence is managed within a data structure of nodes sorted according to the computed computer communications latency for each of the nodes.

Assignees

Inventors

Classifications

  • Assignment of logical groups to network elements · CPC title

  • Delays · CPC title

  • characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability (for optimising operational conditions of wireless networks H04W24/02) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9350633B2 cover?
Embodiments of the present invention provide a method, system and computer program product for dynamic optimization of command sequencing in a computing cluster. In an embodiment of the invention, a method for dynamic optimization of command sequencing in a computing cluster can include selecting a set of nodes in the computing cluster to receive a single command and probing the nodes of the se…
Who is the assignee on this patent?
Cudak Gary D, Hardee Christopher J, Humes Randall C, and 3 more
What technology area does this patent fall under?
Primary CPC classification H04L43/0852. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue May 24 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).