Patent EP0482815A2 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0482815A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Rate-based scheduling of multiplexed resources

Assignee: AT&T Inc
•
Filing: 1991-10-15
•
Granted: —
•
Expires: 2011-10-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention comprises method and apparatus for time-multiplexing a resource (MR) among entities which require access to the resource at a rate which is controlled over both an averaging interval and a jitter averaging interval which is shorter than the averaging interval. The technique employs a set of frame queues (117) of work descriptors (103) representing the work to be done by the resource for the entities. Each frame queue is associated with a frame of rime slots in which the resource performs work. A resource server (121) provides work descriptors from the head of a given frame queue for the frame associated with the frame queue and then serves the next frame queue for its frame. A queue manager (107) places work descriptors received from the entities at the tails of the frame queues. The work descriptors from a given one of the entities are placed in the frame queues in such fashion that when the resource server takes work descriptors from the heads of the frame queues, it automatically provides the work descriptors for a given entity to the resource at the required controlled rate. The resource server may serve one or more best effort queues (115) in addition to the frame queues. The work descriptors (103) in the best effort queues represent work for entities which do not required a controlled rate of access. The resource server serves a best effort queue when a frame queue is empty but there are time slots remaining in its frame.

Inventors

  • 👤 Hemant R. Kanakia

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-05 23:01
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881; G06F9/4887; G06F9/50; H; H04; H04J; H04J3/00; H04J3/16; H04J3/1605; H04J3/1623; H04J3/1629

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 138 words
Apparatus for time multiplexing a resource for intervals of time among pieces of work provided by one or more entities, the apparatus characterized by: one or more sets of work descriptors (117) describing the provided pieces of work; a server (121) for providing any work descriptors in the sets thereof from each of the sets thereof to the resource, the work descriptors being provided in an ordered fashion for a set of the intervals of time; and means (107) for receiving the work descriptors and placing the work descriptors for pieces of work provided by a given one of the entities in the sets thereof such that the ordered provision of the work descriptors by the server causes the resource to do the pieces of work provided by the given one of the entities at a controlled rate.
Claim 2
Dependent Claim 58 words
The apparatus set forth in claim 1 further characterized in that: the means for receiving the work descriptors places the work descriptors for the given one of the entities in the sets of work descriptors such that the density of the work descriptors for the given one of the entities in the sets of work descriptors is controlled.
Claim 3
Dependent Claim 72 words
The apparatus set forth in claim 2 further characterized in that: the density is controlled by limiting the number of the work descriptors for the given entity in a given one of the sets of work descriptors and by separating sets of work descriptors which may contain work descriptors for the given entity by a fixed number of sets of work descriptors which may not contain work descriptors for the given entity.
Claim 4
Dependent Claim 54 words
The apparatus set forth in claim 1 futher characterized by: a best effort set of work descriptors (115); and the server provides any work descriptors from the best effort set to the resource during the set of intervals of time whenever the server is not providing work descriptors from the sets of work descriptors.
Claim 5
Dependent Claim 51 words
The apparatus set forth in claim 1 futher characterized in that: the set of intervals of time is subdivided into subsets thereof; and the server provides any work descriptors from a given one of the sets of work descriptors during a given one of the subsets of the intervals of time.
Claim 6
Independent Claim 125 words
A method for time multiplexing a resource for intervals of time among pieces of work provided by one or more entities, the method characterized by the steps of: placing work descriptors describing provided pieces of work for a given one of the entities in one or more sets of work descriptors in a first ordered fashion; and providing any work descriptors in the sets of work descriptors to the resource in a second ordered fashion during a set of the intervals of time, the first ordered fashion being such that the provision of the work descriptors in the second ordered fashion to the resource causes the resource to do the pieces of work provided by the given one of the entities at a controlled rate.
Claim 7
Dependent Claim 37 words
The method set forth in claim 6 futher characterized in that: the step of placing work descriptors controls the density of the work descriptors for the given one of the entities in the sets of work descriptors.
Claim 8
Dependent Claim 79 words
The method set forth in claim 6 futher characterized in that: The step of placing work descriptors in the sets of work descriptors includes the steps of placing no more than a maximum number of work descriptors for the given entity in a given one of the sets of work descriptors and skipping a fixed number of the sets of work descriptors before again placing work descriptors for the given entity in one of the sets of work descriptors.
Claim 9
Dependent Claim 78 words
The method set forth in claim 6 further characterized by the step of: placing any work descriptors for entities which do not require a controlled rate in a best effort set of work descriptors; and the step of providing any work descriptors from the sets of work descriptors includes the step of providing any work descriptors from the best effort set of work descriptors whenever the server is not providing work descriptors from the sets of work descriptors.
Claim 10
Dependent Claim 52 words
The method set forth in claim 6 futher characterized in that: the step of providing any work descriptors from the sets of work descriptors includes the step of, for each set of work descriptors, providing any work descriptors therein to the resource in a subset of the set of intervals of time.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag