US 2022/0091886 A1 · Queueing Techniques for a Shared Computer Resource

Abstract

A method and system for an enhanced weighted fair queuing technique for a resource are provided. A plurality of request streams is received at a requestor, each request stream including request messages from a process executing on the requestor. The request messages of each request stream are apportioned to an input queue associated with the request stream; each input queue has a weight. A virtual finish time is determined for each request message based, at least in part, on the weights of the input queues. A sequence of request messages is determined based, at least in part, on the virtual finish times of the request messages. The sequence of request messages is enqueued into an output queue. The sequence of request messages is sent to a resource, over a connection, which provides a service for each process.

Claims20

Dependent claims

A method, comprising:

at a requestor:
receiving a plurality of request streams, each request stream including request messages from a process executing on the requestor;
apportioning the request messages of each request stream to an input queue associated with the request stream, each input queue having a weight;
determining a virtual finish time for each request message based, at least in part, on the weights of the input queues;
determining a sequence of request messages based, at least in part, on the virtual finish times of the request messages;
enqueuing the sequence of request messages into an output queue;
and
sending, to a resource, the sequence of request messages over a connection,
where the resource provides a service for each process.

6 more elements

A system, comprising:

a resource, coupled to a connection, including a processor configured to provide a service;
and
a requestor, coupled to the connection, including a processor configured to:
receive a plurality of request streams, each request stream including request messages from a process executing on the requestor processor,
apportion the request messages of each request stream to an input queue associated with the request stream, each input queue having a weight,
determine a virtual finish time for each request message based, at least in part, on the weights of the input queues,
determine a sequence of request messages based, at least in part, on the virtual finish times of the request messages,
enqueue the sequence of request messages into an output queue, and
send, to the resource, the sequence of request messages over the connection,
where the service is provided for each process.

7 more elements

A non-transitory computer-readable medium storing instructions that, when executed by a processor of a requestor, cause the processor to:

receive a plurality of request streams, each request stream including request messages from a process executing on the processor;
apportion the request messages of each request stream to an input queue associated with the request stream, each input queue having a weight;
determine a virtual finish time for each request message based, at least in part, on the weights of the input queues;
determine a sequence of request messages based, at least in part, on the virtual finish times of the request messages;
enqueue the sequence of request messages into an output queue;
and
send, to a resource, the sequence of request messages over a connection,
where the resource provides a service for each process.

5 more elements

Dependencies are inferred from the claim text.

Queueing Techniques for a Shared Computer Resource

Life of this patent

Queueing Techniques for a Shared Computer Resource

Life of this patent

Abstract

Claims20