Patents by Inventor Allan Feldman
Allan Feldman 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).
-
Publication number: 20210279114Abstract: A system monitors an event loop executing on a host and determines causes for delays in tasks of the event loop. The system may include circuitry that receives, from an agent of the host, event loop data defining suspend and resume times of the tasks of the event loop executing on the host. The circuitry determines, based on the event loop data, event loop analysis data defining execution times for each of the tasks. The circuitry determines, based on the event loop analysis data, a cause of a delay in a task of the event loop as resulting from at least one of (i) a task delay in execution of the task or (ii) a loop delay in execution of another task of the event loop.Type: ApplicationFiled: March 9, 2020Publication date: September 9, 2021Inventors: Allan Feldman, Loren Arthur, Robert Lewis
-
Patent number: 11113122Abstract: A system monitors an event loop executing on a host and determines causes for delays in tasks of the event loop. The system may include circuitry that receives, from an agent of the host, event loop data defining suspend and resume times of the tasks of the event loop executing on the host. The circuitry determines, based on the event loop data, event loop analysis data defining execution times for each of the tasks. The circuitry determines, based on the event loop analysis data, a cause of a delay in a task of the event loop as resulting from at least one of (i) a task delay in execution of the task or (ii) a loop delay in execution of another task of the event loop.Type: GrantFiled: March 9, 2020Date of Patent: September 7, 2021Assignee: New Relic, Inc.Inventors: Allan Feldman, Loren Arthur, Robert Lewis
-
Patent number: 9836078Abstract: In some embodiments, a tight loop mode is provided in which most, if not all of, the clock distribution circuitry may be bypassed during an initial frequency lock stage.Type: GrantFiled: July 15, 2016Date of Patent: December 5, 2017Assignee: Intel CorporationInventors: Allan Feldman, Nasser Kurd, Mark Neidengard, Vaughn Grossnickle, Praveen Mosalikanti
-
Publication number: 20160327974Abstract: In some embodiments, a tight loop mode is provided in which most, if not all of, the clock distribution circuitry may be bypassed during an initial frequency lock stage.Type: ApplicationFiled: July 15, 2016Publication date: November 10, 2016Inventors: Allan Feldman, Nasser Kurd, Mark Neidengard, Vaughn Grossnickle, Praveen Mosalikanti
-
Patent number: 9450589Abstract: In some embodiments, a tight loop mode is provided is which most, if not all of, the clock distribution circuitry may be bypassed during an initial frequency lock stage.Type: GrantFiled: June 28, 2013Date of Patent: September 20, 2016Assignee: Intel CorporationInventors: Allan Feldman, Nasser Kurd, Mark Neidengard, Vaughn Grossnickle, Praveen Mosalikanti
-
Publication number: 20150214959Abstract: In some embodiments, a tight loop mode is provided is which most, if not all of, the clock distribution circuitry may be bypassed during an initial frequency lock stage.Type: ApplicationFiled: June 28, 2013Publication date: July 30, 2015Inventors: Allan Feldman, Nasser Kurd, Mark Neidengard, Vaughn Grossnickle, Praveen Mosalikanti
-
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: 7216349Abstract: A method for triggering message queue applications, comprising performing a first trigger process, the first trigger process including: a first application evaluating a queue for a trigger message; the first application determining whether a second trigger process is already being performed for the queue; and the first application invoking a second application where the invoking is in response to the trigger message.Type: GrantFiled: June 5, 2002Date of Patent: May 8, 2007Assignee: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, Ric C. Hung, John M. Tarby
-
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: 7096335Abstract: A structure and method is provided for optimizing memory resources, by establishing a history file for recording data processing criterion. The history file is then recorded in a first memory. Information either stored in the first memory or scheduled to be stored in the first memory can then be selectively reallocated and stored in an alternate memory. All or portions of the reallocated information can then be restored back to the first memory subsequently, with reference to the history file.Type: GrantFiled: August 27, 2003Date of Patent: August 22, 2006Assignee: International Business Machines CorporationInventors: Shawfu F. Chen, Robert O. Dryfoos, Allan Feldman, John M. Tarby
-
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: 20050050291Abstract: A structure and method is provided for optimizing memory resources, by establishing a history file for recording data processing criterion. The history file is then recorded in a first memory. Information either stored in the first memory or scheduled to be stored in the first memory can then be selectively reallocated and stored in an alternate memory. All or portions of the reallocated information can then be restored back to the first memory subsequently, with reference to the history file.Type: ApplicationFiled: August 27, 2003Publication date: March 3, 2005Applicant: International Business Machines CorporationInventors: Shawfu Chen, Robert Dryfoos, Allan Feldman, John Tarby
-
Publication number: 20030229725Abstract: A method for triggering message queue applications, comprising performing a first trigger process, the first trigger process including: a first application evaluating a queue for a trigger message; the first application determining whether a second trigger process is already being performed for the queue; and the first application invoking a second application where the invoking is in response to the trigger message.Type: ApplicationFiled: June 5, 2002Publication date: December 11, 2003Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, Ric C. Hung, John M. Tarby
-
Patent number: 6625117Abstract: A method and apparatus for switching messages from a primary message channel to a secondary message channel in a message queuing system in which messages are placed in a first transmission queue of a local system for transmission to a remote system via a primary message channel. A local queue manager continuously checks to see whether a high water mark has been reached in the first transmission queue, indicating an apparent failure in the primary message channel. On determining such an apparent failure in the primary message channel, the queue manager determines whether the secondary message channel is associated with the first transmission queue. If so, the queue manager activates the secondary message channel to serve said first transmission queue. If, on the other hand, the secondary message channel is associated with another transmission queue, the queue manager transfers messages already in the first queue to the other queue and redirects any new messages intended for the first queue to the other queue.Type: GrantFiled: September 30, 1999Date of Patent: September 23, 2003Assignee: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Peter A. Lewis, Masashi E. Miyake, Wei-Yi Xiao
-
Publication number: 20030110232Abstract: A common shared queue is provided, which includes a plurality of local queues. Each local queue is resident on a storage medium coupled to a processor. The local queues are monitored, and when it is determined that a particular local queue is being inadequately serviced, then one or more messages are moved from that local queue to one or more other local queues of the common shared queue.Type: ApplicationFiled: December 11, 2001Publication date: June 12, 2003Applicant: International Business Machines CorporationInventors: Shawfu Chen, Robert O. Dryfoos, Allan Feldman, David Y. Hu, Masashi E. Miyake, Wei-Yi Xiao
-
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