Integrated multidimensional sorter
First Claim
Patent Images
1. A method comprising:
- receiving an entry comprising a binary time stamp having at least four bits and a data value;
providing a first pointer memory structure, referenced using a first pointer address and having a head and a body, wherein the head comprises a bit map field comprising four bits and the body comprises four memory positions, each bit in the bit map field representing one of the four memory positions;
initializing the four bits of the head of the first pointer memory structure to a first state;
when storing a second pointer address in a first memory position of the four memory positions, changing a first bit of the four bits of the head of the first pointer memory structure to a second state;
when storing the second pointer address in a second memory position of the four memory positions, changing a second bit of the four bits of the head of the first pointer memory structure to the second state;
when storing the second pointer address in a third memory position of the four memory positions, changing a third bit of the four bits of the head of the first pointer memory structure to the second state; and
when storing the second pointer address in a fourth memory position of the four memory positions, changing a fourth bit of the four bits of the head of the first pointer memory structure to the second state,wherein an address added to a value in the bit map field will reference a memory position where the second pointer address is stored.
0 Assignments
0 Petitions
Accused Products
Abstract
A technique to implement an integrated multidimensional sorter is to store data such that it may be retrieved in a sorted fashion. Entries are stored into a memory according to time stamp value, and the time stamp value is divided into multiple portions. The memory is organized as a pointer memory. An integrated multidimensional sorter may be implemented using integrated circuit technology using one or more integrated circuits. These integrated circuits may be used in management of network traffic, and provides quality of service (QoS) control.
-
Citations
17 Claims
-
1. A method comprising:
-
receiving an entry comprising a binary time stamp having at least four bits and a data value; providing a first pointer memory structure, referenced using a first pointer address and having a head and a body, wherein the head comprises a bit map field comprising four bits and the body comprises four memory positions, each bit in the bit map field representing one of the four memory positions; initializing the four bits of the head of the first pointer memory structure to a first state; when storing a second pointer address in a first memory position of the four memory positions, changing a first bit of the four bits of the head of the first pointer memory structure to a second state; when storing the second pointer address in a second memory position of the four memory positions, changing a second bit of the four bits of the head of the first pointer memory structure to the second state; when storing the second pointer address in a third memory position of the four memory positions, changing a third bit of the four bits of the head of the first pointer memory structure to the second state; and when storing the second pointer address in a fourth memory position of the four memory positions, changing a fourth bit of the four bits of the head of the first pointer memory structure to the second state, wherein an address added to a value in the bit map field will reference a memory position where the second pointer address is stored. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method comprising:
-
receiving an entry comprising a binary time stamp having at least four bits and a data value; dividing the binary time stamp into at least a first portion and a second portion, wherein the first portion has n bits and the second portion has m bits, where n and m are integers; providing a first pointer memory structure, referenced using a first pointer address and having a head and a body, wherein the head comprises a bit map field comprising n bits and the body comprises n memory positions, each bit in the bit map field representing one of the n memory positions; storing a second pointer address at a memory position in the body of the first pointer memory structure corresponding to the first portion of the binary time stamp; and changing a bit in the bit map field of the head of the first pointer memory structure corresponding to the memory position in the body of the first pointer memory structure corresponding to the first portion of the binary time stamp. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16, 17)
-
Specification