Algorithm to Efficiently Manage Two Asynchronous Input Queues
Original Publication Date: 1986-Feb-01
Included in the Prior Art Database: 2005-Mar-08
An efficient two-queue management technique takes advantage of the inter-dependency of two asynchronous input queues to avoid the path length overhead which would result if the two input queues were combined into one. A wait time, T, is provided to a first queue based on worst-case timing for required events from a second queue to occur. In Fig. 1, a Task 1 has a primary queue Q1 which is used to handle transmit request (XRQ), transmit response (XRP) and receive (RCV) commands from a higher level Task 0. A secondary queue Q2 is used by Task 1 to receive request indications (IND) or response confirmations (CONF) from lower level tasks - Task 2, Task K or Task M. Task 2 communicates with a Task 3, etc., until the lowest level of Task N.