Patents by Inventor Jason A. Keenaghan
Jason A. Keenaghan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8312470Abstract: A process thread locking operations includes defining a lock structure having data fields that include a process thread identifier and a shared object identifier that uniquely identifies a shared object subject to lock operations and using the lock structure to build a lock table. The lock table includes lock structures for each process thread in the process and is searchable in response to a request for a shared object from a calling thread. The method also includes determining a lock status of the shared object. The lock status indicates whether the shared object is currently locked by the calling process thread. In response to the lock status, the method includes obtaining a lock on the shared object when the request is for a lock, and releasing a lock on the shared object when the request is to unlock the shared object.Type: GrantFiled: December 22, 2009Date of Patent: November 13, 2012Assignee: International Business Machines CorporationInventors: Lisa D. Banks, Jason A. Keenaghan
-
Publication number: 20110154368Abstract: A method for implementing process thread locking operations includes defining a lock structure having data fields that include a process thread identifier and a shared object identifier that uniquely identifies a shared object subject to lock operations. The method also includes using the lock structure to build a lock table. The lock table includes lock structures for each process thread in the process and is searchable in response to a request for a shared object from a calling thread. The method also includes determining a lock status of the shared object. The lock status indicates whether the shared object is currently locked by the calling process thread.Type: ApplicationFiled: December 22, 2009Publication date: June 23, 2011Applicant: International Business Machines CorporationInventors: Lisa D. Banks, Jason A. Keenaghan
-
Patent number: 7577956Abstract: A plurality of batch lists are maintained by a channel in order to improve the efficiency of the channel in performing messaging between a sender and a receiver. For example, a Next Batch list is used to prefetch messages to be sent to the receiver from the sender; a Current Batch list includes the messages currently being transmitted to the receiver or waiting confirmation; and an Acknowledged Batch List includes the messages confirmed by the receiver. This allows the functions of prefetching messages, sending messages and deleting confirmed messages to be performed in parallel.Type: GrantFiled: July 14, 2006Date of Patent: August 18, 2009Assignee: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Jason A. Keenaghan, Peter A. Lewis, Peter G. Sutton, Alice M. Williams-Obleton, Mei-Hui Wang
-
Patent number: 7552305Abstract: Dynamically allocated memory is managed in real-time. This real-time management capability enables an invalid access of the dynamically allocated memory to be detected at the time the invalid access occurs, rather than at some later point in time. This real-time management capability can be dynamically activated/deactivated on a per process basis.Type: GrantFiled: October 25, 2005Date of Patent: June 23, 2009Assignee: International Business Machines CorporationInventors: Robert O. Dryfoos, Jason A. Keenaghan, Michael J. Shershin, III, Kenneth H. Warner
-
Publication number: 20070094473Abstract: Dynamically allocated memory is managed in real-time. This real-time management capability enables an invalid access of the dynamically allocated memory to be detected at the time the invalid access occurs, rather than at some later point in time. This real-time management capability can be dynamically activated/deactivated on a per process basis.Type: ApplicationFiled: October 25, 2005Publication date: April 26, 2007Applicant: International Business Machines CorporationInventors: Robert Dryfoos, Jason Keenaghan, Michael Shershin, Kenneth Warner
-
Publication number: 20070016912Abstract: A plurality of batch lists are maintained by a channel in order to improve the efficiency of the channel in performing messaging between a sender and a receiver. For example, a Next Batch list is used to prefetch messages to be sent to the receiver from the sender; a Current Batch list includes the messages currently being transmitted to the receiver or waiting confirmation; and an Acknowledged Batch List includes the messages confirmed by the receiver. This allows the functions of prefetching messages, sending messages and deleting confirmed messages to be performed in parallel.Type: ApplicationFiled: July 14, 2006Publication date: January 18, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shawfu Chen, Robert Dryfoos, Allan Feldman, David Hu, Jason Keenaghan, Peter Lewis, Peter Sutton, Alice Williams-Obleton, Mei-Hui Wang
-
Patent number: 7140017Abstract: A plurality of batch lists are maintained by a channel in order to improve the efficiency of the channel in performing messaging between a sender and a receiver. For example, a Next Batch list is used to prefetch messages to be sent to the receiver from the sender; a Current Batch list includes the messages currently being transmitted to the receiver or waiting confirmation; and an Acknowledged Batch List includes the messages confirmed by the receiver. This allows the functions of prefetching messages, sending messages and deleting confirmed messages to be performed in parallel.Type: GrantFiled: February 22, 2001Date of Patent: November 21, 2006Assignee: International Business Machines CorporationInventors: Shawfu Chen, Robert O Dryfoos, Allan Feldman, David Y Hu, Jason A Keenaghan, Peter A Lewis, Peter G Sutton, Alice M Williams-Obleton, Mei-Hui Wang
-
Patent number: 7089564Abstract: A highly available, high-performance memory queue. Locking of the queue is minimized in order to provide a highly available queue and to improve performance of the queue. Multiple updates of the queue can occur under a single lock. Further, messages of the queue are persistent. A time-initiated checkpointing process, as well as the storing of message information on a recovery log, ensures the persistence of the queue messages.Type: GrantFiled: February 22, 2001Date of Patent: August 8, 2006Assignee: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Jason A. Keenaghan, Peter G. Sutton, Mei-Hui Wang
-
Patent number: 7068604Abstract: Memory resident queues are monitored at predefined time intervals. When the monitoring indicates that a particular queue is not being serviced at a desired level, then action is taken to sweep one or more messages from the queue. The sweeping of the messages frees up system resources associated with the messages, thus allowing other tasks to be serviced. If, after the sweeping, it is determined that the queue can handle additional messages, then one or more messages are placed back on the queue.Type: GrantFiled: August 23, 2001Date of Patent: June 27, 2006Assignee: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Jason A. Keenaghan, Peter A. Lewis, Peter G. Sutton, Mei-Hui Wang, Alice M. Williams-Obleton
-
Patent number: 6901533Abstract: When a processor becomes inactive, queues resident in the memory of that processor become inaccessible. Thus, in order to access those queues, an active processor takes over ownership of one or more of the inaccessible queues. Each queue may be rebuilt prior to its take over to ensure that it has up-to-date information.Type: GrantFiled: August 23, 2001Date of Patent: May 31, 2005Assignee: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Jason A. Keenaghan, Peter A. Lewis, Peter G. Sutton, Mei-Hui Wang
-
Publication number: 20030041285Abstract: When a processor becomes inactive, queues resident in the memory of that processor become inaccessible. Thus, in order to access those queues, an active processor takes over ownership of one or more of the inaccessible queues. Each queue may be rebuilt prior to its take over to ensure that it has up-to-date information.Type: ApplicationFiled: August 23, 2001Publication date: February 27, 2003Applicant: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Jason A Keenaghan, Peter A. Lewis, Peter G. Sutton, Mei-Hui Wang
-
Publication number: 20030041115Abstract: Memory resident queues are monitored at predefined time intervals. When the monitoring indicates that a particular queue is not being serviced at a desired level, then action is taken to sweep one or more messages from the queue. The sweeping of the messages frees up system resources associated with the messages, thus allowing other tasks to be serviced. If, after the sweeping, it is determined that the queue can handle additional messages, then one or more messages are placed back on the queue.Type: ApplicationFiled: August 23, 2001Publication date: February 27, 2003Applicant: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Jason A. Keenaghan, Peter A. Lewis, Peter G. Sutton, Mei-Hui Wang, Alice M. Williams-Obleton
-
Publication number: 20020116538Abstract: A highly available, high-performance memory queue. Locking of the queue is minimized in order to provide a highly available queue and to improve performance of the queue. Multiple updates of the queue can occur under a single lock. Further, messages of the queue are persistent. A time-initiated checkpointing process, as well as the storing of message information on a recovery log, ensures the persistence of the queue messages.Type: ApplicationFiled: February 22, 2001Publication date: August 22, 2002Applicant: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Jason A. Keenaghan, Peter G. Sutton, Mei-Hui Wang
-
Publication number: 20020116435Abstract: A plurality of batch lists are maintained by a channel in order to improve the efficiency of the channel in performing messaging between a sender and a receiver. For example, a Next Batch list is used to prefetch messages to be sent to the receiver from the sender; a Current Batch list includes the messages currently being transmitted to the receiver or waiting confirmation; and an Acknowledged Batch List includes the messages confirmed by the receiver. This allows the functions of prefetching messages, sending messages and deleting confirmed messages to be performed in parallel.Type: ApplicationFiled: February 22, 2001Publication date: August 22, 2002Applicant: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Jason A. Keenaghan, Peter A. Lewis, Peter G. Sutton, Alice M. Williams-Obleton, Mei-Hui Wang