 Enqueue operations for multi-buffer packets |
| Referring to FIG. 1, a network system 10 for processing data packets includes a source 12 of data ... |
|
| Method for aging table entries in a table supporting multi-key searches |
| The invention is for use with a table containing a plurality of data entries, each of the data ... |
|
| Coherency coverage of data across multiple packets varying in sizes |
| The present invention overcomes the disadvantages of the prior art by providing a technique that ... |
|
| Scratchpad memory |
| According to one aspect, a integrated circuit includes a random-access memory (RAM) storage and a ... |
|
| Bus interface with a first-in-first-out memory |
| According to one aspect of the invention, a method is described of receiving bytes of data from a ... |
|
| Validating multiple execution plans for database queries |
| This description and the accompanying drawing illustrate specific examples of embodiments in which ... |
|
|
Method and apparatus for data buffer management in a communications switch
| Details |
Inventors: Janoska, Mark William; Heller, Albert D.; Pezeshki-Esfahani, Hossain;
Assignee: Alcatel Canada Inc. (Kanata, CA)
Primary Examiner: Chin; Wellington
Assistant Examiner: Ho; Chuong
Attorney, Agent or Firm:
A method and apparatus is for buffering data cells in a queuing element is presented. Each queuing element includes a partitioned buffer, where the partitioned buffer includes a plurality of partitions. Each of the partitions stores data cells received by the queuing element. Storage of the data cells into the partitions is accomplished by using an array of logical queues. Each logical queue of the array of logical queues maps data cells corresponding to that logical queue to a particular partition of the plurality of partitions. More than one logical queue may map data cells to a particular partition. Each partition may include a reserved portion, where each logical queue that maps to the partition may map a portion of its data cells to the reserved portion. The resources of the reserved portion to which a logical queue maps data cells are reserved to that specific logical queue and cannot be utilized by other logical queues. Each partition also includes a shared portion, where all of the logical queues that map to a partition are able to utilize the storage space included in the shared portion. Each logical queue includes a maximum size. Depth pointers corresponding to the logical queue and the partition are updated as data cells are enqueued to, and dequeued from, the logical queue. |
|
DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT OF THE INVENTION Generally, the present invention provides a method and apparatus for buffering data cells in a queuing element included in the output buffer of a data communication switch.
Each queuing element includes a partitioned buffer, where the partitioned buffer includes a plurality of partitions.
Each of the partitions stores data cells received by the queuing element.
Storage of the data cells into the partitions is accomplished by using an array of logical queues.
Each logical queue of the array of logical queues maps data cells corresponding to that logical queue to a particular partition of the plurality of partitions.
More than one logical queue may map data cells to a particular partition.
Each partition may include a reserved portion, where each logical queue that maps to the partition may map a portion of its data cells to the reserved portion.
The resources of the reserved portion to which a logical queue maps data cells are reserved to that specific logical queue and cannot be utilized by other logical queues.
Each partition also includes a shared portion, where all of the logical queues that map to a partition are able to utilize the storage space included in the shared portion.
Each logical queue includes a maximum size.
When the queuing element receives a data cell, it determines to which logical queue the data cell corresponds.
This determination is based on information included in the data cell.
The logical queue is then examined to determine whether or not there is adequate space within the logical queue for the received data cell.
If so, the partition to which the logical queue maps is examined to insure that there is space available within the partition.
If space is available, the data cell is enqueued in the logical queue such that it is stored within the partition.
Depth pointers corresponding to the logical queue and the partition are then updated to indicate that another data cell has been enqueued.
When data is fetched from, or dequeued, from the logical queue, these pointers are updated to reflect the removal of the data cell
|
| Related patents |
|
|
Handling contiguous memory references in a multi-queue system
What is claimed is: 1. A controller for a random access memory comprises: control logic, including an arbiter that detects a status of outstanding memory references to ...
|
|
|
Communication between processors
Referring to FIG. 1, a computer system 26 includes two processors 1, 2. Each processor 1, 2 has a corresponding static random access memory (SRAM) 21, 22 for storing ...
|
|
|
Optimizations to receive packet status from fifo bus
According to one aspect of the invention, a method is described of receiving bytes of data from a media device includes issuing N consecutive requests, each for M bytes, ...
|
|
|
Storing frame modification information in a bank in memory
The present invention comprises a method and system for reserving frame modification information in a data storage unit. In one embodiment, a system comprises a ...
|
|
|
Scratchpad memory
According to one aspect, a integrated circuit includes a random-access memory (RAM) storage and a controller both located on the same semiconductor chip. The controller ...
|
|
|
Read lock miss control and queue management
According to one aspect of the invention, a method is described of managing memory access to random access memory includes fetching a read lock memory reference request ...
|
|
|
Architecture for high speed class of service enabled linecard
Introduction The present invention is a linecard architecture that provides packet routing with very low latency. Portions of the linecard operate at line rate, also ...
|
|
|
Approximated per-flow rate limiting
Overview The present Application discloses a rate limit scheme, using actual flow data rate requirements rather than type/class of service identifiers, that adapts to ...
|
|
|
Network switch having system for automatically detecting change in network node connection
What is claimed is: 1. A multiport data communication system for transferring data packets between ports, the data communication system comprising: a plurality of ...
|
|
|
Method and apparatus for reordering packet data units in storage queues for reading and writing memory
The invention is directed to a method and system for reordering data units that are to be written to, or read from, selected locations in a memory. The data units are re-...
|
|
|
File Sharing 
