Morton coordinate adjustment processors, methods, systems, and instructions

US2016139931A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2016139931-A1
Application numberUS-201414542004-A
CountryUS
Kind codeA1
Filing dateNov 14, 2014
Priority dateNov 14, 2014
Publication dateMay 19, 2016
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A processor includes a decode unit to decode an instruction that is to indicate a source packed data operand to include Morton coordinates, a dimensionality of a multi-dimensional space having points that the Morton coordinates are to be mapped to, a given dimension of the multi-dimensional space, and a destination. The execution unit is coupled with the decode unit. The execution unit, in response to the decode unit decoding the instruction, stores a result packed data operand in the destination. The result operand is to include Morton coordinates that are each to correspond to a different one of the Morton coordinates of the source operand. The Morton coordinates of the result operand are to be mapped to points in the multi-dimensional space that differ from the points that the corresponding Morton coordinates of the source operand are to be mapped to by a fixed change in the given dimension.

First claim

Opening claim text (preview).

1 . A processor comprising: a plurality of packed data registers; a decode unit to decode an instruction, wherein the instruction is to indicate a source packed data operand that is to include a plurality of Morton coordinates, a dimensionality of a multi-dimensional space having points that the Morton coordinates are to be mapped to, a given dimension of the multi-dimensional space, and a destination storage location; and an execution unit coupled with the packed data registers and the decode unit, the execution unit, in response to the decode unit decoding the instruction, to store a result packed data operand in the destination storage location, wherein the result packed data operand is to include a plurality of Morton coordinates that are each to correspond to a different one of the Morton coordinates of the source packed data operand, wherein the Morton coordinates of the result packed data operand are to be mapped to points in the multi-dimensional space that differ from the points that the corresponding Morton coordinates of the source packed data operand are to be mapped to by a fixed change in the given dimension indicated by the instruction. 2 . The processor of claim 1 , wherein the execution unit is to store the result packed data operand in which the fixed change in the given dimension is a unit decrement in the given dimension. 3 . The processor of claim 1 , wherein the execution unit is to generate each Morton coordinate of the result packed data operand by: setting all lowest order zeroed bits corresponding to the given dimension of each corresponding Morton coordinate of the source packed data operand, which are lower order than each lowest order set bit corresponding to the given dimension of each Morton coordinate of the source packed data operand; and clearing the lowest order set bit corresponding to the given dimension of each Morton coordinate of the source packed data operand. 4 . The processor of claim 1 , wherein the decode unit is to decode the instruction which is to indicate the dimensionality of the multi-dimensional space as being any one of at least two dimensional and three dimensional. 5 . The processor of claim 4 , wherein the decode unit is to decode the instruction which is to indicate the dimensionality of the multi-dimensional space as being any one of said two dimensional, said three dimensional, and four dimensional. 6 . The processor of claim 1 , wherein the decode unit is to decode the instruction which is to have an immediate to indicate the dimensionality of the multi-dimensional space. 7 . The processor of claim 1 , wherein the decode unit is to decode the instruction which is to have an opcode that is to indicate the dimensionality of the multi-dimensional space. 8 . The processor of claim 1 , wherein the decode unit is to decode the instruction which is to have an immediate that is to include at least two bits to indicate the given dimension as being any one of at least two different dimensions. 9 . The processor of claim 1 , wherein the decode unit is to decode the instruction which is to have at least two bits to indicate the given dimension as being any one of at least three different dimensions. 10 . The processor of claim 1 , wherein the execution unit is to generate the Morton coordinates of the result packed data operand without de-interleaving bits of the Morton coordinates of the source packed data operand that correspond to different dimensions. 11 . The processor of claim 1 , wherein the execution unit is to store the result packed data operand having at least one Morton coordinate that is not to be in sequential Morton order with a corresponding Morton coordinate of the source packed data operand. 12 . The processor of claim 1 , further comprising: a branch prediction unit to predict branches; an instruction prefetch unit coupled with the branch prediction unit, the instruction prefetch unit to prefetch instructions including the instruction; a level 1 (L1) instruction cache coupled with the instruction prefetch unit, the L1 instruction cache to store instructions including the instruction; an L1 data cache to store data; a level 2 (L2) cache coupled with the L1 instruction cache and the L1 data cache, the L2 cache to to store data and instructions; an instruction fetch unit coupled with the L1 instruction cache and the decode unit to fetch the instruction from the L1 instruction cache and provide the instruction to the decode unit; and a register rename unit coupled with the packed data registers to rename the packed data registers. 13 . A method in a processor comprising: receiving a instruction, the instruction indicating a source packed data operand that includes a plurality of Morton coordinates, a dimensionality of a multi-dimensional space having points that the Morton coordinates are mapped to, a given dimension of the multi-dimensional space, and a destination storage location; and storing a result packed data operand in the destination storage location responsive to performing the instruction, the result packed data operand including a plurality of Morton coordinates that each correspond to a different one of the Morton coordinates of the source packed data operand, wherein the Morton coordinates of the result packed data operand are mapped to points in the multi-dimensional space that differ from the points that the corresponding Morton coordinates of the source packed data operand are mapped to by a fixed change in the given dimension indicated by the instruction. 14 . The method of claim 13 , wherein storing the result packed data operand comprises storing the result packed data operand in which the fixed change is a unit decrement in the given dimension. 15 . The method of claim 13 , further comprising generating each Morton coordinate of the result packed data operand by: setting all lowest order zeroed bits corresponding to the given dimension of each corresponding Morton coordinate of the source packed data operand, which are lower order than each lowest order set bit corresponding to the given dimension of each Morton coordinate of the source packed data operand; and clearing the lowest order set bit corresponding to the given dimension of each Morton coordinate of the source packed data operand. 16 . The method of claim 13 , wherein receiving comprises receiving the instruction that is able to indicate the dimensionality of the multi-dimensional space as being any one of at least two dimensional and three dimensional. 17 . The method of claim 13 , wherein receiving comprises receiving the instruction having an immediate that indicates the dimensionality of the multi-dimensional space. 18 . The method of claim 13 , wherein receiving comprises receiving the instruction having an opcode that indicates the dimensionality of the multi-dimensional space. 19 . The method of claim 13 , wherein receiving comprises receiving the instruction having at least two bits that are able to indicate the given dimension as being any one of at least three different dimensions. 20 . The method of claim 13 , further comprising generating the Morton coordinates of the result packed data operand without de-interleaving bits of the Morton coordinates of the source packed data operand that correspond to different dimensions. 21 . A system to process instructions comprising: an interconnect; a processor coupled with the interconnect, the processor to receive an instruction that is to indicate a source packed d

Assignees

Inventors

Classifications

  • Movement instructions, e.g. MOVE, SHIFT, ROTATE, SHUFFLE · CPC title

  • using a mask · CPC title

  • Instruction analysis, e.g. decoding, instruction word fields · CPC title

  • Register arrangements · CPC title

  • Format conversion instructions, e.g. Floating-Point to Integer, decimal conversion · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2016139931A1 cover?
A processor includes a decode unit to decode an instruction that is to indicate a source packed data operand to include Morton coordinates, a dimensionality of a multi-dimensional space having points that the Morton coordinates are to be mapped to, a given dimension of the multi-dimensional space, and a destination. The execution unit is coupled with the decode unit. The execution unit, in resp…
Who is the assignee on this patent?
Intel Corp
What technology area does this patent fall under?
Primary CPC classification G06F9/30025. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu May 19 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).