Job scheduler for multi-tenant fairness

A computing device, comprising:

• a processor;
• and
• a computer-readable medium including instructions that, when executed by the processor, cause the processor to perform operations comprising:
• receiving a first message from a first message stream, the first message comprising a job request from a tenant and a tenant identifier;
• detecting a base number of units permissible to be processed for the tenant over a unit of time;
• detecting a processing speed of a downstream processor of an asynchronous pipeline;
• detecting a number of messages in a second message stream, the downstream processor configured to receive messages from the second message stream;
• determining a target throughput for the tenant based at least in part on a mathematical operation using the base number, the number of messages in the second message stream, and the processing speed on the downstream processor;
• determining a historical throughput for the tenant based at least in part on an average number of units processed over the unit of time;
• comparing the target throughput with the historical throughput to determine whether to process the job request;
• and
• scheduling the job request for processing based at least in part on the comparison, wherein scheduling the job request comprises:
• creating a second message comprising a job identifier, a job identifier index value, and an address of data to be used to process the job request;
• and
• transmitting the second message to a preprocessing processor using a third message stream.

A non-transitory computer-readable medium having stored thereon a sequence of instructions that, when executed by a processor, causes the processor to perform operations comprising:

• receiving a first message from a first message stream, the first message comprising a job request from a tenant and a tenant identifier;
• detecting a base number of units permissible to be processed for the tenant over a unit of time;
• detecting a processing speed of a downstream processor of an asynchronous pipeline;
• detecting a number of messages in a second message stream, the downstream processor configured to receive messages from the second message stream;
• determining a target throughput for the tenant based at least in part on a mathematical operation using the base number, the number of messages in the second message stream, and the processing speed on the downstream processor;
• determining a historical throughput for the tenant based at least in part on an average number of units processed over the unit of time;
• comparing the target throughput with the historical throughput to determine whether to process the job request;
• and
• scheduling the job request for processing based at least in part on the comparison, wherein scheduling the job request comprises:
• creating a second message comprising a job identifier, a job identifier index value, and an address of data to be used to process the job request;
• and
• transmitting the second message to a preprocessing processor using a third message stream.