Patents by Inventor Francis N. Parr

Francis N. Parr 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: 9916347
    Abstract: A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.
    Type: Grant
    Filed: December 29, 2014
    Date of Patent: March 13, 2018
    Assignee: International Business Machines Corporation
    Inventors: Dakshi Agrawal, Rashed Z. Bhatti, Francis N. Parr
  • Patent number: 9910889
    Abstract: A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.
    Type: Grant
    Filed: June 22, 2015
    Date of Patent: March 6, 2018
    Assignee: International Business Machines Corporation
    Inventors: Dakshi Agrawal, Rashed Z. Bhatti, Francis N. Parr
  • Publication number: 20170329821
    Abstract: A method for multicategory classification of streaming data records includes receiving a list of signature rules, each comprising a Boolean expression of a set of atomic recognizers (ARs) of one or more input fields of an input record and an assignment of a signature if the Boolean expression evaluates to TRUE, generating a list of all signature contexts from the list of signature rules, generating a context lookup table for each context, and processing a stream of input records on which signature detection is performed by using said ARs, said list of signature contexts, and said context lookup table for each context, wherein each input record in the stream of input records is classified into one of a plurality of categories based on the signature detection result, wherein an amount of processing grows sublinearly with a number of signature rules being processed.
    Type: Application
    Filed: May 12, 2016
    Publication date: November 16, 2017
    Inventors: DAKSHI AGRAWAL, RASHED Z. BHATTI, FRANCIS N. PARR
  • Publication number: 20160188664
    Abstract: A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.
    Type: Application
    Filed: December 29, 2014
    Publication date: June 30, 2016
    Inventors: Dakshi Agrawal, Rashed Z. Bhatti, Francis N. Parr
  • Publication number: 20160188751
    Abstract: A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.
    Type: Application
    Filed: June 22, 2015
    Publication date: June 30, 2016
    Inventors: Dakshi Agrawal, Rashed Z. Bhatti, Francis N. Parr
  • Publication number: 20160124857
    Abstract: In a method for improving performance of a database, create, in a memory, an instance of a segment of data corresponding to a segment of data in a database on a persistent file system. The segment of data in the database on the persistent file system is expected to experience a high plurality of reads and writes during a certain time period. Receive a request to modify the segment of data in the database on the persistent file system. Modify the instance of the segment of data in the memory.
    Type: Application
    Filed: November 5, 2014
    Publication date: May 5, 2016
    Inventor: Francis N. Parr
  • Publication number: 20140122320
    Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.
    Type: Application
    Filed: January 8, 2014
    Publication date: May 1, 2014
    Applicant: International Business Machines Corporation
    Inventors: Paul M. Dantzig, Arun K. Iyengar, Francis N. Parr, Gong Su
  • Publication number: 20140123155
    Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.
    Type: Application
    Filed: January 8, 2014
    Publication date: May 1, 2014
    Applicant: International Business Machines Corporation
    Inventors: Paul M. Dantzig, Arun K. Iyengar, Francis N. Parr, Gong Su
  • Patent number: 8423619
    Abstract: Message brokering in a consuming broker device of a publish-subscribe system having at least one processor includes: designating in the consuming broker device a first producing broker device as a sole provider of messages having a topic to which the consuming broker device has subscribed; and in response to a determination that a measured livelihood of the first producing broker device is less than a defined threshold, designating with the consuming broker device a second producing broker device as the sole provider of the messages having the topic to the consuming broker device. The second producing broker device has a measured livelihood that is greater than the measured livelihood of the first producing broker device.
    Type: Grant
    Filed: March 19, 2010
    Date of Patent: April 16, 2013
    Assignee: International Business Machines Corporation
    Inventors: John Christopher Hawkins, Francis N. Parr, Hao Yang
  • Patent number: 6275863
    Abstract: A method for programming and executing long running transactions between interface devices and a server includes the steps of providing a predicate set and a transform set on the interface devices pursuant to an activity to be performed by the long running transaction, the predicate set defining conditions for which updates to states in accordance with the activity are to be made and the transform set for applying the updated states pursuant to the predicate set, committing the activity for processing upon establishment of communication with the server from the interface device, establishing communication with the server from the interface device to initiate the long running transaction, replaying the predicate set and the transform set for the server to determine if the long running transaction is capable of being committed on the server and if capable of being committed on the server, committing the long running transaction to update states of the server wherein a plurality of interface devices are capable
    Type: Grant
    Filed: January 25, 1999
    Date of Patent: August 14, 2001
    Assignee: International Business Machines Corp.
    Inventors: Avraham Leff, Francis N. Parr, James T. Rayfield
  • Patent number: 5625811
    Abstract: A method and system are provided for partitioning a database and for balancing the processing load among processing nodes in a data processing system. A database partition is stored at each node and a logical owner node is assigned to each partition. The logical owner becomes responsible for all database requests related to the corresponding partition. Techniques for optimally assigning logical owners to all partitions in a system are provided and are responsive to parameters such as the load at each node, the combined load of the system, and the total number of assignments allowed. Techniques are also provided to accomplish the transfer of partition ownership between processing nodes when multiple transactions related to the partition are simultaneously occurring.
    Type: Grant
    Filed: October 31, 1994
    Date of Patent: April 29, 1997
    Assignee: International Business Machines Corporation
    Inventors: Anupam K. Bhide, Daniel M. Dias, Ambuj Goyal, Francis N. Parr, Joel L. Wolf
  • Patent number: 5317731
    Abstract: An apparatus, embodied in an Intelligent Page Store, for providing concurrent and consistent access to a functionally separate transaction entity and a query entity to a shared database, while maintaining a single physical copy of most of the data. The Intelligent Page Store contains shared disk storage, and an intelligent versioning mechanism allows simultaneous access by the transaction entity and the query entity to the shared data. The transaction entity is presented the current data and the query entity is presented a recent and consistent version of the data. A single copy of all but recently updated pages is maintained by the Intelligent Page Store. The query and transaction entities operate independently of each other and are separately optimized.
    Type: Grant
    Filed: February 25, 1991
    Date of Patent: May 31, 1994
    Assignee: International Business Machines Corporation
    Inventors: Daniel M. Dias, Ambuj Goyal, Francis N. Parr