ALLOCATING PROCESSING OF A JOB ON A COMPUTING NODE

The invention relates to allocating processing of a job on a computing node. A technique includes receiving a request to process a job on a cluster. The job includes a plurality of rankings, the cluster includes a plurality of nodes, and the plurality of rankings can be equally divided between a minimum subset of nodes of the plurality of nodes such that all processing cores and the minimum set of nodes correspond to the plurality of rankings. The technique includes scheduling processing of the job in response to the request. Scheduling of processing of the job includes assigning a plurality of ranked processing over a node set of the plurality of nodes having a number of nodes greater than the minimum subset of nodes. 本公开涉及在计算节点上分配对作业的处理。一种技术包括接收在集群上处理作业的请求。作业包括多个排名，集群包括多个节点，并且多个排名能够在多个节点的最小节点子集之间平均划分，使得所有处理核和最小节点集对应于多个排名。该技术包括响应于该请求来调度对作业的处理。对作业的处理的调度包括在多个节点的节点数量大于所述最小节点子集的节点集上分配对多个排名的处理。