-
公开(公告)号:GB2344917B
公开(公告)日:2003-04-02
申请号:GB9929392
申请日:1999-12-14
Applicant: IBM
Inventor: MORGAN SCOTT A , ROBERTS DAVID J , SWEARINGEN CRAIG A , TANNENBAUM ALAN R , TEMPLE ANTHONY C
-
公开(公告)号:DE69228040T2
公开(公告)日:1999-07-15
申请号:DE69228040
申请日:1992-10-16
Applicant: IBM
Inventor: TANNENBAUM ALAN R , ZETTS JOHN M , GRAY MICHAEL N , GRANADOS TERESA , MILLS WILLIAM A
Abstract: An efficient buffering mechanism for access and retrieval of stored high bandwidth data and sufficient storage is disclosed. In a typical operating system, a channel containing only a limited buffer between the input devices and the running applications is provided by the operating system. This invention provides a parallel channel of a higher bandwidth with a far superior buffering capability that complements that of the operating system. When an input event from an input device with a high bandwidth is received by the system, messages are sent to both the operating system channel and the high bandwidth channel in a compatible format for each channel. The message sent to the operating system channel generally contains only limited data which may have to be translated from the actual input data to be acceptable to the operating system. The message sent to the high bandwidth channel contains the full spectrum of data generated by the input device. The buffer in the operating system channel also has the property of discarding data if the application does not retrieve them quickly enough during periods of high CPU utilization. The buffer in the high bandwidth channel keeps all data for up to 1000 input events, or whatever is deemed sufficient for the computer system, regardless of CPU usage. In response to the interception of a translated event in the operating system queue for one of the applications in the system, the method of the present invention will check to see if there are any events in the high bandwidth buffer. If there are, the system dequeues all the events to send them to the intended application. Various flags are set if task preemption is detected by the system upon examination of the events in the high bandwidth queue. Further, certain events may be sent asynchronously to the high bandwidth channel alone from various input devices; the system is prompted by a false "mouse" message in the operating system queue to cause the system to examine the high bandwidth buffer for the true input event.
-
公开(公告)号:AT175283T
公开(公告)日:1999-01-15
申请号:AT92117701
申请日:1992-10-16
Applicant: IBM
Inventor: TANNENBAUM ALAN R , ZETTS JOHN M , GRAY MICHAEL N , GRANADOS TERESA , MILLS WILLIAM A
Abstract: An efficient buffering mechanism for access and retrieval of stored high bandwidth data and sufficient storage is disclosed. In a typical operating system, a channel containing only a limited buffer between the input devices and the running applications is provided by the operating system. This invention provides a parallel channel of a higher bandwidth with a far superior buffering capability that complements that of the operating system. When an input event from an input device with a high bandwidth is received by the system, messages are sent to both the operating system channel and the high bandwidth channel in a compatible format for each channel. The message sent to the operating system channel generally contains only limited data which may have to be translated from the actual input data to be acceptable to the operating system. The message sent to the high bandwidth channel contains the full spectrum of data generated by the input device. The buffer in the operating system channel also has the property of discarding data if the application does not retrieve them quickly enough during periods of high CPU utilization. The buffer in the high bandwidth channel keeps all data for up to 1000 input events, or whatever is deemed sufficient for the computer system, regardless of CPU usage. In response to the interception of a translated event in the operating system queue for one of the applications in the system, the method of the present invention will check to see if there are any events in the high bandwidth buffer. If there are, the system dequeues all the events to send them to the intended application. Various flags are set if task preemption is detected by the system upon examination of the events in the high bandwidth queue. Further, certain events may be sent asynchronously to the high bandwidth channel alone from various input devices; the system is prompted by a false "mouse" message in the operating system queue to cause the system to examine the high bandwidth buffer for the true input event.
-
公开(公告)号:SG45192A1
公开(公告)日:1998-01-16
申请号:SG1996001128
申请日:1992-10-16
Applicant: IBM
Inventor: TANNENBAUM ALAN R , ZETTS JOHN M , GRAY MICHAEL N , GRANADOS TERESA , MILLS WILLIAM A
Abstract: An efficient buffering mechanism for access and retrieval of stored high bandwidth data and sufficient storage is disclosed. In a typical operating system, a channel containing only a limited buffer between the input devices and the running applications is provided by the operating system. This invention provides a parallel channel of a higher bandwidth with a far superior buffering capability that complements that of the operating system. When an input event from an input device with a high bandwidth is received by the system, messages are sent to both the operating system channel and the high bandwidth channel in a compatible format for each channel. The message sent to the operating system channel generally contains only limited data which may have to be translated from the actual input data to be acceptable to the operating system. The message sent to the high bandwidth channel contains the full spectrum of data generated by the input device. The buffer in the operating system channel also has the property of discarding data if the application does not retrieve them quickly enough during periods of high CPU utilization. The buffer in the high bandwidth channel keeps all data for up to 1000 input events, or whatever is deemed sufficient for the computer system, regardless of CPU usage. In response to the interception of a translated event in the operating system queue for one of the applications in the system, the method of the present invention will check to see if there are any events in the high bandwidth buffer. If there are, the system dequeues all the events to send them to the intended application. Various flags are set if task preemption is detected by the system upon examination of the events in the high bandwidth queue. Further, certain events may be sent asynchronously to the high bandwidth channel alone from various input devices; the system is prompted by a false "mouse" message in the operating system queue to cause the system to examine the high bandwidth buffer for the true input event.
-
公开(公告)号:NZ244242A
公开(公告)日:1995-06-27
申请号:NZ24424292
申请日:1992-09-07
Applicant: IBM
Inventor: TANNENBAUM ALAN R , ZETTS JOHN M , GRAY MICHAEL N , GRANADOS TERESA , MILLS WILLIAM A
Abstract: An efficient buffering mechanism for access and retrieval of stored high bandwidth data and sufficient storage is disclosed. In a typical operating system, a channel containing only a limited buffer between the input devices and the running applications is provided by the operating system. This invention provides a parallel channel of a higher bandwidth with a far superior buffering capability that complements that of the operating system. When an input event from an input device with a high bandwidth is received by the system, messages are sent to both the operating system channel and the high bandwidth channel in a compatible format for each channel. The message sent to the operating system channel generally contains only limited data which may have to be translated from the actual input data to be acceptable to the operating system. The message sent to the high bandwidth channel contains the full spectrum of data generated by the input device. The buffer in the operating system channel also has the property of discarding data if the application does not retrieve them quickly enough during periods of high CPU utilization. The buffer in the high bandwidth channel keeps all data for up to 1000 input events, or whatever is deemed sufficient for the computer system, regardless of CPU usage. In response to the interception of a translated event in the operating system queue for one of the applications in the system, the method of the present invention will check to see if there are any events in the high bandwidth buffer. If there are, the system dequeues all the events to send them to the intended application. Various flags are set if task preemption is detected by the system upon examination of the events in the high bandwidth queue. Further, certain events may be sent asynchronously to the high bandwidth channel alone from various input devices; the system is prompted by a false "mouse" message in the operating system queue to cause the system to examine the high bandwidth buffer for the true input event.
-
16.
公开(公告)号:CA1251869A
公开(公告)日:1989-03-28
申请号:CA506754
申请日:1986-04-15
Applicant: IBM
Inventor: BRADLEY DAVID J , KONOPIK BRADLY J , REED MARTIN A , TANNENBAUM ALAN R , TURNER MICHAEL R
Abstract: SYSTEM FOR MANAGING A PLURALITY OF SHARED INTERRUPT HANDLERS IN A LINKED-LIST DATA STRUCTURE A system is disclosed for managing a plurality of interrupt handlers in a linked-list data structure, for servicing a plurality of input/output devices sharing a common interrupt line in a microcomputer. The system provides for an orderly method to link a newly loaded interrupt handler routine into a linked-list data structure consisting of previously loaded interrupt handler routines. The system further provides for an orderly method to share a common interrupt line among a plurality of input/output devices being serviced by the interrupt handlers. The system further provides for an orderly means to unlink a particular interrupt handler routine from the linked-list data structure when a corresponding input/output device is to be deactivated. The system finds special utility in a multitasking operating system environment where input/output devices can be deactivated in a different sequence from that in which they were originally activated.
-
-
-
-
-