Push signaling to run jobs on available servers
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/173
H04L-012/24
G06F-011/30
G06F-011/07
출원번호
US-0102281
(2013-12-10)
등록번호
US-9584361
(2017-02-28)
발명자
/ 주소
Anderson, Mark Andrew
Brown, Christopher James
Smith, Kevin Allen
Keiser, John Braden
출원인 / 주소
Chef Software Inc.
대리인 / 주소
Branch, John W.
인용정보
피인용 횟수 :
0인용 특허 :
4
초록▼
Embodiments are directed towards push signaling to run jobs on available servers. Users may provide jobs or job instructions to a job control node. Job control node may determine one or more available job target nodes from among a plurality of managed nodes associated with the job control node. The
Embodiments are directed towards push signaling to run jobs on available servers. Users may provide jobs or job instructions to a job control node. Job control node may determine one or more available job target nodes from among a plurality of managed nodes associated with the job control node. The job target nodes may be determined based on information included in the provided job instructions. If there are available job target nodes, the job control node may provide the job instructions to each available job target node. Further, the job control node may receive communications from one or more available job target nodes that indicates that the job target node is prepared and ready to execute the received job instructions. Next, the job control node may issue a job start command that triggers the prepared job target nodes to begin executing the provided job instructions.
대표청구항▼
1. A method for managing a job over a network, comprising: communicating a heartbeat message between at least a job control node and at least one of a plurality managed nodes;employing at least one of the heartbeat message and at least one job instruction to a job control node to determine at least
1. A method for managing a job over a network, comprising: communicating a heartbeat message between at least a job control node and at least one of a plurality managed nodes;employing at least one of the heartbeat message and at least one job instruction to a job control node to determine at least one of the plurality of managed nodes that is available to be managed as a job target node, wherein the at least one job instruction includes at least a quorum requirement;providing the at least one job instruction to at least one of the available job target nodes that is ready to be prepared to execute the at least one job instruction when a total number of the at least one available job target nodes is sufficient to perform the job, wherein the at least one job instruction on each prepared job target nodes is sequentially executed after determined time intervals;determining each prepared job target node based on at least an acknowledgment that the at least one job instruction is delivered to and accepted by an available job target node and the available job target node is prepared to execute the job instruction; andwhen a number of the acknowledgments provided by the available job target nodes matches the quorum requirement, each of the prepared job target nodes being provided the at least one job instruction executes the at least one job instruction on each of the prepared job target nodes, wherein a status for success of the job is updated based on the execution of the at least one job instruction by at least one of the prepared job target nodes. 2. The method of claim 1, wherein when the at least one job instruction is finished executing on each of the prepared job target nodes, recording a job status for each of the prepared job target nodes. 3. The method of claim 1, further comprising, determining each of the available job target nodes that is prepared to execute the at least one job instruction based on at least an acknowledgement from each of the available job target nodes that is prepared to execute. 4. The method of claim 1, wherein the at least one job instruction includes at least one search expression that is employed to determine the at least one of the plurality of managed nodes that is available to be managed as the job target node based on whether the at least one of the plurality of managed nodes has previously succeeded or failed to execute the at least one job instruction. 5. The method of claim 1, wherein executing the at least one job instruction, further comprises: segmenting the prepared job target nodes into portions; andexecuting the at least one job instruction on a first portion of the prepared job target nodes. 6. The method of claim 1, wherein determining the at least one available job target node, further comprises, searching among a plurality of managed nodes based on at least one entity group, wherein the at least one entity group includes at least one type of node. 7. A system that is arranged for managing a job over a network, comprising: a job control node comprising: a transceiver that is operative to communicate over the network;a memory that is operative to store at least instructions; anda processor device that is operative to execute instructions that enable actions, including: communicating a heartbeat message between at least the job control node and at least one of a plurality managed nodes;employing at least one of the heartbeat message and at least one job instruction to a job control node to determine at least one of the plurality of managed nodes that is available to be managed as a job target node, wherein the at least one job instruction includes at least a quorum requirement;providing the at least one job instruction to at least one of the available job target nodes that is ready to be prepared to execute the at least one job instruction when a total number of the at least one available job target nodes is sufficient to perform the job, wherein the at least one job instruction on each prepared job target nodes is sequentially executed after determined time intervals;determining prepared job target nodes based on at least an acknowledgment that the at least one job instruction is delivered to and accepted by an available job target node and the available job target node is prepared to execute the job instruction; andwhen a number of the acknowledgments provided by the available job target nodes matches the quorum requirement, each of the prepared job target nodes being provided the at least one job instruction executes the at least one job instruction on each of the prepared job target nodes, wherein a status for success of the job is updated based on the execution of the at least one job instruction by at least one of the prepared job target nodes. 8. The system of claim 7, wherein the job target node performs further actions, including communicating the heartbeat message to at least the job control node. 9. The system of claim 7, wherein when the at least one job instruction is finished executing on each of the prepared job target nodes, recording a job status for each of the prepared job target nodes. 10. The system of claim 7, further comprising, determining each of the available job target nodes that is prepared to execute the at least one job instruction based on at least an acknowledgement from each of the available job target nodes that is prepared to execute. 11. The system of claim 7, wherein the at least one job instruction includes at least one search expression that is employed to determine the at least one of the plurality of managed nodes that is available to be managed as the job target node based on whether the at least one of the plurality of managed nodes has previously succeeded or failed to execute the at least one job instruction. 12. The system of claim 7, wherein executing the at least one job instruction, further comprises: segmenting the prepared job target nodes into portions; andexecuting the at least one job instruction on a first portion of the prepared job target nodes. 13. The system of claim 7, wherein determining the at least one available job target node, further comprises, searching among a plurality of managed nodes based on at least one entity group, wherein the at least one entity group includes at least one type of node. 14. A processor readable non-transitory storage media that includes instructions for managing a job over a network, wherein execution of the instructions by a processor device enables actions, comprising: communicating a heartbeat message between at least a job control node and at least one of a plurality managed nodes;employing at least one of the heartbeat message and at least one job instruction to a job control node to determine at least one of the plurality of managed nodes that is available to be managed as a job target node, wherein the at least one job instruction includes at least a quorum requirement;providing the at least one job instruction to at least one of the available job target nodes that is ready to be prepared to execute the at least one job instruction when a total number of the at least one available job target nodes is sufficient to perform the job, wherein the at least one job instruction on each prepared job target nodes is sequentially executed after determined time intervals;determining prepared job target nodes based on at least an acknowledgment that the at least one job instruction is delivered to and accepted by an available job target node and the available job target node is prepared to execute the job instruction; andwhen a number of the acknowledgments provided by the available job target nodes matches the quorum requirement, each of the prepared job target nodes being provided the at least one job instruction executes the at least one job instruction on each of the prepared job target nodes, wherein a status for success of the job is updated based on the execution of the at least one job instruction by at least one of the prepared job target nodes. 15. The media of claim 14, wherein when the at least one job instruction is finished executing on each of the prepared job target nodes, recording a job status for each of the prepared job target nodes. 16. The media of claim 14, further comprising, determining each of the available job target nodes that is prepared to execute the at least one job instruction based on at least an acknowledgement from each of the available job target nodes that is prepared to execute. 17. The media of claim 14, wherein the at least one job instruction includes at least one search expression that is employed to determine the at least one of the plurality of managed nodes that is available to be managed as the job target node based on whether the at least one of the plurality of managed nodes has previously succeeded or failed to execute the at least one job instruction. 18. The media of claim 14, wherein executing the at least one job instruction, further comprises: segmenting the prepared job target nodes into portions; andexecuting the at least one job instruction on a first portion of the prepared job target nodes. 19. The media of claim 14, wherein determining the at least one available job target node, further comprises, searching among a plurality of managed nodes based on at least one entity group, wherein the at least one entity group includes at least one type of node. 20. The media of claim 14, further comprises, staggering a delivery of the at least one job instruction to at least a portion of the prepared job target nodes by a determined time interval. 21. A network device that is operative for managing a job over a network, comprising: a transceiver that is operative to communicate over a network;a memory that is operative to store at least instructions; anda processor device that is operative to execute instructions that enable actions, including: communicating a heartbeat message between at least a job control node and at least one of a plurality managed nodes;employing at least one of the heartbeat message and at least one job instruction to a job control node to determine at least one of the plurality of managed nodes that is available to be managed as a job target node, wherein the at least one job instruction includes at least a quorum requirement;providing the at least one job instruction to at least one of the available job target nodes that is ready to be prepared to execute the at least one job instruction when a total number of the at least one available job target nodes is sufficient to perform the job, wherein the at least one job instruction on each prepared job target nodes is sequentially executed after determined time intervals;determining prepared job target nodes based on at least an acknowledgment that the at least one job instruction is delivered to and accepted by an available job target node and the available job target node is prepared to execute the job instruction; andwhen a number of the acknowledgments provided by the available job target nodes matches the quorum requirement, each of the prepared job target nodes being provided the at least one job instruction executes the at least one job instruction on each of the prepared job target nodes, wherein a status for success of the job is updated based on the execution of the at least one job instruction by at least one of the prepared job target nodes. 22. The network device of claim 21, wherein when the at least one job instruction is finished executing on each of the prepared job target nodes, recording a job status for each of the prepared job target nodes. 23. The network device of claim 21, further comprising, determining each of the available job target nodes that is prepared to execute the at least one job instruction based on at least an acknowledgement from each of the available job target nodes that is prepared to execute. 24. The network device of claim 21, further comprising, delaying the execution of the at least one job instruction until a quantity of prepared job target nodes exceeds a defined threshold. 25. The network device of claim 21, wherein the at least one job instruction includes at least one search expression that is employed to determine the at least one of the plurality of managed nodes that is available to be managed as the job target node based on whether the at least one of the plurality of managed nodes has previously succeeded or failed to execute the at least one job instruction. 26. The network device of claim 21, wherein executing the at least one job instruction, further comprises: segmenting the prepared job target nodes into portions; andexecuting the at least one job instruction on a first portion of the prepared job target nodes. 27. The network device of claim 21, further comprises, staggering a delivery of the at least one job instruction to at least a portion of the prepared job target nodes by a determined time interval.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (4)
Scheuermann, W. James; Hogenauer, Eugene B., Hardware task manager.
Kamenetsky, Mark L.; Kusumi, Timothy J.; Pang, Adeline; Pickett, Scott K.; Kumarasamy, Uthayakumar; Atemasov, Dolores Seraphina, Systems and methods for improved multisite management and reporting of converged communication systems and computer systems.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.