Queueing Algorithm for Inter-Task Communications
Original Publication Date: 1987-Aug-01
Included in the Prior Art Database: 2005-Feb-01
A method is described to consolidate as much information as possible into one inter-task communicating processing package without corrupting or missing critical data. Traditional communication between concurrent tasks or processes typically takes either of two approaches. One is pass every piece of information to the other process through a first in/first out queue, and the other approach is to sum information into one buffer which is periodically cleared by the other process. Either of these traditional solutions does not always meet the requirements when interfacing to pointing device (mouse) hardware.