10x Genomics, Inc.

Adam David Azarchs

Alexander Y Wong

David Luther Alan Stafford

Methods, computer readable media, and systems service a queue, comprising a plurality of jobs, by identifying nodes satisfying a hardware requirement for at least a subset of jobs in the queue. Each job indicates when it was submitted to the queue and one or more node resource requirements. A current availability score for each node class in a plurality of node classes is determined and nodes of a first node class in the plurality of node classes are reserved when a demand score for the class satisfies the current availability score for the first node class by a first threshold amount. Reserved nodes are permitted to draw jobs from the queue in accordance with satisfaction by such nodes of the node resource requirements of the jobs but are terminated, without completing the jobs, when the current availability score for their node class exceeds a second threshold amount.

Systems and methods for distributed resource management

Methods, nontransitory computer readable media, and systems are disclosed for servicing a job queue. Each job has node resource requirements. Composite job memory and processor requirements is determined from these requirements. Nodes that satisfy these requirements are identified by obtaining, for each class of a plurality of node classes: an availability score, a number of processers, and a memory capability. A request for nodes of a class is made when a demand score for the class satisfies the class availability score. An acknowledgement and updated availability score is received upon request acceptance. A declination is received upon request rejection. The submitting and receiving is performing multiple times, if needed, until each class has been considered for a request or sufficient acknowledgements are received to satisfy the composite requirements of the jobs. Each node in the cluster draws jobs from the queue subject to the collective requirements of the drawn jobs.

Methods, nontransitory computer readable media, and systems are disclosed for servicing a job queue. Each job has node resource requirements. Composite job memory and processor requirements is determined from these requirements. Nodes that satisfy these requirements are identified by obtaining, for each class of a plurality of node classes: an availability score, a number of processors, and a memory capability. A request for nodes of a class is made when a demand score for the class satisfies the class availability score. An acknowledgement and updated availability score is received upon request acceptance. A declination is received upon request rejection. The submitting and receiving is performing multiple times, if needed, until each class has been considered for a request or sufficient acknowledgements are received to satisfy the composite requirements of the jobs. Each node in the cluster draws jobs from the queue subject to the collective requirements of the drawn jobs.

Growing community of inventors

San Mateo, CA, United States of America

Adam David Azarchs