Patents by Inventor Peter Foley
Peter Foley 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: 20240419507Abstract: Techniques for monitoring block moves in an array of compute elements and applying backpressure are disclosed. An array of compute elements is accessed. The array of compute elements is coupled to at least one data cache. The data cache provides memory storage for the array of compute elements. Control for the array of compute elements is enabled by a stream of wide control words generated by the compiler. A load address and a store address comprising memory block move addresses are generated. The memory block move addresses point to memory storage locations in the at least one data cache. Load buffers are coupled to the array of compute elements. The load buffers are located adjacent to at least one edge of the array of compute elements. A memory block move is executed using at least one of the load buffers, based on the memory block move addresses.Type: ApplicationFiled: August 30, 2024Publication date: December 19, 2024Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20240385965Abstract: Techniques for task processing are disclosed. An array of compute elements is accessed. Each compute element within the array is known to a compiler and is coupled to its neighboring compute elements. The array of compute elements is coupled to at least one data cache. The data cache provides memory storage for the array. Control for the compute elements is provided on a cycle-by-cycle basis. Control is enabled by a stream of wide control words generated by the compiler. A load address and a store address are generated. The load and the store addresses comprise memory block move addresses. The memory block move addresses point to memory storage locations in the data cache. A memory block move is executed, based on the memory block move addresses. The data for the memory block move is transferred outside of the array.Type: ApplicationFiled: July 26, 2024Publication date: November 21, 2024Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20240320092Abstract: Methods, apparatus, systems, and articles of manufacture are disclosed to determine memory access integrity based on feedback from memory. An example apparatus includes an access reconstruction controller including an output, a first input configured to be coupled to memory, and a second input configured to be coupled to a memory signal generator; a comparator including a first input coupled to the output of the access reconstruction controller, a second input configured to be coupled to an arbiter, and an output configured to be coupled to the arbiter; and a data integrity monitor including an input coupled to the second input of the comparator and configured to be coupled to the arbiter and an output coupled to the output of the comparator and configured to be coupled to the arbiter.Type: ApplicationFiled: May 30, 2024Publication date: September 26, 2024Inventors: Saya Goud Langadi, David Peter Foley
-
Publication number: 20240264974Abstract: Techniques for parallel processing based on hazard mitigation avoidance are disclosed. An array of compute elements is accessed. Each compute element within the array is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. Control for the compute elements is provided on a cycle-by-cycle basis. Control is enabled by a stream of wide control words generated by the compiler. Memory access operation hazard mitigation is enabled. The hazard mitigation is enabled by a control word tag. The control word tag supports memory access precedence information and is provided by the compiler at compile time. A hazardless memory access operation is executed. The hazardless memory access operation is determined by the compiler, and the hazardless memory access operation is designated by a unique set of precedence information contained in the tag. The tag is modified during runtime by hardware.Type: ApplicationFiled: April 19, 2024Publication date: August 8, 2024Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Patent number: 12032440Abstract: Methods, apparatus, systems, and articles of manufacture are disclosed to determine memory access integrity based on feedback from memory. An example apparatus includes an access reconstruction controller including an output, a first input configured to be coupled to memory, and a second input configured to be coupled to a memory signal generator; a comparator including a first input coupled to the output of the access reconstruction controller, a second input configured to be coupled to an arbiter, and an output configured to be coupled to the arbiter; and a data integrity monitor including an input coupled to the second input of the comparator and configured to be coupled to the arbiter and an output coupled to the output of the comparator and configured to be coupled to the arbiter.Type: GrantFiled: July 18, 2022Date of Patent: July 9, 2024Assignee: Texas Instruments IncorporatedInventors: Saya Goud Langadi, David Peter Foley
-
Publication number: 20240193009Abstract: Techniques for a parallel processing architecture for branch path suppression are disclosed. An array of compute elements is accessed. Each element is known to a compiler and is coupled to its neighboring elements. Control for the elements is provided on a cycle-by-cycle basis. Control is enabled by a stream of wide control words generated by the compiler. The control includes a branch. A plurality of compute elements is mapped. The mapping distributes parallelized operations to the compute elements. The mapping is determined by the compiler. A column of compute elements is enabled to perform vertical data access suppression and a row of compute elements is enabled to perform horizontal data access suppression. Both sides of the branch are executed. The executing includes making a branch decision. Branch operation data accesses are suppressed, based on the branch decision and an invalid indication. The invalid indication is propagated among compute elements.Type: ApplicationFiled: February 23, 2024Publication date: June 13, 2024Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20240168802Abstract: Techniques for parallel processing using hazard detection and store probes are disclosed. An array of compute elements is accessed. Each compute element within the array of compute elements is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. Control for the compute elements is provided on a cycle-by-cycle basis. Control is enabled by a stream of wide control words generated by the compiler. Data to be stored by the array of compute elements is managed. The data to be stored is targeted to a data cache coupled to the array of compute elements. The managing includes detecting and mitigating memory hazards. Pending data cache accesses are probed for hazards. The examining comprises a store probe. Store data is committed to the data cache. The committing is based on a result of the store probe.Type: ApplicationFiled: January 30, 2024Publication date: May 23, 2024Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20240078182Abstract: Techniques for parallel processing based on parallel processing with switch block execution are disclosed. An array of compute elements is accessed. Each compute element within the array of compute elements is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. Control for the compute elements is provided on a cycle-by-cycle basis. Control is enabled by a stream of wide control words generated by the compiler. A plurality of compute elements is initialized within the array with a switch statement. The switch statement is mapped into a primitive operation in each element of the plurality of compute elements. The initializing is based on a control word from the stream of control words. Each of the primitive operations is executed in an architectural cycle. A result is returned for the switch statement. The returning is determined by a decision variable.Type: ApplicationFiled: November 13, 2023Publication date: March 7, 2024Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20240070076Abstract: Techniques for parallel processing using hazard detection and mitigation are disclosed. An array of compute elements is accessed. Each compute element within the array of compute elements is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. Control for the compute elements is provided on a cycle-by-cycle basis. Control is enabled by a stream of wide control words generated by the compiler. Memory access operations are tagged with precedence information. The tagging is contained in the control words. The tagging is provided by the compiler at compile time. Memory access operations are monitored. The monitoring is based on the precedence information and a number of architectural cycles of the cycle-by-cycle basis. The tagging is augmented at run time, based on the monitoring. Memory access data is held before promotion, based on the monitoring.Type: ApplicationFiled: November 7, 2023Publication date: February 29, 2024Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20240028340Abstract: Techniques for parallel processing based on a parallel processing architecture with bin packing are disclosed. An array of compute elements is accessed. Each compute element is known to a compiler and is coupled to its neighboring compute elements. A plurality of compressed control words is generated by the compiler. The plurality of control words enables compute element operation and compute element memory access. The compressed control words are operationally sequenced. The compressed control words are linked by the compiler. Linking information is contained in at least one field of each of the compressed control words. The compressed control words are loaded into a control word cache coupled to the array of compute elements. The compressed control words are loaded into the control word cache in an operationally non-sequenced order. The plurality of compressed control words is ordered into an operationally sequenced execution order, based on the linking information.Type: ApplicationFiled: August 22, 2023Publication date: January 25, 2024Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20230409328Abstract: Techniques for task processing based on a parallel processing architecture with memory block transfers are disclosed. An array of compute elements is accessed. Each compute element is known to a compiler and is coupled to its neighboring compute elements. Control for the array is provided on a cycle-by-cycle basis. The control is enabled by a stream of wide control words generated by the compiler. A control word from the stream of control words includes a source address, a target address, a block size, and a stride. Memory block transfer control logic is used. The memory block transfer logic is implemented outside of the array of compute elements. A memory block transfer is executed. The memory block transfer is initiated by a control word from the stream of wide control words. Data for the memory block transfer is moved independently from the array of compute elements.Type: ApplicationFiled: August 30, 2023Publication date: December 21, 2023Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20230376447Abstract: Techniques for parallel processing based on a parallel processing architecture with dual load buffers are disclosed. A two-dimensional array of compute elements is accessed. Each compute element is known to a compiler and is coupled to its neighboring compute elements. A first data cache is coupled to the array. The first data cache enables loading data to a first portion of the array. The first data cache supports an address space. A second data cache is coupled to the array. The second data cache enables loading data to a second portion of the array. The second data cache supports the address space. Instructions are executed within the array. Instructions executed within the first portion of the array of compute elements use data loaded from the first data cache, and instructions executed within the second portion of the array of compute elements use data loaded from the second data cache.Type: ApplicationFiled: July 31, 2023Publication date: November 23, 2023Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Patent number: 11806550Abstract: The present disclosure provides a method for treating clinical or pre-clinical skin damage in a skin field of a subject, wherein the skin field has been allocated a skin cancerization field index (SCFI) score of at least 1 as determined by a process comprising the steps of: (i) assessing the number of keratoses in the skin field; (ii) assessing the thickness of the thickest keratosis in the skin field; and (iii) assessing the proportion of the field affected by clinical or subclinical skin damage. Based on the assessments made in (i), (ii) and (iii) the subject is optionally treated by at least one of (a) freezing one or more lesions, (b) shaving, curetting or surgically removing one or more lesions, (c) applying a topical treatment for actinic keratosis, basal cell carcinoma or squamous cell carcinoma, and (d) radiation therapy.Type: GrantFiled: November 11, 2022Date of Patent: November 7, 2023Assignee: GenesisCare Ventures Pty LtdInventors: Christopher Baker, Judith Mary Cole, Robert Sinclair, Warren Weightman, Stephen Shumack, Lynda Spelman, Peter Foley
-
Publication number: 20230350713Abstract: Techniques for parallel processing based on a parallel processing architecture with countdown tagging are disclosed. A two-dimensional array of compute elements is accessed. Each compute element within the array is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. A load operation is tagged with a countdown tag. Tagging is performed by the compiler, and the load operation is targeted to a memory system associated with the array of compute elements. The countdown tag comprises a time value. The time value is decremented as the load operation is being performed. The time value that is decremented is based on an architectural cycle. Countdown tag status is monitored by a control unit. The monitoring occurs as the load operation is performed. A load status is generated by the control unit, based on the monitoring. The load status allows compute element operation.Type: ApplicationFiled: July 11, 2023Publication date: November 2, 2023Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20230342152Abstract: Techniques for a parallel processing architecture with split control word caches are disclosed. A two-dimensional array of compute elements is accessed. Each compute element is known to a compiler and is coupled to its neighboring compute elements. A first control word cache is coupled to the array. The first control word cache enables loading control words to a first array portion. A second control word cache is coupled to the array. The second control word cache enables loading control words to a second array portion. The control words are split between the first and the second control word caches. The splitting is based on the constituency of the first and the second array portions. Instructions are executed within the array. Instructions executed within the first array portion use control words loaded from the first cache. Instructions executed within the second array portion use control words loaded from the second cache.Type: ApplicationFiled: June 29, 2023Publication date: October 26, 2023Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20230281014Abstract: Techniques for parallel processing of multiple loops with loads and stores are disclosed. A two-dimensional array of compute elements is accessed. Each compute element within the array is known to a compiler and is coupled to its neighboring compute elements within the array. Control for the compute elements is provided on a cycle-by-cycle basis. Control is enabled by a stream of wide control words generated by the compiler. Memory access operations are tagged with precedence information. The tagging is contained in the control words and is implemented for loop operations. The tagging is provided by the compiler at compile time. Control word data is loaded for multiple, independent loops into the compute elements. The multiple, independent loops are executed. Memory is accessed based on the precedence information. The memory access includes loads and/or stores for data relating to the independent loops.Type: ApplicationFiled: May 10, 2023Publication date: September 7, 2023Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20230273818Abstract: Techniques for task processing based on a highly parallel processing architecture with out-of-order resolution are disclosed. A two-dimensional array of compute elements is accessed. Each compute element within the array of compute elements is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. The array of compute elements is coupled to supporting logic and to memory, which, along with the array of compute elements, comprise compute hardware. A set of directions is provided to the hardware, through a control word generated by the compiler, for compute element operation. The set of directions is augmented with data access ordering information. The data access ordering is performed by the hardware. A compiled task is executed on the array of compute elements, based on the set of directions that was augmented.Type: ApplicationFiled: March 9, 2023Publication date: August 31, 2023Applicants: Ascenium, Inc., Ascenium, Inc.Inventor: Peter Foley
-
Publication number: 20230221931Abstract: Techniques for task processing based on autonomous compute element operation using buffers are disclosed. A two-dimensional array of compute elements is accessed. Each compute element is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. Control is provided for the array of compute elements on a cycle-by-cycle basis. The control is enabled by a stream of wide control words generated by the compiler. An autonomous operation buffer is loaded with at least two operations contained in control words. The autonomous operation buffer is integrated in a compute element. A compute element operation counter coupled to the autonomous operation buffer is set. The compute element operation counter is integrated in the compute element. The at least two operations are executed using the autonomous operation buffer and the compute element operation counter. The operations complete autonomously from direct compiler control.Type: ApplicationFiled: March 21, 2023Publication date: July 13, 2023Applicant: Ascenium, Inc.Inventor: Peter Foley
-
Patent number: 11654298Abstract: The present disclosure provides a method for treating clinical or pre-clinical skin damage in a skin field of a subject, wherein the skin field has been allocated a skin cancerization field index (SCR) score of at least 1 as determined by a process comprising the steps of: (i) assessing the number of keratoses in the skin field; (ii) assessing the thickness of the thickest keratosis in the skin field; and (iii) assessing the proportion of the field affected by clinical or subclinical skin damage. Based on the assessments made in (i), (ii) and (iii) the subject is optionally treated by at least one of (a) freezing one or more lesions, (b) shaving, curetting or surgically removing one or more lesions, (c) applying a topical treatment for actinic keratosis, basal cell carcinoma or squamous cell carcinoma, and (d) radiation therapy.Type: GrantFiled: January 7, 2022Date of Patent: May 23, 2023Assignee: GenesisCare Ventures Pty LtdInventors: Christopher Baker, Judith Mary Cole, Robert Sinclair, Warren Weightman, Stephen Shumack, Lynda Spelman, Peter Foley
-
Publication number: 20230128127Abstract: Techniques for task processing based on compute element processing using control word templates are disclosed. One or more control word templates are generated for use in a two-dimensional array of compute elements. Each compute element within the array is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. Each control word template designates a topological set of compute elements from the array of compute elements. The one or more control word templates are customized with a specific set of compute element operations. The one or more control word templates that were customized are stored. The specific set of compute element operations is executed on the topological set of compute elements. The one or more control word templates that were stored are reused. The one or more control word templates that were stored are modified and executed using compute elements.Type: ApplicationFiled: December 23, 2022Publication date: April 27, 2023Applicant: Ascenium, Inc.Inventors: Ionut Hristodorescu, Peter Foley