Patents by Inventor Luis F. Stevens
Luis F. Stevens 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: 11714801Abstract: Methods and systems for execution of data operations in a queue are described. One method includes loading a pointer to a record in a lock-free ring buffer by an executing thread, as well as calculating an index from the pointer to a record to be processed and obtaining a header of the record to be processed. Based on the header, a state of the record to be processed is determined from among: a filled state, a filling state, a drained state, and a draining state. A candidate header is created which includes an updated state indicating that the record is in use by the executing thread. An atomic operation is performed to update the header of the record to the candidate header. Upon successful completion of the atomic operation to update the header of the record to the candidate header, a data operation is performed on the record.Type: GrantFiled: March 30, 2020Date of Patent: August 1, 2023Assignee: Target Brands, Inc.Inventors: Luis F. Stevens, Hrishikesh V. Prabhune, Christopher Fretz
-
Publication number: 20230053121Abstract: A method includes receiving a first post from an electronic source including first content; determining a source identifier; determining an attribute for the source by broadcasting the first post to a first plurality of filter graph definitions configured to identify attributes of sources according to the respective filter graph definition; and storing in memory, as a source profile identified by the source identifier for the source, the attribute for the source; receiving a second post from the source including second content; determining a source identifier; using the source identifier, querying the memory to access the source profile; correlating the second post with attributes of the source stored in the source profile to produce a correlated second post; and broadcasting the correlated second post to a second plurality of filter graph definitions configured to identify posts with high value information according to the respective filter graph definition.Type: ApplicationFiled: June 8, 2022Publication date: February 16, 2023Inventors: Luis F. Stevens, John Skolfield, Vince Schiavone, Steve Weissinger, George Tretyakov, Ryan Mammina, Mo Malakiman
-
Patent number: 11537453Abstract: Methods and systems for managing a circular queue, or ring buffer, are disclosed. One method includes storing data from a producer into the ring buffer, and receiving a data read request from a consumer from among a plurality of consumers subscribed to read data from the ring buffer. After obtaining data from a location in the ring buffer in response to the data read request, it is determined if the location has been overrun by the producer. If it is determined that the location has been overrun by the producer, the data is discarded by the consumer. Otherwise, the data is consumed. Depending on the outcome, a miss counter or a read counter may be incremented.Type: GrantFiled: March 30, 2020Date of Patent: December 27, 2022Assignee: Target Brands, Inc.Inventors: Luis F. Stevens, Hrishikesh V. Prabhune, Christopher Fretz
-
Publication number: 20220269675Abstract: Examples disclosed herein are relevant to configurations of hash tables. An example hash table includes is configured to be placed into a contiguous block of shared memory and be used across multiple processes. The hash table can include a memory layout having two logical tables: a metadata table and a storage array. In addition, a storage bitmap can be used to determine available memory locations in the storage array. Disclosed configurations can be suited for use in high-performance computing applications.Type: ApplicationFiled: May 11, 2022Publication date: August 25, 2022Inventors: Christopher Fretz, Hrishikesh V. Prabhune, Luis F. Stevens
-
Patent number: 11392414Abstract: A node management protocol is disclosed herein. The protocol can be used for task distribution in multi-node systems. The node management protocol can implement a cooperation-based task distribution algorithm that does not rely on consensus. When a task is ingested into a cluster of nodes, the nodes can compete to handle the task. A transport layer helps coordinate among nodes and facilitates the handling of work. A session expiry protocol handles node failures with the remaining nodes reassigning work.Type: GrantFiled: October 4, 2019Date of Patent: July 19, 2022Assignee: Target Brands, Inc.Inventors: Christopher Fretz, Hrishikesh V. Prabhune, Luis F. Stevens
-
Patent number: 11366807Abstract: Examples disclosed herein are relevant to configurations of hash tables. An example hash table includes is configured to be placed into a contiguous block of shared memory and be used across multiple processes. The hash table can include a memory layout having two logical tables: a metadata table and a storage array. In addition, a storage bitmap can be used to determine available memory locations in the storage array. Disclosed configurations can be suited for use in high-performance computing applications.Type: GrantFiled: October 4, 2019Date of Patent: June 21, 2022Assignee: Target Brands, Inc.Inventors: Christopher Fretz, Hrishikesh V. Prabhune, Luis F. Stevens
-
Patent number: 11366859Abstract: A method includes receiving a first post from an electronic source including first content; determining a source identifier; determining an attribute for the source by broadcasting the first post to a first plurality of filter graph definitions configured to identify attributes of sources according to the respective filter graph definition; and storing in memory, as a source profile identified by the source identifier for the source, the attribute for the source; receiving a second post from the source including second content; determining a source identifier; using the source identifier, querying the memory to access the source profile; correlating the second post with attributes of the source stored in the source profile to produce a correlated second post; and broadcasting the correlated second post to a second plurality of filter graph definitions configured to identify posts with high value information according to the respective filter graph definition.Type: GrantFiled: June 30, 2020Date of Patent: June 21, 2022Assignee: Target Brands, Inc.Inventors: Luis F. Stevens, John Skolfield, Vince Schiavone, Steve Weissinger, George Tretyakov, Ryan Mammina, Mo Malakiman
-
Patent number: 11347698Abstract: Examples disclosed herein are relevant to garbage collection for data structures, such as hash tables. The data structure can store garbage collection values for use during a garbage collection process. The garbage collection values can have a value indicating the occurrence of a poisoned status. Disclosed configurations can be suited for use in high-performance computing applications.Type: GrantFiled: October 4, 2019Date of Patent: May 31, 2022Assignee: Target Brands, Inc.Inventors: Christopher Fretz, Hrishikesh V. Prabhune, Luis F. Stevens
-
Patent number: 11182098Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.Type: GrantFiled: September 30, 2019Date of Patent: November 23, 2021Assignee: Target Brands, Inc.Inventors: Luis F. Stevens, Hrishikesh Vivek Prabhune, Pallav Agrawal, Vincent Schiavone
-
Publication number: 20210303375Abstract: Methods and systems for managing a circular queue, or ring buffer, are disclosed. One method includes storing data from a producer into the ring buffer, and receiving a data read request from a consumer from among a plurality of consumers subscribed to read data from the ring buffer. After obtaining data from a location in the ring buffer in response to the data read request, it is determined if the location has been overrun by the producer. If it is determined that the location has been overrun by the producer, the data is discarded by the consumer. Otherwise, the data is consumed. Depending on the outcome, a miss counter or a read counter may be incremented.Type: ApplicationFiled: March 30, 2020Publication date: September 30, 2021Inventors: LUIS F. STEVENS, HRISHIKESH V. PRABHUNE, CHRISTOPHER FRETZ
-
Publication number: 20210303551Abstract: Methods and systems for execution of data operations in a queue are described. One method includes loading a pointer to a record in a lock-free ring buffer by an executing thread, as well as calculating an index from the pointer to a record to be processed and obtaining a header of the record to be processed. Based on the header, a state of the record to be processed is determined from among: a filled state, a filling state, a drained state, and a draining state. A candidate header is created which includes an updated state indicating that the record is in use by the executing thread. An atomic operation is performed to update the header of the record to the candidate header. Upon successful completion of the atomic operation to update the header of the record to the candidate header, a data operation is performed on the record.Type: ApplicationFiled: March 30, 2020Publication date: September 30, 2021Inventors: LUIS F. STEVENS, HRISHIKESH V. PRABHUNE, CHRISTOPHER FRETZ
-
Publication number: 20210279265Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.Type: ApplicationFiled: June 30, 2020Publication date: September 9, 2021Applicant: Target Brands, Inc.Inventors: Luis F. Stevens, Vincent Schiavone, Charles H. Leu, Shirin Hashemi, Mo Malakiman
-
Publication number: 20210157858Abstract: A method includes receiving a first post from an electronic source including first content; determining a source identifier; determining an attribute for the source by broadcasting the first post to a first plurality of filter graph definitions configured to identify attributes of sources according to the respective filter graph definition; and storing in memory, as a source profile identified by the source identifier for the source, the attribute for the source; receiving a second post from the source including second content; determining a source identifier; using the source identifier, querying the memory to access the source profile; correlating the second post with attributes of the source stored in the source profile to produce a correlated second post; and broadcasting the correlated second post to a second plurality of filter graph definitions configured to identify posts with high value information according to the respective filter graph definition.Type: ApplicationFiled: June 30, 2020Publication date: May 27, 2021Applicant: Target Brands, Inc.Inventors: Luis F. Stevens, John Skolfield, Vince Schiavone, Steve Weissinger, George Tretyakov, Ryan Mammina, Mo Malakiman
-
Patent number: 10698935Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.Type: GrantFiled: November 23, 2016Date of Patent: June 30, 2020Assignee: UDA, LLCInventors: Luis F. Stevens, Vincent Schiavone, Charles H. Leu, Shirin Hashemi, Mo Malakiman
-
Publication number: 20200026456Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.Type: ApplicationFiled: September 30, 2019Publication date: January 23, 2020Inventors: Luis F. Stevens, Hrishikesh Vivek Prabhune, Pallav Agrawal, Vincent Schiavone
-
Patent number: 10430111Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.Type: GrantFiled: November 23, 2016Date of Patent: October 1, 2019Assignee: UDA, LLCInventors: Luis F. Stevens, Hrishikesh Vivek Prabhune, Pallav Agrawal, Vincent Schiavone
-
Publication number: 20170168751Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.Type: ApplicationFiled: November 23, 2016Publication date: June 15, 2017Inventors: Luis F. Stevens, Hrishikesh Vivek Prabhune, Pallav Agrawal, Vincent Schiavone
-
Publication number: 20170075990Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filler node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.Type: ApplicationFiled: November 23, 2016Publication date: March 16, 2017Inventors: Charles H. Leu, Luis F. Stevens, Shirin Hashemi, Mo Malakiman, Vincent Schiavone
-
Patent number: 8296433Abstract: A method and apparatus is provided for integrating an application into a network of computing resources. Applications using this integration have a virtualized access to one or more computing resources associated with the network. Virtualization is generally assured through at least one network connection between the virtual layer and the native network. Together, the virtual access is used to generate a virtual application network capable of providing the application access to the network of computing resources. The application is created into an orchestration of operations to manipulate the one or more computing resources according to a business process. As needed, the application and orchestration can be further partitioning into components to be distributed and executed over the virtual application network using the virtualized access.Type: GrantFiled: May 15, 2007Date of Patent: October 23, 2012Assignee: International Business Machines CorporationInventors: Luis F. Stevens, Robert J. Petri, George Mark Scott
-
Publication number: 20090094364Abstract: A method and apparatus is provided for integrating an application into a network of computing resources. Applications using this integration have a virtualized access to one or more computing resources associated with the network. Virtualization is generally assured through at least one network connection between the virtual layer and the native network. Together, the virtual access is used to generate a virtual application network capable of providing the application access to the network of computing resources. The application is created into an orchestration of operations to manipulate the one or more computing resources according to a business process. As needed, the application and orchestration can be further partitioning into components to be distributed and executed over the virtual application network using the virtualized access.Type: ApplicationFiled: May 15, 2007Publication date: April 9, 2009Inventors: Luis F. Stevens, Robert J. Petri, George Mark Scott