Method of managing a device for memorizing data organized in a queue, and associated device

• US 20050154843A1
• Filed: 12/09/2004
• Published: 07/14/2005
• Est. Priority Date: 12/09/2003
• Status: Abandoned Application

• Current Assignee: Qualcomm Technologies Incorporated (Qualcomm, Inc.)
• Original Assignee: Qualcomm Technologies Incorporated (Qualcomm, Inc.)
• Inventors: Boucard, Philippe, Douady, Cesar
• Application Number:
  US11/008,410
• Publication Number:
  US 20050154843A1
• Time in Patent Office: Days
• US Class Current: 711/154
• CPC Class Codes: G06F 2205/065 With bypass possibility
• CPC Class Codes: G06F 5/06 for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor G06F7/78 takes precedence
• CPC Class Codes: G06F 5/14 for overflow or underflow handling, e.g. full or empty flags
• CPC Class Codes: H04L 47/50 Queue scheduling
• CPC Class Codes: H04L 47/6205 Arrangements for avoiding head of line blocking

Abstract

Method of managing a device for memorizing data organized in a queue, in which, when the queue is empty of data and receives a data read request, the read request is memorized in the queue, instead of the data usually present when the queue is not empty of data, transforming the data queue into a read request queue.

Claims

1. Method of managing a device for memorizing data organized in a queue, wherein, when the said queue is empty of data and the said memorization device receives a data read request, the method comprises memorizing the read request in the queue, instead of the data usually present when the queue is not empty of data, transforming the data queue into a read request queue.

2. Method according to claim 1, wherein, when the queue comprises at least one read request, the receipt of a new read request causes the new read request to be memorized in the read request queue.

3. Method according to claim 1, wherein, when the queue comprises at least one read request, received data is directly transmitted to the agents that have sent the read requests, and the expected quantity of data comprised in the read requests is updated.

4. Method according to claim 1, wherein, when the queue comprises at least one read request, the receipt of a quantity of data smaller than the quantity of data requested by the first read request of the read request queue causes the data to be stored in an auxiliary memorization means, awaiting a later arrival of data to be memorized in the auxiliary memorization means until the quantity of data stored in the auxiliary memorization means is greater than or equal to the quantity of data required by the first read request of the read request queue.

5. Method according to claim 1, wherein, when the queue comprises at least one read request and the first read request of the said request queue is satisfied, the first read request is deleted from the read request queue.

6. Method according to claim 5, wherein, when the read request queue becomes empty of requests and data are received, the data is stored in the empty read request queue which becomes a data queue.

7. Device for memorizing data organized in a queue, wherein the device comprises a management means which, when the queue is empty of data and the device receives a read request, is capable of memorizing the read request in the queue, transforming the queue into a read request queue.

8. Device according to claim 7, wherein the management means is capable of memorizing a newly received read request in the read request queue, when the queue comprises at least one read request.

9. Device according to claim 7, wherein the queue comprises at least one read request, and wherein the management means is capable of transmitting received data directly to the agent that has sent the read request of the queue and of updating the required quantity of data included in the read request.

10. Device according to claim 7, wherein the queue comprises at least one read request, and wherein the device comprises an auxiliary memorization means capable of storing a quantity of received data smaller than the quantity of data required by the read request of the queue.

11. Device according to claim 7, wherein the management means is capable of deleting the read request from the read request queue when the read request of the read request queue is satisfied.