Patents by Inventor Patrick Joseph McCarthy
Patrick Joseph McCarthy 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: 11921732Abstract: In some embodiments, a method includes determining a position for a search query and a position for each audience record from multiple audience records in an embedding space. The method further includes receiving multiple device records, each associated with an audience record. The method further includes determining multiple keywords, each associated with an audience record and determining a position for each keyword in the embedding space. The method further includes calculating a first distance between the position of the search query in the embedding space and the position of each audience record in the embedding space. The method further includes calculating a second distance between the position of the search query in the embedding space and the position of each keyword in the embedding space. The method further includes ranking each audience record based on the first distance and the second distance.Type: GrantFiled: August 1, 2023Date of Patent: March 5, 2024Assignee: Dstillery, Inc.Inventors: Melinda Han Williams, Peter Ernest Lenz, Jr., Yeming Shi, Patrick Joseph McCarthy, Amelia Grieve White
-
Publication number: 20230376493Abstract: In some embodiments, a method includes determining a position for a search query and a position for each audience record from multiple audience records in an embedding space. The method further includes receiving multiple device records, each associated with an audience record. The method further includes determining multiple keywords, each associated with an audience record and determining a position for each keyword in the embedding space. The method further includes calculating a first distance between the position of the search query in the embedding space and the position of each audience record in the embedding space. The method further includes calculating a second distance between the position of the search query in the embedding space and the position of each keyword in the embedding space. The method further includes ranking each audience record based on the first distance and the second distance.Type: ApplicationFiled: August 1, 2023Publication date: November 23, 2023Applicant: Dstillery, Inc.Inventors: Melinda Han WILLIAMS, Peter Ernest LENZ, JR., Yeming SHI, Patrick Joseph MCCARTHY, Amelia Grieve WHITE
-
Patent number: 11768844Abstract: In some embodiments, a method includes determining a position for a search query and a position for each audience record from multiple audience records in an embedding space. The method further includes receiving multiple device records, each associated with an audience record. The method further includes determining multiple keywords, each associated with an audience record and determining a position for each keyword in the embedding space. The method further includes calculating a first distance between the position of the search query in the embedding space and the position of each audience record in the embedding space. The method further includes calculating a second distance between the position of the search query in the embedding space and the position of each keyword in the embedding space. The method further includes ranking each audience record based on the first distance and the second distance.Type: GrantFiled: February 13, 2023Date of Patent: September 26, 2023Assignee: Dstillery, Inc.Inventors: Melinda Han Williams, Peter Ernest Lenz, Jr., Yeming Shi, Patrick Joseph McCarthy, Amelia Grieve White
-
Publication number: 20230195736Abstract: In some embodiments, a method includes determining a position for a search query and a position for each audience record from multiple audience records in an embedding space. The method further includes receiving multiple device records, each associated with an audience record. The method further includes determining multiple keywords, each associated with an audience record and determining a position for each keyword in the embedding space. The method further includes calculating a first distance between the position of the search query in the embedding space and the position of each audience record in the embedding space. The method further includes calculating a second distance between the position of the search query in the embedding space and the position of each keyword in the embedding space. The method further includes ranking each audience record based on the first distance and the second distance.Type: ApplicationFiled: February 13, 2023Publication date: June 22, 2023Applicant: Dstillery, Inc.Inventors: Melinda Han WILLIAMS, Peter Ernest LENZ, JR., Yeming SHI, Patrick Joseph MCCARTHY, Amelia Grieve WHITE
-
Patent number: 11580117Abstract: In some embodiments, a method includes determining a position for a search query and a position for each audience record from multiple audience records in an embedding space. The method further includes receiving multiple device records, each associated with an audience record. The method further includes determining multiple keywords, each associated with an audience record and determining a position for each keyword in the embedding space. The method further includes calculating a first distance between the position of the search query in the embedding space and the position of each audience record in the embedding space. The method further includes calculating a second distance between the position of the search query in the embedding space and the position of each keyword in the embedding space. The method further includes ranking each audience record based on the first distance and the second distance.Type: GrantFiled: January 25, 2021Date of Patent: February 14, 2023Assignee: Dstillery, Inc.Inventors: Peter Ernest Lenz, Jr., Yeming Shi, Amelia Grieve White, Patrick Joseph McCarthy, Melinda Han Williams
-
Publication number: 20210319035Abstract: In some embodiments, a method includes determining a position for a search query and a position for each audience record from multiple audience records in an embedding space. The method further includes receiving multiple device records, each associated with an audience record. The method further includes determining multiple keywords, each associated with an audience record and determining a position for each keyword in the embedding space. The method further includes calculating a first distance between the position of the search query in the embedding space and the position of each audience record in the embedding space. The method further includes calculating a second distance between the position of the search query in the embedding space and the position of each keyword in the embedding space. The method further includes ranking each audience record based on the first distance and the second distance.Type: ApplicationFiled: January 25, 2021Publication date: October 14, 2021Applicant: Dstillery, Inc.Inventors: Peter Ernest LENZ, JR., Yeming SHI, Patrick Joseph MCCARTHY, Amelia Grieve WHITE, Melinda Han WILLIAMS
-
Patent number: 10902009Abstract: In some embodiments, a method includes determining a position for a search query and a position for each audience record from multiple audience records in an embedding space. The method further includes receiving multiple device records, each associated with an audience record. The method further includes determining multiple keywords, each associated with an audience record and determining a position for each keyword in the embedding space. The method further includes calculating a first distance between the position of the search query in the embedding space and the position of each audience record in the embedding space. The method further includes calculating a second distance between the position of the search query in the embedding space and the position of each keyword in the embedding space. The method further includes ranking each audience record based on the first distance and the second distance.Type: GrantFiled: July 23, 2020Date of Patent: January 26, 2021Assignee: Dstillery, Inc.Inventors: Peter Ernest Lenz, Jr., Yeming Shi, Patrick Joseph Mccarthy, Amelia Grieve White, Melinda Han Williams
-
Patent number: 8812818Abstract: A method and apparatus creates and manages persistent memory (PM) in a multi-node computing system. A PM Manager in the service node creates and manages pools of nodes with various sizes of PM. A node manager uses the pools of nodes to load applications to the nodes according to the size of the available PM. The PM Manager can dynamically adjust the size of the PM according to the needs of the applications based on historical use or as determined by a system administrator. The PM Manager works with an operating system kernel on the nodes to provide persistent memory for application data and system metadata. The PM Manager uses the persistent memory to load applications to preserve data from one application to the next. Also, the data preserved in persistent memory may be system metadata such as file system data that will be available to subsequent applications.Type: GrantFiled: February 14, 2012Date of Patent: August 19, 2014Assignee: International Business Machines CorporationInventors: Eric Lawrence Barsness, David L. Darrington, Patrick Joseph McCarthy, Amanda Peters, John Matthew Santosuosso
-
Patent number: 8458433Abstract: A method and apparatus creates and manages persistent memory (PM) in a multi-node computing system. A PM Manager in the service node creates and manages pools of nodes with various sizes of PM. A node manager uses the pools of nodes to load applications to the nodes according to the size of the available PM. The PM Manager can dynamically adjust the size of the PM according to the needs of the applications based on historical use or as determined by a system administrator. The PM Manager works with an operating system kernel on the nodes to provide persistent memory for application data and system metadata. The PM Manager uses the persistent memory to load applications to preserve data from one application to the next. Also, the data preserved in persistent memory may be system metadata such as file system data that will be available to subsequent applications.Type: GrantFiled: October 29, 2007Date of Patent: June 4, 2013Assignee: International Business Machines CorporationInventors: Eric Lawrence Barsness, David L. Darrington, Patrick Joseph McCarthy, Amanda Peters, John Matthew Santosuosso
-
Patent number: 8370844Abstract: Embodiments off the invention provide a mechanism for process migration on a massively parallel computer system. In particular, embodiments of the invention may be used to update process state data for a migrated compute node, such as MPI (or other communication library) state data, across a full collection of compute nodes present in a given parallel system executing a parallel task. Migrating a process form one compute node to another may be useful to address a variety of sub-optimal operating conditions. For example, one or more processes may be migrated to cure network congestion resulting from a poorly mapped task or when a compute node is predicted to experience a hardware failure.Type: GrantFiled: September 12, 2007Date of Patent: February 5, 2013Assignee: International Business Machines CorporationInventors: Charles Jens Archer, David L. Darrington, Patrick Joseph McCarthy, Amanda Peters, Albert Sidelnik
-
Publication number: 20120144132Abstract: A method and apparatus creates and manages persistent memory (PM) in a multi-node computing system. A PM Manager in the service node creates and manages pools of nodes with various sizes of PM. A node manager uses the pools of nodes to load applications to the nodes according to the size of the available PM. The PM Manager can dynamically adjust the size of the PM according to the needs of the applications based on historical use or as determined by a system administrator. The PM Manager works with an operating system kernel on the nodes to provide persistent memory for application data and system metadata. The PM Manager uses the persistent memory to load applications to preserve data from one application to the next. Also, the data preserved in persistent memory may be system metadata such as file system data that will be available to subsequent applications.Type: ApplicationFiled: February 14, 2012Publication date: June 7, 2012Applicant: International Business Machines CorporationInventors: Eric Lawrence Barsness, David L. Darrington, Patrick Joseph McCarthy, Amanda Peters, John Matthew Santosuosso
-
Patent number: 8141091Abstract: An apparatus, program product and method in which application program-specified resource allocation and allocation strength preferences are used to allocate hardware resources from a computer for that application program. The resource allocation preference is used to allocate hardware resources for the application program, while the allocation strength preference is used to determine whether to allocate alternate hardware resources when the resource allocation preference specified by the application program cannot be met.Type: GrantFiled: October 2, 2007Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Lynn Keat Chung, Chistopher Francois, Richard Karl Kirkman, Henry Joseph May, Patrick Joseph McCarthy, Don Darrell Reed, Kenneth Charles Vossen
-
Patent number: 8042114Abstract: An apparatus, program product and method in which application program-specified resource allocation and allocation strength preferences are used to allocate hardware resources from a computer for that application program. The resource allocation preference is used to allocate hardware resources for the application program, while the allocation strength preference is used to determine whether to allocate alternate hardware resources when the resource allocation preference specified by the application program cannot be met.Type: GrantFiled: December 12, 2007Date of Patent: October 18, 2011Assignee: International Business Machines CorporationInventors: Lynn Keat Chung, Chistopher Francois, Richard Karl Kirkman, Henry Joseph May, Patrick Joseph McCarthy, Don Darrell Reed, Kenneth Charles Vossen
-
Patent number: 7765385Abstract: An apparatus and method for overcoming a torus network failure in a parallel computer system. A mesh routing mechanism in the service node of the computer system configures the nodes from a torus to a mesh network when a failure occurs in the torus network. The mesh routing mechanism takes advantage of cutoff registers in each node to route node to node data transfers around the faulty node or network connection.Type: GrantFiled: April 18, 2007Date of Patent: July 27, 2010Assignee: International Business Machines CorporationInventors: David L. Darrington, Patrick Joseph McCarthy, Amanda Peters, Albert Sidelnik
-
Patent number: 7743222Abstract: Methods, systems, and media for managing dynamic memory are disclosed. Embodiments may disclose identifying nodes with having memory for dynamic storage, and reserving a portion of the memory from the identified nodes for a heap pool. After generating a heap pool, embodiments may allocate dynamic storage from the heap pool to tasks received that are associated with one of the identified nodes. More specifically, embodiments identify the node or home node associated with the task, the amount of dynamic storage requested by the task, and create a heap object in the node associated with the task to provide the requested dynamic storage. Some embodiments involve de-allocating the dynamic storage assigned to the task upon receipt of an indication that the task is complete and the dynamic storage is no longer needed for the task. Several of such embodiments return the de-allocated dynamic storage to the heap pool for reuse.Type: GrantFiled: April 8, 2008Date of Patent: June 22, 2010Assignee: International Business Machines CorporationInventors: Kenneth Roger Allen, Richard Karl Kirkman, Patrick Joseph McCarthy, Wade Byron Ouren
-
Patent number: 7673182Abstract: A data collector for a massively parallel computer system obtains call-return stack traceback data for multiple nodes by retrieving partial call-return stack traceback data from each node, grouping the nodes in subsets according to the partial traceback data, and obtaining further call-return stack traceback data from a representative node or nodes of each subset. Preferably, the partial data is a respective instruction address from each node, nodes having identical instruction address being grouped together in the same subset. Preferably, a single node of each subset is chosen and full stack traceback data is retrieved from the call-return stack within the chosen node.Type: GrantFiled: June 22, 2006Date of Patent: March 2, 2010Assignee: International Business Machines CorporationInventors: Thomas Michael Gooding, Patrick Joseph McCarthy
-
Patent number: 7644254Abstract: A method and apparatus for dynamically rerouting node processes on the compute nodes of a massively parallel computer system using hint bits to route around failed nodes or congested networks without restarting applications executing on the system. When a node has a failure or there are indications that it may fail, the application software on the system is suspended while the data on the failed node is moved to a backup node. The torus network traffic is routed around the failed node and traffic for the failed node is rerouted to the backup node. The application can then resume operation without restarting from the beginning.Type: GrantFiled: April 18, 2007Date of Patent: January 5, 2010Assignee: International Business Machines CorporationInventors: David L. Darrington, Patrick Joseph McCarthy, Amanda Peters, Albert Sidelnik, Brian Edward Smith, Brent Allen Swartz
-
Publication number: 20090313452Abstract: A method and apparatus creates and manages persistent memory (PM) in a multi-node computing system. A PM Manager in the service node creates and manages pools of nodes with various sizes of PM. A node manager uses the pools of nodes to load applications to the nodes according to the size of the available PM. The PM Manager can dynamically adjust the size of the PM according to the needs of the applications based on historical use or as determined by a system administrator. The PM Manager works with an operating system kernel on the nodes to provide persistent memory for application data and system metadata. The PM Manager uses the persistent memory to load applications to preserve data from one application to the next. Also, the data preserved in persistent memory may be system metadata such as file system data that will be available to subsequent applications.Type: ApplicationFiled: October 29, 2007Publication date: December 17, 2009Inventors: Eric Lawrence Barsness, David L. Darrington, Patrick Joseph McCarthy, Amanda Peters, John Matthew Santosuosso
-
Patent number: 7631169Abstract: A method and apparatus for fault recovery of on a parallel computer system from a soft failure without ending an executing job on a partition of nodes. In preferred embodiments a failed hardware recovery mechanism on a service node uses a heartbeat monitor to determine when a node failure occurs. Where possible, the failed node is reset and re-loaded with software without ending the software job being executed by the partition containing the failed node.Type: GrantFiled: February 2, 2007Date of Patent: December 8, 2009Assignee: International Business Machines CorporationInventors: David L. Darrington, Patrick Joseph McCarthy, Amanda Peters, Albert Sidelnik
-
Patent number: 7574708Abstract: Disclosed is an apparatus, method, and program product that enables distribution of operating system resources on a nodal basis in the same proportions as the expected system workload. The preferred embodiment of the present invention accomplishes this by assigning various types of weights to each node to represent their proportion of the overall balance within the system. Target Weights represent the desired distribution of the workload based on the existing proportions of processor and memory resources on each node. The actual workload balance on the system is represented by Current Weights, which the operating system strives to keep as close to the Target Weights as possible, on an ongoing basis. When the system is started, operating system services distribute their resources nodally in the same proportions as the Target Weights, and can request to be notified if the Target Weights ever change.Type: GrantFiled: March 4, 2004Date of Patent: August 11, 2009Assignee: International Business Machines CorporationInventors: Lynn Keat Chung, Christopher Francois, Richard Karl Kirkman, Patrick Joseph McCarthy, Don Darrell Reed, Kenneth Charles Vossen