Method and apparatus for storing data using a plurality of queues
US6792484B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | Jul 28, 2000 |
| Grant date | Sep 14, 2004 |
| Priority date | — |
| Expiry date | Apr 8, 2022 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F13/1673
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An apparatus for storing data of transactions includes a memory having a plurality of queues having locations where the data is stored, and shared memory. Each queue of the plurality of queues has a minimum threshold of the memory which the queue is guaranteed to have for use which no other queue of the plurality of queues can use, and a maximum threshold of the memory which the queue can use, when the maximum threshold is greater than the minimum threshold. The apparatus includes an admitting mechanism for admitting the data to the locations in the memory. The admitting mechanism having a first block of logic which is used to calculate the minimum threshold and the maximum threshold for each queue, and a single centralized block of logic to contain calculations for determining whether or not the shared memory can support a transaction. The first block of logic and the centralized block of logic independent of each other. The apparatus includes a managing mechanism for managing and identifying which locations the data is to be stored in the memory. The managing mechanism is connected to the memory. The apparatus includes a buffer for storing the data the admitting mechanism has adm…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.