IP Library Granted Patent US 6,909,691
Granted Patent B1
US 6,909,691 · App. 09/633,575 · Granted Jun 21, 2005

Fairly partitioning resources while limiting the maximum fair share

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 6,909,691
App. No.
09/633,575
Granted
Jun 21, 2005
Kind
B1
Abstract

Resource requests from a plurality of schedulable entities are scheduled while limiting the maximum and minimum quality of service allocated to each schedulable entity. The resource scheduler of the present invention requires less memory maintain state information than existing rate-controlling schedulers, and is thus more easily scalable to large numbers of users. The resource scheduler also schedules resources fairly among competing schedulable entities. A fair-share scheduling algorithm is used by a resource scheduler to select resource requests to service. A rate controller checks to ensure that servicing the selected request will not cause the associated user's maximum quality of service to be exceeded. If the maximum quality of service will not be exceeded, the virtual time used in the scheduling algorithm is incremented, and the request is serviced. If the maximum quality of service will be exceeded, the virtual time is still incremented, but the request is not serviced and remains pending.

Claims (8)

1. A method for scheduling resource requests from a plurality of schedulable entities, wherein each resource request includes a requested duration and each schedulable entity has a maximum resource allocation, the maximum resource allocation being specified as a maximum quality of service guarantee, the method comprising:

assigning a start number tag to a each resource request using a start-time fair queuing algorithm with virtual time scheduling;

selecting a resource request with the smallest start number tag, the selected resource request having an associated schedulable entity;

limiting the requested duration of the selected resource request to a pre-determined duration upper bound;

servicing the selected resource request if servicing the selected resource request will not exceed the associated schedulable entity's maximum quality of service guarantee; and

advancing a virtual time value.

2. The method of claim 1 , further including updating the start number tag for a resource request associated with the schedulable entity that made the selected resource request is not serviced.

3. The method of claim 1 , further including leaving the selected resource request pending if servicing the selected resource request will exceed the schedulable entity's maximum quality of service guarantee.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 4, 2022
From: INTELLECTUAL VENTURES ASSETS 177 LLC
To: SERVSTOR TECHNOLOGIES, LLC
Reel/Frame 058537/0356 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 24, 2021
From: CUFER ASSET LTD. L.L.C.
To: INTELLECTUAL VENTURES ASSETS 177 LLC
Reel/Frame 057273/0969 →
MERGER Recorded Nov 23, 2015
From: DIGITAL ASSET ENTERPRISES, L.L.C.
To: CUFER ASSET LTD. L.L.C.
Reel/Frame 037118/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2007
From: ENSIM CORPORATION
To: DIGITAL ASSET ENTERPRISES, L.L.C.
Reel/Frame 019580/0145 →