Computing node job assignment using multiple schedulers

A computing node, comprising:

• one or more memories;
• and
• one or more processors, communicatively coupled to the one or more memories, configured to:
• receive, from a set of computing nodes including the computing node, a corresponding set of heartbeat messages,
• wherein the set of heartbeat messages is related to selecting, among the set of computing nodes, a leader computing node to process one or more jobs for the set of computing nodes, and
• wherein the set of heartbeat messages indicates, for corresponding computing nodes of the set of computing nodes, state information related to processing capabilities of the corresponding computing nodes;
• determine, based on the set of heartbeat messages, a set of scores representing how qualified each computing node is to process the one or more jobs based on the processing capabilities of the corresponding computing nodes and one or more processing constraints associated with the one or more jobs;
• determine, based on the set of scores, whether the computing node is to be selected as the leader computing node based on:
• whether the computing node is most qualified to process the one or more jobs as compared to other computing nodes included in the set of computing nodes, and
• whether the one or more jobs are being processed by any other computing node included in the set of computing nodes;
• and
• select the computing node as the leader computing node;
• and
• selectively process the one or more jobs for the set of computing nodes based on selecting the computing node as the leader computing node.

A non-transitory computer-readable medium storing instructions, the instructions comprising:

• one or more instructions that, when executed by one or more processors of a computing node, cause the one or more processors to:
• receive, from a set of computing nodes including the computing node, a corresponding set of heartbeat messages,
• wherein the set of heartbeat messages is related to selecting, among the set of computing nodes, a leader computing node to process one or more jobs for the set of computing nodes, and
• wherein the set of heartbeat messages indicates, for each corresponding computing node of the set of computing nodes:
• a unique identifier that distinguishes the corresponding computing node from all other computing nodes included in the set of computing nodes, and
• state information related to processing capabilities of the corresponding computing node;
• determine, based on the set of heartbeat messages, a set of scores representing how qualified each computing node is to process the one or more jobs based on the processing capabilities of the corresponding computing node and one or more processing constraints associated with the one or more jobs;
• determine, based on the set of scores, whether the computing node is to be selected as the leader computing node based on whether a unique identifier associated with the computing node corresponds to the unique identifier in one of the set of heartbeat messages associated with a highest score in the set of scores;
• select the computing node as the leader computing node;
• and
• selectively process the one or more jobs based on selecting the computing node as the leader computing node.