Invention Grant
- Patent Title: Data queue having an unlimited depth
- Patent Title (中): 数据队列具有无限深度
-
Application No.: US14309680Application Date: 2014-06-19
-
Publication No.: US09594506B2Publication Date: 2017-03-14
- Inventor: Gilles Pelissier , Jean-Philippe Cousin , Badr Bentaybi
- Applicant: STMicroelectronics (Grenoble 2) SAS
- Applicant Address: FR Grenoble
- Assignee: STMICROELECTRONICS (GRENOBLE 2) SAS
- Current Assignee: STMICROELECTRONICS (GRENOBLE 2) SAS
- Current Assignee Address: FR Grenoble
- Agency: Seed IP Law Group LLP
- Priority: FR1355903 20130621
- Main IPC: G06F12/00
- IPC: G06F12/00 ; G06F3/06 ; G06F9/54

Abstract:
A method for transferring messages from a producer element to a consumer element uses a memory shared between the producer element and the consumer element, and a hardware queue including several registers designed to contain addresses of the shared memory. The method includes the steps of storing each message for the consumer element in the shared memory in the form of a node of a linked list, including a pointer to a next node in the list, the pointer being initially void, writing successively the address of each node in a free slot of the queue, whereby the node identified by each slot of the queue is the first node of a linked list assigned to the slot, and when the queue is full, writing the address of the current node in memory, in the pointer of the last node of the linked list assigned to the last slot of the queue, whereby the current node is placed at the end of the linked list assigned to the last slot of the queue.
Public/Granted literature
- US20140379999A1 DATA QUEUE HAVING AN UNLIMITED DEPTH Public/Granted day:2014-12-25
Information query