公开(公告)号：JPH10254677A

公开(公告)日：1998-09-25

申请号：JP3480198

申请日：1998-02-17

Applicant: IBM

Inventor： SOELL WERNER ,  WENDEL DIETER ,  WERNICKE FRIEDRICH-CHRISTIAN

IPC: G06F5/06 ,  G06F5/10 ,  G06F7/74

Abstract: PROBLEM TO BE SOLVED: To inhibit a selected entry which has no priority by determining the priority of an entry in a cyclic buffer wherein an entry should meet given reference with respect to a cyclic buffer which includes a sequence of entries. SOLUTION: An in pointer 103 and an out pointer 104 are provided which allow the cyclic buffer 100 to operate as an FIFO buffer. When the cyclic buffer 110 is full, the in pointer 105 defines the head of a stored entry sequence. In contrast, the tail of the entry sequence is defined by the out pointer 106 which indicates the 1st occupied entry position which is the oldest entry position of the sequence of entry positions. An entry determined by the out pointer 106 is selected each time an entry of the FIFO which should exit from the FIFO is selected. Then the out pointer 106 id increased and a new unoccupied entry position becomes usable.

公开(公告)号：DE10118065A1

公开(公告)日：2001-10-25

申请号：DE10118065

申请日：2001-04-11

Applicant: IBM

Inventor： HALLER WILHELM E ,  LEENSTRA JENS ,  SAUTTER ROLF ,  WENDEL DIETER ,  WERNICKE FRIEDRICH-CHRISTIAN

IPC: G06F9/38 ,  G06F12/08

Abstract: The entry of data into a buffer memory (10) is made using three sets of status information (20,22,24) that are specific to processes. The status information is evaluated by combinational logic, an input pointer and an output pointer