Semantic ordering for parallel architecture with compute slices
AssigneeAscenium, Inc.
InventorJacob John Vorland Taylor
Life of this patent
Estimating the term…
Loading patent…
AssigneeAscenium, Inc.
InventorJacob John Vorland Taylor
Estimating the term…
Techniques for managing compute slice tasks are disclosed. A processing unit comprising compute slices, load-store units (LSUs), a control unit, and a memory system is accessed. The compute slices are coupled. Each compute slice includes an LSU which is coupled to a predecessor LSU and a successor LSU. A compiled program is executed as the control unit distributes slice tasks to the compute slices for execution. A slice task, which includes a load instruction, is distributed to a current compute slice. The current compute slice can execute the slice task speculatively. A previously executed store instruction is committed to memory by a predecessor LSU. Address aliasing is checked between an address associated with the previously executed store instruction and the load address associated with the load instruction. The slice task running on the current compute slice can be cancelled when aliasing is detected.
A processor-implemented method for memory operations comprising:
A computer program product embodied in a non-transitory computer readable medium for task processing, the computer program product comprising code which causes one or more processors to generate semiconductor logic for:
A computer system for task processing comprising:
Dependencies are inferred from the claim text.