Patents by Inventor Kevin David Howard
Kevin David Howard 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: 11914979Abstract: Software systems and methods convert algorithms and software codes into time affecting linear pathways (TALPs) via decomposition and convert paired Input/Output (I/O) datasets into TALPs via Value Complexity polynomials. Generated TALPs can be enhanced through merging with other TALPs. TALPs can be grouped by matching the outputs of the TALP-associated prediction polynomials with some set of given criteria into families and cross-families that are useful in a new type of software optimization that allows for output values of grouped TALPs to be modeled, pooled, discretized and optimized to enhance goals or meet user goals.Type: GrantFiled: September 4, 2023Date of Patent: February 27, 2024Assignee: C Squared IP Holdings LLCInventors: Scott Andrew Smith, Christopher Graham Smith, Kevin David Howard
-
Patent number: 11861336Abstract: Software systems and methods convert algorithms and software codes into time affecting linear pathways (TALPs) via decomposition and convert paired Input/Output (I/O) datasets into TALPs via Value Complexity polynomials. Generated TALPs can be enhanced through merging with other TALPs. TALPs can be grouped by matching the outputs of the TALP-associated prediction polynomials with some set of given criteria into families and cross-families that are useful in a new type of software optimization that allows for output values of grouped TALPs to be modeled, pooled, discretized and optimized to enhance goals or meet user goals.Type: GrantFiled: January 27, 2023Date of Patent: January 2, 2024Assignee: C SQUARED IP HOLDINGS LLCInventors: Scott Andrew Smith, Christopher Graham Smith, Kevin David Howard
-
Publication number: 20230409303Abstract: Software systems and methods convert algorithms and software codes into time affecting linear pathways (TALPs) via decomposition and convert paired Input/Output (I/O) datasets into TALPs via Value Complexity polynomials. Generated TALPs can be enhanced through merging with other TALPs. TALPs can be grouped by matching the outputs of the TALP-associated prediction polynomials with some set of given criteria into families and cross-families that are useful in a new type of software optimization that allows for output values of grouped TALPs to be modeled, pooled, discretized and optimized to enhance goals or meet user goals.Type: ApplicationFiled: September 4, 2023Publication date: December 21, 2023Inventors: Scott Andrew SMITH, Christopher Graham SMITH, Kevin David HOWARD
-
Publication number: 20230325319Abstract: Methods and systems for existing software applications to automatically take advantage of multicore computer systems outside of the conventional simultaneous processing of multiple applications and without performance problems from cache misses and mismatched task processing times are presented. Unlike other multicore optimization techniques, the present invention uses techniques that are applied to design graphs and work for scaled and standard speedup-based parallel processing. The methods and systems optimize software designs that are attached to code for maximum performance on multicore computer hardware by analyzing and modifying loop structures to produce a general parallel solution, not just simple loop unrolling.Type: ApplicationFiled: April 5, 2023Publication date: October 12, 2023Inventor: Kevin David HOWARD
-
Publication number: 20230281543Abstract: Methods and systems for automatic innovation determination and use are provided such that objective levels of innovation, efficiency, and complexity can be determined for a software system during the software design and construction process, allowing developers and management to understand and predict not only the contributions of individuals, or teams, but also the worth of those contributions. Further, metrics can be used to determine if two or more implementations of some product actually represent the same or closely linked solutions.Type: ApplicationFiled: February 28, 2023Publication date: September 7, 2023Inventor: Kevin David HOWARD
-
Patent number: 11687328Abstract: A software enhancement and management system (E&M System) can include two ways to decompose existing software such that new functionality can be added: functional decomposition and time-affecting linear pathway (TALP) decomposition. Functional decomposition captures the inputs and outputs of the existing software's functions and attaches the new algorithmic constructs presented as other functions that receive the outputs of the existing software's functions. TALP decomposition allows for the generation of time-prediction polynomials that approximate time-complexity functions, speedup, and automatic dynamic loop-unrolling-based parallelization for each TALP.Type: GrantFiled: August 12, 2022Date of Patent: June 27, 2023Assignee: C SQUARED IP HOLDINGS LLCInventors: Scott Andrew Smith, Christopher Graham Smith, Kevin David Howard
-
Publication number: 20230176841Abstract: Software systems and methods convert algorithms and software codes into time affecting linear pathways (TALPs) via decomposition and convert paired Input/Output (l/O) datasets into TALPs via Value Complexity polynomials. Generated TALPs can be enhanced through merging with other TALPs. TALPs can be grouped by matching the outputs of the TALP-associated prediction polynomials with some set of given criteria into families and cross-families that are useful in a new type of software optimization that allows for output values of grouped TALPs to be modeled, pooled, discretized and optimized to enhance goals or meet user goals.Type: ApplicationFiled: January 27, 2023Publication date: June 8, 2023Inventors: Scott Andrew SMITH, Christopher Graham SMITH, Kevin David HOWARD
-
Publication number: 20230051527Abstract: A software enhancement and management system (E&M System) can include two ways to decompose existing software such that new functionality can be added: functional decomposition and time-affecting linear pathway (TALP) decomposition. Functional decomposition captures the inputs and outputs of the existing software's functions and attaches the new algorithmic constructs presented as other functions that receive the outputs of the existing software's functions. TALP decomposition allows for the generation of time-prediction polynomials that approximate time-complexity functions, speedup, and automatic dynamic loop-unrolling-based parallelization for each TALP.Type: ApplicationFiled: August 12, 2022Publication date: February 16, 2023Inventors: Scott Andrew SMITH, Christopher Graham SMITH, Kevin David HOWARD
-
Patent number: 7941479Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.Type: GrantFiled: December 11, 2009Date of Patent: May 10, 2011Assignee: Massively Parallel Technologies, Inc.Inventors: Kevin David Howard, Glen Curtis Rea, Nick Wade Robertson, Silva Chang
-
Patent number: 7730121Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.Type: GrantFiled: August 25, 2008Date of Patent: June 1, 2010Assignee: Massively Parallel Technologies, Inc.Inventors: Kevin David Howard, Glen Curtis Rea, Nick Wade Robertson, Silva Chang
-
Publication number: 20100094924Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.Type: ApplicationFiled: December 11, 2009Publication date: April 15, 2010Inventors: Kevin David Howard, Glen Curtis Rea, Nick Wade Robertson, Silva Chang
-
Publication number: 20090055625Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.Type: ApplicationFiled: August 25, 2008Publication date: February 26, 2009Inventors: Kevin David Howard, Glen Curtis Rea, Nick Wade Robertson, Silva Chang
-
Patent number: 7418470Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.Type: GrantFiled: January 10, 2003Date of Patent: August 26, 2008Assignee: Massively Parallel Technologies, Inc.Inventors: Kevin David Howard, Glen Curtis Rea, Nick Wade Robertson, Silva Chang
-
Publication number: 20030195938Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.Type: ApplicationFiled: January 10, 2003Publication date: October 16, 2003Inventors: Kevin David Howard, Glen Curtis Rea, Nick Wade Robertson, Silva Chang