×

Fairly partitioning resources while limiting the maximum fair share

  • US 6,909,691 B1
  • Filed: 08/07/2000
  • Issued: 06/21/2005
  • Est. Priority Date: 08/07/2000
  • Status: Expired due to Term
First Claim
Patent Images

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.

View all claims
  • 5 Assignments
Timeline View
Assignment View
    ×
    ×