US5623634A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Resource allocation with parameter counter in multiple requester system
Assignee: Altera Corp
•
Filing: 1995-05-23
•
Granted: 1997-04-22
•
Expires: 2015-05-23
Abstract
Abstract A controller for a single port (typically FIFO) memory for a computer system allocates the flow of data from a single port dynamic RAM to several data requesters such as a graphics engine, a CPU, and a display screen. One parameter is assigned to the display screen and a second parameter is assigned to the other data requester. Then each memory cycle is assigned in duty cycle fashion to the data requesters associated with one or the other of the parameters. Thus, typically the screen display which requires large amounts of data will have a relatively large parameter value associated with it such as six, while the single parameter value associated with the graphic engine and CPU will have a lower value such as two. The screen display will in response access the memory for six memory cycles consecutively, while the graphics engine and CPU will access the memory for only two memory cycles. The FIFO associated with the screen display is thus kept relatively full so that the screen is refreshed at all times and no FIFO empty detection is thus needed. The memory controller includes a loadable counter for counting down the loaded parameter, and a state machine for loading in the values, decrementing the values held in the counter, and switching between the two parameters.
Inventors
- 👤 Jonathan Liu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 22:28
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/16; G06F13/18
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
167 words
An arbitration duty cycle method for controlling flow of data from a data source to at least first and second data requesters, the data source providing the data in cycles, each cycle having a particular duration, comprising the steps of: establishing first and second programmable parameters associated respectively with the first and second data requesters; allowing the data to flow from the data source to the first data requester only for a number of the cycles determined by the first programmable parameter; then subsequently allowing the data to flow from the source to the second data requester for a number of the cycles determined by the second programmable parameter; changing at least one of the first and second programmable parameters so that a memory associated with at least one of the data requesters is never empty; and wherein the flow of data is devoted to each of the first and second requesters in a duty cycle pattern in accordance with respectively the first and second programmable parameters.
Claim 2
Dependent Claim
167 words
An arbitration duty cycle method for controlling flow of data from a data source to at least first and second data requesters, the data source providing the data in cycles, each cycle having a particular duration, comprising the steps of: establishing first and second programmable parameters associated respectively with the first and second data requesters; allowing the data to flow from the data source to the first data requester only for a number of the cycles determined by the first programmable parameter; then subsequently allowing the data to flow from the source to the second data requester for a number of the cycles determined by the second programmable parameter; changing at least one of the first and second programmable parameters so that a memory associated with at least one of the data requesters is never empty; and wherein the flow of data is devoted to each of the first and second requesters in a duty cycle pattern in accordance with respectively the first and second programmable parameters.
Claim 3
Dependent Claim
16 words
The method of claim 1, wherein the data source is a single port random access memory.
Claim 4
Dependent Claim
19 words
The method of claim 1, wherein the first and second requesters accept the flow of data at differing rates.
Claim 5
Dependent Claim
16 words
The method of claim 1, wherein the first and second requesters operate asynchronously to one another.
Claim 6
Dependent Claim
24 words
The method of claim 1, further comprising the steps of: storing the first and second programmable parameters each in one of two programmable registers.
Claim 7
Dependent Claim
52 words
The method of claim 1, wherein the first data requester includes a single port memory, and further comprising the steps of: determining if the single port memory is full of data; and when the single port memory is determined to be full, directing the flow of data to the second data requester.
Claim 8
Dependent Claim
86 words
The method of claim 5, further comprising the steps of: loading one of the first and second programmable parameters from one of the two programmable registers into a counter, the loaded programmable parameter thereby becoming a counter value; decrementing the counter value at each cycle that the data flows to a data requester associated with the loaded one of the first and second programmable parameters; and when the counter value equals zero, loading the other one of the first and second programmable parameters into the counter.
Claim 9
Dependent Claim
32 words
The method of claim 1, wherein a number of cycles determined by each of the first and second programmable parameters is equal to one more than the first and second programmable parameters.
Claim 10
Dependent Claim
194 words
A memory arbitration duty cycle controller for a system having a memory and at least two data requesters connected by a bus to the memory, comprising: a loadable counter for holding a programmable parameter value, there being a programmable parameter value associated with each of the two data requesters; a memory state machine for loading a programmable parameter value associated with one of the two data requesters into the loadable counter, and decrementing the programmable parameter value in the loadable counter each cycle that a data requester associated with the loaded programmable parameter value accepts data from the memory; means for changing at least one of the programmable parameter values so that a memory associated with at least one of the data requesters is never empty; and, wherein the memory state machine loads into the loadable counter another of the programmable parameter values when the programmable parameter value in the loadable counter is decremented to zero, and wherein each data requester accepts data from the memory in a duty cycle pattern, a flow of data being devoted to each data requester by the duty cycle pattern in accordance respectively with the programmable parameter values.
Claim 11
Dependent Claim
194 words
A memory arbitration duty cycle controller for a system having a memory and at least two data requesters connected by a bus to the memory, comprising: a loadable counter for holding a programmable parameter value, there being a programmable parameter value associated with each of the two data requesters; a memory state machine for loading a programmable parameter value associated with one of the two data requesters into the loadable counter, and decrementing the programmable parameter value in the loadable counter each cycle that a data requester associated with the loaded programmable parameter value accepts data from the memory; means for changing at least one of the programmable parameter values so that a memory associated with at least one of the data requesters is never empty; and, wherein the memory state machine loads into the loadable counter another of the programmable parameter values when the programmable parameter value in the loadable counter is decremented to zero, and wherein each data requester accepts data from the memory in a duty cycle pattern, a flow of data being devoted to each data requester by the duty cycle pattern in accordance respectively with the programmable parameter values.
Claim 12
Dependent Claim
45 words
The controller of claim 9, wherein the memory state machine further comprises: means for determining if a first of the two data requesters can accept no more data, and in response thereto, directing data from the memory to the second of the two data requesters.
References Cited (Backward Citations)
US4422070A
Cited
US4558429A
Cited
US4811205A
Cited
US5042004A
Cited
US4800491A
Cited
US5301278A
Cited
US5249279A
Cited
US5157775A
Cited
US5218680A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-04-21 | 2000-10-21 | 2001-04-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-04-21 | 2004-10-21 | 2005-04-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-04-21 | 2008-10-21 | 2009-04-22 | $7700.00 | Window Closed / Lapsed |