Vector registers implemented in memory

Information

  • Patent Grant
  • 11175915
  • Patent Number
    11,175,915
  • Date Filed
    Wednesday, October 10, 2018
    6 years ago
  • Date Issued
    Tuesday, November 16, 2021
    3 years ago
Abstract
Systems and methods related to implementing vector registers in memory. A memory system for implementing vector registers in memory can include an array of memory cells, where a plurality of rows in the array serve as a plurality of vector registers as defined by an instruction set architecture. The memory system for implementing vector registers in memory can also include a processing resource configured to, responsive to receiving a command to perform a particular vector operation on a particular vector register, access a particular row of the array serving as the particular register to perform the vector operation.
Description
TECHNICAL FIELD

The present disclosure relates generally to memory, and more particularly, to apparatuses and methods associated with vector registers implemented in memory.


BACKGROUND

Memory devices are typically provided as internal, semiconductor, integrated circuits in computers or other electronic devices. There are many different types of memory including volatile and non-volatile memory. Volatile memory can require power to maintain its data and includes random-access memory (RAM), dynamic random access memory (DRAM), and synchronous dynamic random access memory (SDRAM), among others. Non-volatile memory can provide persistent data by retaining stored data when not powered and can include NAND flash memory, NOR flash memory, read only memory (ROM), Electrically Erasable Programmable ROM (EEPROM), Erasable Programmable ROM (EPROM), and resistance variable memory such as phase change random access memory (PCRAM), resistive random access memory (RRAM), and magnetoresistive random access memory (MRAM), among others.


Memory is also utilized as volatile and non-volatile data storage for a wide range of electronic applications. Non-volatile memory may be used in, for example, personal computers, portable memory sticks, digital cameras, cellular telephones, portable music players such as MP3 players, movie players, and other electronic devices. Memory cells can be arranged into arrays, with the arrays being used in memory devices.


Various computing systems include a number of processing resources that are coupled to memory (e.g., a memory system), which is accessed in association with executing a set of instructions (e.g., a program, applications, etc.). The number of processing resources can access data stored in the memory.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of a computing system including a memory system and capable of mapping registers implemented in an array of memory cells in accordance with a number of embodiments of the present disclosure.



FIG. 2 is a block diagram of a memory bank capable of mapping registers implemented in an array of memory cells in accordance with a number of embodiments of the present disclosure.



FIG. 3 is a block diagram of a mapping of map registers to vector registers in accordance with a number of embodiments of the present disclosure.





DETAILED DESCRIPTION

The present disclosure includes apparatuses and methods related to mapping registers implemented in an array of memory cells. An example system can include an array of memory cells, where a plurality of rows in the array serve as a plurality of vector registers as defined by an instruction set architecture. The example system can also include a processing resource configured to, responsive to receiving a command to perform a particular vector operation on a particular vector register, access a particular row of the array serving as the particular register to perform the vector operation.


Computing systems can include registers which correspond to a host and/or a processing resource such as a central processing unit (CPU). Registers store data to fulfil requests for the data in a smaller duration of time than if the data is retrieved from memory. For example, a processing resource may access data stored in registers local to the processing resource in a smaller duration of time than a time used to access data from memory. Accessing data from a memory device may include transferring the data through a bus which may increase the duration used to retrieve the data as compared to retrieving the data from registers, where the bus couples a processing resource accessing the data to the memory device. Data may be retrieve faster from registers than from memory resources such as a dynamic random-access memory (DRAM) array. As such, it may be beneficial to implement registers local to processing resources.


Implementing registers local to a processing resource can include moving data from the memory array to the registers. Moving data from the memory array to the registers can take longer than utilizing the array itself as registers. Implementing registers local to the processing resource can also increase the cost of manufacturing the processing resource.


In a number of examples, rows of an array can serve as respective registers, which can provide benefits such as reducing the cost of manufacturing registers external from the array and/or can improve system operation by reducing the time associated with moving data between the array and external registers. For example, particular rows of memory cells in an array of a memory device can be utilized as respective vector registers. Each row can be mapped to a specific vector register. The mapping can be performed with or without map registers.


Vector registers can be utilized by a processing resource local to the memory device or a processing resource external to the memory device to access data. The processing resource local to the memory device can be a processing in memory (PIM) processing resource, a bank controller, and/or an application processor, for example.


In the examples described herein, the processing resource external to the memory resource and the processing resource local to the memory resource can share a same instruction set. For example, the external processing resource and the internal processing resource can share an instruction set architecture (ISA). Sharing an ISA provides the external processing resource the ability to provide instructions to the internal processing resource that the external processing resource could itself execute. Implementing vector registers in an array using the map registers facilitates the use of a shared instruction set given that references to the registers can be executed by both the external processing resource and/or the internal processing resource using a limited set of map registers without having the added cost of implementing registers in the memory system.


In some examples, the vector registers can be implemented without the use of map registers. The mapping between vector registers and row of the array can be hard coded into the memory device. Hard coded mappings can map vector registers to rows without providing the ability to reassign vector registers to different rows.


In the following detailed description of the present disclosure, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration how a number of embodiments of the disclosure may be practiced. These embodiments are described in sufficient detail to enable those of ordinary skill in the art to practice the embodiments of this disclosure, and it is to be understood that other embodiments may be utilized and that process, electrical, and/or structural changes may be made without departing from the scope of the present disclosure. As used herein, the designator “N” indicates that a number of the particular feature so designated can be included with a number of embodiments of the present disclosure.


As used herein, “a number of” something can refer to one or more of such things. For example, a number of memory devices can refer to one or more of memory devices. A “plurality” of something intends two or more. Additionally, designators such as “N,” as used herein, particularly with respect to reference numerals in the drawings, indicates that a number of the particular feature so designated can be included with a number of embodiments of the present disclosure.


The figures herein follow a numbering convention in which the first digit or digits correspond to the drawing figure number and the remaining digits identify an element or component in the drawing. Similar elements or components between different figures may be identified by the use of similar digits. As will be appreciated, elements shown in the various embodiments herein can be added, exchanged, and/or eliminated so as to provide a number of additional embodiments of the present disclosure. In addition, the proportion and the relative scale of the elements provided in the figures are intended to illustrate various embodiments of the present disclosure and are not to be used in a limiting sense.



FIG. 1 is a block diagram of a computing system 100 including a memory system 116 and capable of mapping registers implemented in an array of memory cells in accordance with a number of embodiments of the present disclosure. The computing system 100 includes a host 103 and the memory system 116. The host 103 includes a processing resource 102 among other possible devices such as registers (not shown). The memory system 116 includes map registers 106, a processing resource 108, and a memory array 110, among other possible devices.


As used herein, an “apparatus” can refer to, but is not limited to, a variety of structures or combinations of structures, such as a circuit or circuitry, a die or one or more die, a device or devices, or a system or systems. For example, system 100, the processing resource 102, the map registers 106, the processing resource 108, the memory array 110, and/or the memory system 116 may separately be referred to as an “apparatus.”


The memory system 116 includes a number of memory devices, one of which is shown. The memory devices can comprise a number of physical memory “chips,” or die which can each include a number of arrays (e.g., banks) of memory cells and corresponding support circuitry (e.g., address circuitry, I/O circuitry, control circuitry, read/write circuitry, etc.) associated with accessing the array(s) (e.g., to read data from the arrays and write data to the arrays). As an example, the memory devices can include a number of DRAM devices, SRAM devices, PCRAM devices, RRAM devices, FeRAM, phase-change memory, 3DXP, and/or Flash memory devices. The memory device can also comprise a single physical memory “chip” or die which can include a number of arrays (e.g., banks) of memory cells and corresponding support circuitry (e.g., address circuitry, I/I circuitry, control circuitry, read/write circuitry, etc.) associated with accessing the array(s) (e.g., to read data from the arrays and write data to the arrays). In a number of embodiments, the memory system 116 can serve as main memory for the computing system.


In this example, the computing system 100 includes the host 103 coupled to the memory system 116 via a bus 105. The computing system 100 can be a laptop computer, personal computers, digital camera, digital recording and playback device, mobile telephone, PDA, memory card reader, interface hub, sensor, Internet-of-Things (IoT) enabled device, among other systems, and the processing resource 102 can be a number of processing resources (e.g., one or more processors) capable of accessing the array via the processing resource 108. The host 103 may be responsible for execution of an operating system (OS) and/or various applications that can be loaded thereto (e.g., from the memory system 116 and/or the processing resource 108).


The processing resource 108 can also include a state machine, a sequencer, and/or some other type of control circuitry, which may be implemented in the form of an application specific integrated circuit (ASIC) coupled to a printed circuit board. The processing resource 108 can be a controller such as a bank controller. A bank controller can, in some examples, perform vector operations on data stored in the array 110 using the map registers 106. The vector operations can be received from the host 103 and/or can be retrieved from the array 110. The bank controller can perform multiple types of operations including vector operations, read operations, and write operations, among other types of operations.


In some instances, the host 103 and/or the processing resource 108 can be an application processor. The application processor can be on a same memory die as the memory system 116.


In some examples, the memory device 116 can be a PIM device capable of performing processing. The PIM device can perform processing in addition to or instead of the processing performed by the processing resource 102. For example, the memory device 116 can include a processing resource in the sensing circuitry of the array 110 as shown in FIG. 2. The PIM device can perform processing functions without moving data out of the array 110 and/or the sensing circuitry.


As used herein, vector operations include operations performed using a plurality of values. For example, a vector addition operation can perform multiple addition operations concurrently using multiple data values. For instance, a vector addition operation can include a first addition operation and a second addition operation. The first addition operation can be performed using a first data value and a second data value while the second addition operation can be performed using a third data value and a fourth data value. Vector operations are not to be limited to addition operations and/or subtraction operations but can include logical operations including addition operations, subtraction operations, multiplication operations, division operations, and/or inversion operations, among other types of logical operations. The logical operations can also include bitwise operations including conjunction operations (e.g., AND operations) and/or disjunction operations (e.g., OR operations), among other bitwise operations.


As used herein, a value (e.g., data value) can include a grouping of one or more bits. Multiple values can be combined into a vector. For example, a vector of data can include 513 values where each of the 513 values is defined utilizing 32 bits. In some examples, the vector of values can be the grouping of multiple values into a single vector.


The read and write operations can be used to manipulate data stored in the array 110. For example, a read operation can transfer data from the array 110 to the processing resources 102 and/or 108. A write operation can store data received by the processing resources 102 and/or 108, where the data is stored in the array 110.


The processing resource 108 can perform logical operations and/or vector operations utilizing the data stored in the memory array 110 in vector registers. For instance, the processing resource 102 can provide instructions to the processing resource 108 through the bus 105. The instructions can identify a logical operation to perform by referencing one or more vector registers that store vector data. A vector register can comprise a plurality of memory cells of the array 110.


The map registers 106 can map memory cells to identifications (IDs) of the vector registers such that references to the vector register can be resolved to memory cells of the array 110. In some examples, the logical operation can reference vector registers which store the data. For example, the logical operation can be an addition operation which references a first vector register and a second vector register using a first register identifier and a second register identifier. References to the registers can be resolved utilizing the map registers 106m, the first register identifier, and/or the second register identifier. For example, the first register can be associated with the first map register through the first register identifier and the second register can be associated with the second map register through the second register identifier.


The first map register can store a first memory address of the array 110 which identifies a first row of memory cells that store a first vector value. A row of memory cells can include a plurality of memory cells commonly coupled to an access line of the memory array 110. The second map register can store a second memory address of the array 110 which identifies a second row of memory cells that store a second vector value.


The processing resource 108 can retrieve the first value and the second value utilizing the first memory address and the second memory address retrieved from the map registers 106. The processing resource 108 can utilize the first value and the second value to perform the addition operation.


In some examples, the processing resource 102 can provide vector data to be stored in vector registers of the memory system 116. The vector data can be transferred between the host 103 and the memory system 116 over interfaces which can comprise physical interfaces such as buses (e.g., bus 105), for example, employing a suitable protocol. Such protocol may be custom or proprietary. The bus 105 may employ a standardized protocol, such as Peripheral Component Interconnect Express (PCIe), Gen-Z, CCIX, or the like. As an example, the bus 105 may comprise combined address, command, and data buses or separate buses for respective address, command, and data signals.


The map registers 106 can store a number of bits which are fewer in quantity than the bits stored in the registers corresponding to the processing resource 102. The map registers 106 can store memory addresses corresponding to the array 110. In some examples, the memory addresses stored in the map registers 106 can identify a single memory cell or multiple memory cells. For instance, the map registers 106 can utilize 16 bits to store a memory address. Although, the map registers 106 can utilize more or fewer bits to store memory addresses.


The map registers 106 can be associated with a vector register ID. For example, a first map register can store a memory address and can be associated with a vector register ID. The map registers 106 can map vector register ID, and by extension vector registers, to memory cells of the array 110. The mapping of vector registers to the memory cells provides access to the memory cells as vector registers without the added expense of implementing the memory cells and the vector registers separately.


In some examples, the map registers 106 can comprise a single map register or multiple map registers. In instances utilizing a single map register, the map register can store an address of memory cells that store vector data. The processing resource 108 can extract a first memory address from a map register. The processing resource 108 can extract vector data from a first group of memory cells having the first memory address. The processing resource 108 can then execute the vector operations utilizing the vector data.


The processing resource 108 can be configured to perform logical operations and/or vector operations. The processing resource can be configured to perform vector operations, for example, utilizing an extension to core capabilities implemented by the processing resource 108.



FIG. 2 is a block diagram of a memory bank 220 capable of mapping registers implemented in an array of memory cells in accordance with a number of embodiments of the present disclosure. The memory bank 220 includes a processing resource 208, mapping registers 206, and a memory array 210. The map registers 206, the processing resource 208, and the memory array 210 are analogous to the map registers 106, the processing resource 108, and the memory array 110 in FIG. 1.


In this example, the memory array 210 is a DRAM array of 1T1C (one transistor one capacitor) memory cells 270-0, . . . , 270-M, 271-0, . . . , 271-M, 272-0, . . . , 272-M, 273-0, . . . , 273-M, . . . , 27N-0, 27N-M (e.g., referred to as memory cells 270), each comprised of an access device 224 (e.g., transistor) and a storage element 226 (e.g., a capacitor).


In a number of embodiments, the memory cells 270 are destructive read memory cells (e.g., reading the data stored in the cells destroys the data such that the data originally stored in the cells is refreshed after being read). The memory cells 270 can also be non-destructive read memory cells (e.g., reading the data stored in the cells does not destroy the data). As such, the memory cells 270 can be volatile or non-volatile memory cells.


The memory cells 270 are arranged in rows coupled by access lines 228-0 (Row0), 228-1 (Row1), 228-2 (Row2), 228-3 (Row3), 228-N (RowN) (e.g., referred to collectively as access lines 228) and columns coupled by sense lines (e.g., digit lines) 222-0 (D), 222-1 (D_), 222-M (D), 222-M+1 (D_) (e.g., referred to collectively as sense lines 222). In a number of embodiments, the array 210 can include address spaces that are coupled to separate circuitry.


The access lines may be referred to herein as word lines or select lines. The sense lines may be referred to herein as digit lines or data lines.


In this example, each column of cells is associated with a pair of complementary sense lines such as complementary sense lines 222-0 (D) and 222-1 (D_). The structure illustrated in FIG. 2 may be used to provide many complimentary sense lines 222, access lines 228 and/or memory cells 270. Although only four columns of memory cells 270 are illustrated in FIG. 2, embodiments are not so limited. For instance, a particular array may have a number of columns of cells and/or sense lines (e.g., 4,096, 8,192, 16,384, etc.). In FIG. 2, memory cells 270-0 to 27N-0 are coupled to sense line 222-0. Although the memory cell 27N-0 shows the variable N in the ones place, it is to be understood that the memory cell 27N-0 can be any number greater than 270-0. A gate of a particular cell transistor 224 is coupled to its corresponding access line from the access lines 228-0 to 228-N (e.g., referred to collectively as access lines 228), a first source/drain region is coupled to its corresponding sense line 222-0, and a second source/drain region of a particular cell transistor is coupled to its corresponding capacitor (e.g., capacitor 226). Although not illustrated in FIG. 2, the sense lines 222-1 and 222-M+1, may also have memory cells coupled thereto.


In a number of examples, memory cells 270 that are coupled to sense line 222-0 can store bits. The bits can represent a logical representation of a value and/or a number of values. For example, a first value can be represented by a three bit-vector that can be stored in memory cell 270-0, memory cell 270-1, and memory cell 270-2 along access line 228-0. In a number of examples, a bit-vector can be represented by more or fewer bits than those discussed in FIG. 2. Other examples bit-vectors can be represented by a 4-bit vector, an 8 bit-vector, a 16 bit-vector, and/or a 32 bit-vector, among other bit-vector dimensions. In a number of examples, each bit-vector representation of a value can be stored horizontally along access lines 228 as opposed to vertically along sense lines 222.


In some instances, the memory cells coupled to an access line 228-0 and to a number of sense lines (e.g., sense line 222-0 to sense line 222-M+1) can be activated in parallel. Furthermore, memory cell 270-0, memory cell 270-1, memory cell 270-2, memory cell 270-3 can also be activated in parallel. In a number of examples, independently addressed access lines 228 and/or sense lines 222 can be activated in parallel to activate a number of memory cells in parallel.


The memory array 210 can also comprise sensing components 230-1 to 230-M, which may be referred to generally as sensing components 230. The sensing components 230 can also be referred to as sensing circuitry. FIG. 2 also shows the sensing components 230 coupled to the memory array 210. The sensing component 230-0 is coupled to the complementary sense lines D, D_ corresponding to a particular column of memory cells and the sensing component 230-M is coupled to complementary sense lines. The sensing component 230 can be operated to determine a state (e.g., logic data value) stored in a selected cell (e.g., memory cells 270). Embodiments are not limited to a given sensing amplifier architecture or type. For instance, sensing circuitry, in accordance with a number of embodiments described herein, can include current-mode sense amplifiers and/or single-ended sense amplifiers (e.g., sense amplifiers coupled to one sense line). The sensing circuitry can also include compute components. For example, the sensing circuitry 230 can include sense amplifiers and compute components such that each of the sensing components 230 can serve as a 1-bit processing element of a processing resource.


A sense amplifier of the sensing components 230-0 can comprise a first latch and the compute component of the sensing component 230-0 can comprise a second latch. The first latch and the second latch can be used to perform logical operations including vector operations. The processing resource can be a controller and the sensing components 230 can serve as the processing resource performing vector operations on the vector registers.


In a number of examples, the processing resource 208 can receive a command to access data from a register such as a vector register. The command can be received from a processing resource local to a host and/or external to the bank 220. The command can instruct the processing resource 208 to initiate an execution of a number of logical operations. The specific logical operations to be executed can be stored in the memory array and/or can be provided by the host.


The processing resource 208 can identify a map register corresponding to a vector register. In some examples, the processing resource 208 can identify a map register utilizing an ID of the vector register. For instance, each of the map registers 206 can be associated with a different vector register ID. The processing resource 208 can store a table that maps vector register IDs to map registers 206. In some examples, the mapping between vector register IDs and map registers 206 can be stored in the array 210 (e.g., as table 155 shown in FIG. 1).


In other examples, the processing resource 208 can identify a map register based on a default setting. For example, the processing resource 208 can identify a same map register each time the command is received. The default map register can store a memory address corresponding to a plurality of memory cells that store vector data to use as an operand in a vector operation.


The processing resource 208 can retrieve a memory address from the map register, wherein the address identifies a row of memory cells from the array and wherein the row of memory cells is coupled to a plurality of sense lines and an access line (e.g., select line). For example, the processing resource 208 can retrieve a memory address corresponding to the memory cells 270-0 to 270-M. The memory address can identify a range of memory addresses by, for example, providing a base memory address and an offset. The memory address can also identify a row of memory addresses such as by identifying the Row 0 and/or an access line 228-0 to which the memory cells 270-1 to 270-M are coupled to. As used herein, the use of a row is not intended to identify physical orientation but rather an organizational orientation such that a row and/or a row of memory cells identifies memory cells coupled to a particular access line.


The processing resource 208 can then retrieve the data from the array of memory cells using the memory address. For example, the processing resource can retrieve vector data from the memory cells 270-0 to 270-M using the memory address retrieved from the map registers 206.


Mapping a given register to memory cells of the memory array 210 utilizing the map registers 206 provides the ability to utilize the memory cells as a register such as a vector register. The mapping allows multiple registers to be implemented the memory array 210. The mapping further provides the ability to create and delete registers as needed, by mapping to additional addresses or fewer addresses. Although in some examples, the quantity of registers can be fixed by the ISA.


Mapping to memory cells further provides the ability to move data without physically moving data between vector registers implemented utilizing the memory array 210. For example, if vector data is stored in a first register implemented in a first Row (e.g., Row 0) of the memory array 210 and if the result of the execution of a vector operation utilizing the vector data is stored in a second Row (e.g., Row 1) of the memory array 210, then the result of the execution of the vector operation can be moved from the first vector register to the second vector register by replacing a first memory address, corresponding to the first Row, stored in a map register with a second memory address corresponding to the second Row. That is, the result does not have to be moved from one group of memory cells to a different group of memory cells to move the result from one vector register to a different vector register. The result of the vector operation can be stored a single time in a group of memory cells and the address corresponding to the group of memory cells can be manipulated by storing it in the map registers to “move” the result.


The map registers 206 provide a mapping of the memory cells to vector registers. An example mapping is provided in FIG. 3.


Responsive to executing the vector operation, the processing resource 208 can execute further vector operations, for example, by receiving an ID of a next vector register that stores the vector data. The host can provide additional vector commands and/or can identify a location in the array 210 that stores the vector commands.


In some examples, the processing resource 208 can access vector data to perform non-vector operations. The vector data can be accessed, for example, as part of a read operation and/or a write operation.



FIG. 3 is a block diagram of a mapping of map registers to vector registers in accordance with a number of embodiments of the present disclosure. FIG. 3 includes the memory array 310. FIG. 3 also includes vector register IDs 332-1, . . . , and 332-32, referred to as vector register IDs 332, and map registers 306-1, . . . , 306-32, referred to as map registers 306. The vector register IDs can be obtained, for example, from logical operations, directly from a processing resource external to a bank, and/or from the array 310. In some examples, the vector register IDs can include vector address as defined by the ISA.


In some examples, there can be a one-to-one correlation between the vector register IDs 332 and the map registers 306. For example, the vector register ID 332-1 can be mapped to the map register 306-1, the vector register ID 332-2 can be mapped to the map register 306-2, the vector register ID 332-3 can be mapped to the map register 306-3, . . . , the vector register ID 332-30 can be mapped to the map register 306-30, the vector register ID 332-31 can be mapped to the map register 306-31, and the vector register ID 332-32 can be mapped to the map register 306-32. The example provided in FIG. 3 describes thirty-two vector registers and thirty-two vector register IDs. However, the vector registers and/or the vector register IDs should not be limited to thirty-two but can include more or fewer vector registers and/or vector register IDs.


In other examples, multiple vector register IDs can be mapped to a single map register or a vector register ID may not be mapped to one of the map registers 306. The mapping of vector register IDs to map registers can provide the ability to adapt the ISA to a specific implementation of vector registers implemented in the memory array 310.


The map registers 306 can store an address corresponding to one of the rows of memory cells. For example, the map register 306-1 can store an address of the Row 334-2, the map register 306-2 can store an address of the Row 334-1, the map register 306-3 can store an address of the Row 334-4, . . . , the map register 306-30 can store an address of the Row 334-3, the map register 306-31 can store an address of the Row 334-5, and the map register 306-32 can store an address of the Row 334-6.


In some examples, a processing resource local to a bank can receive a plurality of addresses of an array of memory cells of a memory device. The memory addresses can identify memory cells that store vector data. The vector data may have been stored previously in the memory cells having the memory addresses.


The processing resource can store the plurality of addresses in a plurality of map registers of the memory device. The processing resource can then retrieve a memory address from the plurality of map registers, where the memory address corresponds to a first plurality of memory cells coupled to a plurality of sense lines and an access line which identify a Row 334-2 of the memory array 310.


The processing resource can also retrieve a vector instruction from the array 310 and/or can receive the vector instruction from a host. The processing resource can execute the vector instruction. In some examples, the vector instruction is executed using data stored in the first plurality of memory cells of the array.


In some examples, the vector instruction can be executed using data extracted from the vector instruction itself. The vector instruction can include data as part of the instruction. In other examples, the vector instructions can include references to vector registers. The vector instructions can also include references to vector registers and can include data as part of the vector instructions.


In some instances, a vector instruction can be a move operation and/or can include performing a move operation to perform the vector instruction. A move operation can move data stored in vector register 1 to a vector register 2. The vector register 1 can have a vector register identifier 332-2 and the vector register 2 can have a vector register identifier 332-1. Moving data from vector register 1 to vector register 2 can include moving/copying an address stored in map register 306-1 to map register 306-2.


This example illustrates the savings gained by implementing the vector register in rows 334 of the memory array 310. If the vector registers were implemented without utilizing the memory array, 310 moving data from one register to a different register would include moving a vector of data, which could, for example, include moving 16,384 bits of data. However, implementing the vector registers utilizing rows of the memory array 310, a move operation can include moving an address from a map register to a different map register. Moving an address between map registers may include moving 16 bits, given that a memory address may expressed in 16 bits.


In some examples, a processing resource local to a bank can receive a vector data. The processing resource can store the vector data in the memory array 310 and can store the corresponding addresses in the map registers 306 to build a mapping between the map registers 306 and the rows 334 of memory arrays.


Though specific embodiments have been illustrated and described herein, those of ordinary skill in the art will appreciate that an arrangement calculated to achieve the same results can be substituted for the specific embodiments shown. This disclosure is intended to cover adaptations or variations of various embodiments of the present disclosure. It is to be understood that the above description has been made in an illustrative fashion, and not a restrictive one. Combinations of the above embodiments, and other embodiments not specifically described herein will be apparent to those of skill in the art upon reviewing the above description. The scope of the various embodiments of the present disclosure includes other applications in which the above structures and methods are used. Therefore, the scope of various embodiments of the present disclosure should be determined with reference to the appended claims, along with the full range of equivalents to which such claims are entitled.


In the foregoing Detailed Description, various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the disclosed embodiments of the present disclosure have to use more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment.

Claims
  • 1. An apparatus, comprising: an array of memory cells, wherein a plurality of rows in the array serve as a plurality of vector registers as defined by an instruction set architecture; anda processing resource configured to: receive a vector register identification (ID) of a particular vector register, wherein the vector register ID is received from a host processing resource;retrieve, from a table stored in the array of memory cells, a map register ID using the vector register ID;retrieve a memory address of a row of memory cells from a map register having the map register ID, wherein the memory address corresponds to memory cells commonly coupled to a particular row of the array; andreceive vector instructions from the host processing resource, wherein the vector instructions are received to perform a particular vector operation corresponding to the vector instructions on the particular vector register and wherein the vector instructions are executable by the processing resource and by the host processing resource as defined by the instruction set architecture which is shared between the processing resource and the host processing resource such that the host processing resource and the processing resource of the memory device, which are separated by a bus, are able to execute a vector instruction defined by the instruction set architecture where the particular vector operation corresponds to the vector instructions;extract additional data from the vector instructions;responsive to receiving the vector instructions, access data from the particular row of the array to perform the particular vector operation, wherein the data is accessed as part of a write operation;responsive to accessing the particular row of the array, perform the particular vector operation on the data accessed from the particular row of the array and the additional data extracted from the vector instructions, wherein the data and the additional data are used as operands, wherein performing the particular vector operation includes replacing a memory address, corresponding to the particular row, stored in the map register with a different memory address corresponding to a different row of memory cells of the array where results of the particular vector operation are stored.
  • 2. The apparatus of claim 1, wherein each row of the plurality of rows comprises a group of memory cells commonly coupled to one of a respective plurality of access lines of the array.
  • 3. The apparatus of claim 1, wherein the processing resource is a controller and is further configured to execute a plurality of operations utilizing the data accessed from the particular row.
  • 4. The apparatus of claim 3, wherein the processing resource is further configured to, without transferring the data, accessed from the particular row, to a host to which the processing resource is coupled: execute the plurality of operations; andcause storing of a result of the execution of the plurality of operations in the plurality of rows.
  • 5. The apparatus of claim 1, wherein the processing resource is further configured to map the particular vector register to the particular row utilizing the map register, wherein the map register stores an address of the particular row.
  • 6. The apparatus of claim 1, wherein the processing resource is further configured to access the particular row utilizing the vector register ID corresponding to the particular vector register.
  • 7. The apparatus of claim 6, wherein the vector register ID is defined by the instruction set architecture.
  • 8. A method for accessing vector registers, comprising: receiving, at a memory device, a plurality of memory addresses of an array of memory cells, wherein each of the plurality of memory addresses corresponds to a row of memory cells from the array of memory cells;storing the plurality of memory addresses in a plurality of map registers of the memory device;receiving vector instructions from a host processing resource to perform a vector operation corresponding to the vector instructions;extracting additional data from the vector instructions;receiving, at the memory device, a vector identification (ID) corresponding to a vector register as defined by an instruction set architecture, wherein the vector ID is received from the host processing resource and wherein the host processing resource is external to the memory device, andwherein the instruction set architecture is shared by the host processing resource and a first processing resource of the memory device such that the host processing resource and the first processing resource of the memory device, which are separated by a bus, are able to execute a vector instruction defined by the instruction set architecture where the vector operation corresponds to the vector instructions; andretrieving, from a table stored in the array of memory cells, a map register ID utilizing the vector ID;retrieving, via the first processing resource, a memory address from a map register having the map register ID, wherein the memory address corresponds to a first group of memory cells commonly coupled to an access line of the array;accessing, via a second processing resource of the memory device, vector data from the first group of memory cells using the memory address, wherein the vector data is accessed as part of a write operation; andexecuting the vector operation on the vector data and the additional data wherein the data and the additional data are used as operands, wherein the vector operation is executed by the second processing resource of the memory device and wherein the second processing resource comprises compute components of sensing circuitry of the memory device, and wherein performing the vector operation includes replacing the memory address, corresponding to a particular row, stored in the map register with a different memory address corresponding to a different row of memory cells of the array where results of the vector operation are stored.
  • 9. The method of claim 8, wherein the map register stores a memory address corresponding to a particular row comprising the first group of memory cells commonly coupled to the access line of the array.
  • 10. The method of claim 9, further comprising receiving, at the first processing resource, a request to update the vector register, wherein the request includes a new memory address of the array.
  • 11. The method of claim 10, wherein the new memory address identifies a different row designated as the vector register.
  • 12. The method of claim 11, further comprising storing the new memory address in the map register to map the vector register to the different row.
  • 13. The method of claim 12, wherein the vector register is updated without moving data stored in the particular row to the different row.
  • 14. The method of claim 8, wherein the plurality of memory addresses is received from a host.
  • 15. The method of claim 8, wherein the vector operation is executed using the vector data stored in the first group of memory cells and vector data stored in a second group of memory cells of the array, wherein the second group of memory cells are a different vector register.
  • 16. A system, comprising: a memory device comprising: an array of memory cells;a plurality of map registers to map vector register identifications (IDs), defined by an instruction set architecture, to rows of the array;sensing circuitry comprising a plurality of compute components coupled to sense lines of the array; anda processing resource configured to: receive a vector register ID from a host processing resource external to the memory device;receive vector instructions from the host processing resource to perform a vector operation, corresponding to the vector instructions, on a particular vector register;extract additional data from the vector instructions;cause the vector operation received from the host processing resource to be executed using the additional data and data stored in a row of the array as operands by: accessing, from a table stored in the array of memory cells, a map register ID utilizing the vector register ID;accessing a memory address of a row of memory cells from the map register, using the map register ID, to determine to which row in the array the particular vector register currently maps; andaccessing the row in the array to which the particular vector register currently maps, wherein the row is accessed as part of a write operation;wherein the compute components are configured to execute the vector operation using the additional data and the data stored in the row of the array, andwherein the processing resource is further configured to perform a non-vector operation using the additional data and the data stored in the row of the array wherein the non-vector operation is performed using the data and the additional data as operands and wherein performing the non-vector operation includes replacing the memory address, corresponding to the row, stored in the map register with a different memory address corresponding to a different row of memory cells of the array where results of the particular vector operation are stored.
  • 17. The system of claim 16, wherein the particular vector register is identified using the vector register ID.
  • 18. The system of claim 16, wherein the processing resource is further configured to receive a vector command corresponding to the vector operation from the host processing resource, wherein the vector operation includes the particular vector register.
  • 19. The system of claim 16, wherein the processing resource is further configured to resolve references to the particular vector register using the map registers.
  • 20. The system of claim 16, wherein the vector operation is executable to perform a move operation for moving data stored in a different vector register to the particular vector register.
  • 21. The system of claim 16, wherein the vector operation is executable to perform a move operation for moving data stored in the particular vector register to a different vector register.
  • 22. The system of claim 21, wherein the processing resource is further configured to move a memory address stored in the map register to a different map register, wherein the map register corresponds to the particular vector register and the different map register corresponds to the different vector register.
  • 23. The system of claim 16, wherein the memory device is a DRAM device, and wherein a host comprises the host processing resource.
US Referenced Citations (375)
Number Name Date Kind
4380046 Fung Apr 1983 A
4435792 Bechtolsheim Mar 1984 A
4435793 Ochii Mar 1984 A
4727474 Batcher Feb 1988 A
4843264 Galbraith Jun 1989 A
4958378 Bell Sep 1990 A
4977542 Matsuda et al. Dec 1990 A
5023838 Herbert Jun 1991 A
5034636 Reis et al. Jul 1991 A
5201039 Sakamura Apr 1993 A
5210850 Kelly et al. May 1993 A
5253308 Johnson Oct 1993 A
5276643 Hoffmann et al. Jan 1994 A
5325519 Long et al. Jun 1994 A
5367488 An Nov 1994 A
5379257 Matsumura et al. Jan 1995 A
5386379 Ali-Yahia et al. Jan 1995 A
5398213 Yeon et al. Mar 1995 A
5440482 Davis Aug 1995 A
5446690 Tanaka et al. Aug 1995 A
5473576 Matsui Dec 1995 A
5481500 Reohr et al. Jan 1996 A
5485373 Davis et al. Jan 1996 A
5506811 McLaury Apr 1996 A
5615404 Knoll et al. Mar 1997 A
5638128 Hoogenboom Jun 1997 A
5638317 Tran Jun 1997 A
5654936 Cho Aug 1997 A
5678021 Pawate et al. Oct 1997 A
5724291 Matano Mar 1998 A
5724366 Furutani Mar 1998 A
5751987 Mahant-Shetti et al. May 1998 A
5787458 Miwa Jul 1998 A
5854636 Watanabe et al. Dec 1998 A
5867429 Chen et al. Feb 1999 A
5870504 Nemoto et al. Feb 1999 A
5915084 Wendell Jun 1999 A
5935263 Keeth et al. Aug 1999 A
5986942 Sugibayashi Nov 1999 A
5991209 Chow Nov 1999 A
5991785 Alidina et al. Nov 1999 A
6005799 Rao Dec 1999 A
6009020 Nagata Dec 1999 A
6092186 Betker et al. Jul 2000 A
6094716 Witt Jul 2000 A
6122211 Morgan et al. Sep 2000 A
6125071 Kohno et al. Sep 2000 A
6134164 Lattimore et al. Oct 2000 A
6147514 Shiratake Nov 2000 A
6151244 Fujino et al. Nov 2000 A
6157578 Brady Dec 2000 A
6163862 Adams et al. Dec 2000 A
6166942 Vo et al. Dec 2000 A
6172918 Hidaka Jan 2001 B1
6175514 Henderson Jan 2001 B1
6178482 Sollars Jan 2001 B1
6181698 Hariguchi Jan 2001 B1
6208544 Beadle et al. Mar 2001 B1
6226215 Yoon May 2001 B1
6301153 Takeuchi et al. Oct 2001 B1
6301164 Manning et al. Oct 2001 B1
6304477 Naji Oct 2001 B1
6389507 Sherman May 2002 B1
6418498 Martwick Jul 2002 B1
6466499 Blodgett Oct 2002 B1
6510098 Taylor Jan 2003 B1
6563754 Lien et al. May 2003 B1
6578058 Nygaard Jun 2003 B1
6594754 Jourdan Jul 2003 B1
6731542 Le et al. May 2004 B1
6754746 Leung et al. Jun 2004 B1
6768679 Le et al. Jul 2004 B1
6807614 Chung Oct 2004 B2
6816422 Harnade et al. Nov 2004 B2
6819612 Achter Nov 2004 B1
6894549 Eliason May 2005 B2
6943579 Hazanchuk et al. Sep 2005 B1
6948056 Roth et al. Sep 2005 B1
6950771 Fan et al. Sep 2005 B1
6950898 Merritt et al. Sep 2005 B2
6956770 Khalid et al. Oct 2005 B2
6961272 Schreck Nov 2005 B2
6965648 Smith et al. Nov 2005 B1
6985394 Kim Jan 2006 B2
6987693 Cernea et al. Jan 2006 B2
7020017 Chen et al. Mar 2006 B2
7028170 Saulsbury Apr 2006 B2
7045834 Tran et al. May 2006 B2
7054178 Shiah et al. May 2006 B1
7061817 Raad et al. Jun 2006 B2
7079407 Dimitrelis Jul 2006 B1
7173857 Kato et al. Feb 2007 B2
7187585 Li et al. Mar 2007 B2
7196928 Chen Mar 2007 B2
7260565 Lee et al. Aug 2007 B2
7260672 Garney Aug 2007 B2
7372715 Han May 2008 B2
7400532 Aritome Jul 2008 B2
7406494 Magee Jul 2008 B2
7447720 Beaumont Nov 2008 B2
7454451 Beaumont Nov 2008 B2
7457181 Lee et al. Nov 2008 B2
7535769 Cernea May 2009 B2
7546438 Chung Jun 2009 B2
7562198 Noda et al. Jul 2009 B2
7574466 Beaumont Aug 2009 B2
7602647 Li et al. Oct 2009 B2
7663928 Tsai et al. Feb 2010 B2
7685365 Rajwar et al. Mar 2010 B2
7692466 Ahmadi Apr 2010 B2
7752417 Manczak et al. Jul 2010 B2
7791962 Noda et al. Sep 2010 B2
7796453 Riho et al. Sep 2010 B2
7805587 Van Dyke et al. Sep 2010 B1
7808854 Takase Oct 2010 B2
7827372 Bink et al. Nov 2010 B2
7869273 Lee et al. Jan 2011 B2
7898864 Dong Mar 2011 B2
7924628 Danon et al. Apr 2011 B2
7937535 Ozer et al. May 2011 B2
7957206 Bauser Jun 2011 B2
7979667 Allen et al. Jul 2011 B2
7996749 Ding et al. Aug 2011 B2
8042082 Solomon Oct 2011 B2
8045391 Mohklesi Oct 2011 B2
8059438 Chang et al. Nov 2011 B2
8095825 Hirotsu et al. Jan 2012 B2
8117462 Snapp et al. Feb 2012 B2
8164942 Gebara et al. Apr 2012 B2
8208328 Hong Jun 2012 B2
8213248 Moon et al. Jul 2012 B2
8223568 Seo Jul 2012 B2
8238173 Akerib et al. Aug 2012 B2
8274841 Shimano et al. Sep 2012 B2
8279683 Klein Oct 2012 B2
8310884 Iwai et al. Nov 2012 B2
8332367 Bhattacherjee et al. Dec 2012 B2
8339824 Cooke Dec 2012 B2
8339883 Yu et al. Dec 2012 B2
8347154 Bahali et al. Jan 2013 B2
8351292 Matano Jan 2013 B2
8356144 Hessel et al. Jan 2013 B2
8417921 Gonion et al. Apr 2013 B2
8462532 Argyres Jun 2013 B1
8484276 Carlson et al. Jul 2013 B2
8495438 Roine Jul 2013 B2
8503250 Demone Aug 2013 B2
8526239 Kim Sep 2013 B2
8533245 Cheung Sep 2013 B1
8555037 Gonion Oct 2013 B2
8599613 Abiko et al. Dec 2013 B2
8605015 Guttag et al. Dec 2013 B2
8625376 Jung et al. Jan 2014 B2
8644101 Jun et al. Feb 2014 B2
8650232 Stortz et al. Feb 2014 B2
8873272 Lee Oct 2014 B2
8964496 Manning Feb 2015 B2
8971124 Manning Mar 2015 B1
9015390 Klein Apr 2015 B2
9047193 Lin et al. Jun 2015 B2
9165023 Moskovich et al. Oct 2015 B2
9659605 Zawodny et al. May 2017 B1
9659610 Hush May 2017 B1
9697876 Tiwari et al. Jul 2017 B1
9761300 Willcock Sep 2017 B1
9997212 Finkbeiner et al. Jun 2018 B1
10068664 Penney et al. Sep 2018 B1
10496449 Kolan Dec 2019 B1
20010007112 Porterfield Jul 2001 A1
20010008492 Higashiho Jul 2001 A1
20010010057 Yamada Jul 2001 A1
20010028584 Nakayama et al. Oct 2001 A1
20010043089 Forbes et al. Nov 2001 A1
20020059355 Peleg et al. May 2002 A1
20030167426 Slobodnik Sep 2003 A1
20030222879 Lin et al. Dec 2003 A1
20040073592 Kim et al. Apr 2004 A1
20040073773 Demjanenko Apr 2004 A1
20040085840 Vali et al. May 2004 A1
20040095826 Pemer May 2004 A1
20040103262 Glossner et al. May 2004 A1
20040154002 Ball et al. Aug 2004 A1
20040205289 Srinivasan Oct 2004 A1
20040240251 Nozawa et al. Dec 2004 A1
20050015557 Wang et al. Jan 2005 A1
20050078514 Scheuerlein et al. Apr 2005 A1
20050097417 Agrawal et al. May 2005 A1
20060047937 Selvaggi et al. Mar 2006 A1
20060069849 Rudelic Mar 2006 A1
20060146623 Mizuno et al. Jul 2006 A1
20060149804 Luick et al. Jul 2006 A1
20060181917 Kang et al. Aug 2006 A1
20060215432 Wickeraad et al. Sep 2006 A1
20060225072 Lari et al. Oct 2006 A1
20060291282 Liu et al. Dec 2006 A1
20070103986 Chen May 2007 A1
20070171747 Hunter et al. Jul 2007 A1
20070174598 Thekkath Jul 2007 A1
20070180006 Gyoten et al. Aug 2007 A1
20070180184 Sakashita et al. Aug 2007 A1
20070195602 Fong et al. Aug 2007 A1
20070285131 Sohn Dec 2007 A1
20070285979 Turner Dec 2007 A1
20070291532 Tsuji Dec 2007 A1
20080025073 Arsovski Jan 2008 A1
20080037333 Kim et al. Feb 2008 A1
20080052711 Forin et al. Feb 2008 A1
20080137388 Krishnan et al. Jun 2008 A1
20080165601 Matick et al. Jul 2008 A1
20080178053 Gorman et al. Jul 2008 A1
20080215937 Dreibelbis et al. Sep 2008 A1
20090067218 Graber Mar 2009 A1
20090154238 Lee Jun 2009 A1
20090154273 Borot et al. Jun 2009 A1
20090254697 Akerib Oct 2009 A1
20100067296 Li Mar 2010 A1
20100091582 Vali et al. Apr 2010 A1
20100172190 Lavi et al. Jul 2010 A1
20100210076 Gruber et al. Aug 2010 A1
20100226183 Kim Sep 2010 A1
20100308858 Noda et al. Dec 2010 A1
20100318764 Greyzck Dec 2010 A1
20100332895 Billing et al. Dec 2010 A1
20110051523 Manabe et al. Mar 2011 A1
20110063919 Chandrasekhar et al. Mar 2011 A1
20110093662 Walker et al. Apr 2011 A1
20110103151 Kim et al. May 2011 A1
20110119467 Cadambi et al. May 2011 A1
20110122695 Li et al. May 2011 A1
20110140741 Zerbe et al. Jun 2011 A1
20110219260 Nobunaga et al. Sep 2011 A1
20110267883 Lee et al. Nov 2011 A1
20110317496 Bunce et al. Dec 2011 A1
20120005397 Lim et al. Jan 2012 A1
20120005459 Fleischman Jan 2012 A1
20120017039 Margetts Jan 2012 A1
20120023281 Kawasaki et al. Jan 2012 A1
20120120705 Mitsubori et al. May 2012 A1
20120134216 Singh May 2012 A1
20120134225 Chow May 2012 A1
20120134226 Chow May 2012 A1
20120140540 Agam et al. Jun 2012 A1
20120182798 Hosono et al. Jul 2012 A1
20120195146 Jun et al. Aug 2012 A1
20120198310 Tran et al. Aug 2012 A1
20120246380 Akerib et al. Sep 2012 A1
20120265964 Murata et al. Oct 2012 A1
20120281486 Rao et al. Nov 2012 A1
20120303627 Keeton et al. Nov 2012 A1
20130003467 Klein Jan 2013 A1
20130024647 Gove Jan 2013 A1
20130061006 Hein Mar 2013 A1
20130107623 Kavalipurapu et al. May 2013 A1
20130117541 Choquette et al. May 2013 A1
20130124783 Yoon et al. May 2013 A1
20130132702 Patel et al. May 2013 A1
20130138646 Sirer et al. May 2013 A1
20130163362 Kim Jun 2013 A1
20130173888 Hansen et al. Jul 2013 A1
20130205114 Badam et al. Aug 2013 A1
20130219112 Okin et al. Aug 2013 A1
20130227361 Bowers et al. Aug 2013 A1
20130283122 Anholt et al. Oct 2013 A1
20130286705 Grover et al. Oct 2013 A1
20130326154 Haswell Dec 2013 A1
20130332707 Gueron et al. Dec 2013 A1
20140047214 Fleischer et al. Feb 2014 A1
20140185395 Seo Jul 2014 A1
20140215185 Danielsen Jul 2014 A1
20140250279 Manning Sep 2014 A1
20140344934 Jorgensen Nov 2014 A1
20150029798 Manning Jan 2015 A1
20150042380 Manning Feb 2015 A1
20150063052 Manning Mar 2015 A1
20150078108 Cowles et al. Mar 2015 A1
20150120987 Wheeler Apr 2015 A1
20150134713 Wheeler May 2015 A1
20150268875 Jeddeloh Sep 2015 A1
20150270015 Murphy et al. Sep 2015 A1
20150279466 Manning Oct 2015 A1
20150324290 Leidel Nov 2015 A1
20150325272 Murphy Nov 2015 A1
20150356009 Wheeler Dec 2015 A1
20150356022 Leidel et al. Dec 2015 A1
20150357007 Manning et al. Dec 2015 A1
20150357008 Manning et al. Dec 2015 A1
20150357019 Wheeler et al. Dec 2015 A1
20150357020 Manning Dec 2015 A1
20150357021 Hush Dec 2015 A1
20150357022 Hush Dec 2015 A1
20150357023 Hush Dec 2015 A1
20150357024 Hush et al. Dec 2015 A1
20150357047 Tiwari Dec 2015 A1
20160062672 Wheeler Mar 2016 A1
20160062673 Tiwari Mar 2016 A1
20160062692 Finkbeiner et al. Mar 2016 A1
20160062733 Tiwari Mar 2016 A1
20160063284 Tiwari Mar 2016 A1
20160064045 La Fratta Mar 2016 A1
20160064047 Tiwari Mar 2016 A1
20160098208 Willcock Apr 2016 A1
20160098209 Leidel et al. Apr 2016 A1
20160110135 Wheeler et al. Apr 2016 A1
20160125919 Hush May 2016 A1
20160154596 Willcock et al. Jun 2016 A1
20160155482 La Fratta Jun 2016 A1
20160179526 Jha et al. Jun 2016 A1
20160188250 Wheeler Jun 2016 A1
20160196142 Wheeler et al. Jul 2016 A1
20160196856 Tiwari et al. Jul 2016 A1
20160225422 Tiwari et al. Aug 2016 A1
20160266873 Tiwari et al. Sep 2016 A1
20160266899 Tiwari Sep 2016 A1
20160267951 Tiwari Sep 2016 A1
20160292080 Leidel et al. Oct 2016 A1
20160306584 Zawodny et al. Oct 2016 A1
20160306614 Leidel et al. Oct 2016 A1
20160350230 Murphy Dec 2016 A1
20160365129 Willcock Dec 2016 A1
20160371033 La Fratta et al. Dec 2016 A1
20170031865 Eyole et al. Feb 2017 A1
20170052906 Lea Feb 2017 A1
20170177340 Jha et al. Jun 2017 A1
20170178701 Willcock et al. Jun 2017 A1
20170192844 Lea et al. Jul 2017 A1
20170228192 Willcock et al. Aug 2017 A1
20170235515 Lea et al. Aug 2017 A1
20170236564 Zawodny et al. Aug 2017 A1
20170242902 Crawford et al. Aug 2017 A1
20170243623 Kirsch et al. Aug 2017 A1
20170262369 Murphy Sep 2017 A1
20170263306 Murphy Sep 2017 A1
20170269865 Willcock et al. Sep 2017 A1
20170269903 Tiwari Sep 2017 A1
20170277433 Willcock Sep 2017 A1
20170277440 Willcock Sep 2017 A1
20170277581 Lea et al. Sep 2017 A1
20170277637 Willcock et al. Sep 2017 A1
20170278559 Hush Sep 2017 A1
20170278584 Rosti Sep 2017 A1
20170285988 Dobelstein Oct 2017 A1
20170293434 Tiwari Oct 2017 A1
20170301379 Hush Oct 2017 A1
20170309314 Zawodny et al. Oct 2017 A1
20170329577 Tiwari Nov 2017 A1
20170336989 Zawodny et al. Nov 2017 A1
20170337126 Zawodny et al. Nov 2017 A1
20170337953 Zawodny et al. Nov 2017 A1
20170352391 Hush Dec 2017 A1
20170371539 Mai et al. Dec 2017 A1
20180012636 Alzheimer et al. Jan 2018 A1
20180024769 Howe et al. Jan 2018 A1
20180024919 Geml Jan 2018 A1
20180024926 Penney et al. Jan 2018 A1
20180025759 Penney et al. Jan 2018 A1
20180025768 Hush Jan 2018 A1
20180032458 Bell Feb 2018 A1
20180033478 Lea et al. Feb 2018 A1
20180039484 La Fratta et al. Feb 2018 A1
20180046405 Hush et al. Feb 2018 A1
20180046461 Tiwari Feb 2018 A1
20180060069 Rosti et al. Mar 2018 A1
20180074754 Crawford Mar 2018 A1
20180075899 Hush Mar 2018 A1
20180088850 Willcock Mar 2018 A1
20180102147 Willcock et al. Apr 2018 A1
20180108397 Venkata et al. Apr 2018 A1
20180130515 Zawodny et al. May 2018 A1
20180136871 Leidel May 2018 A1
20180239531 Lea Aug 2018 A1
20180239712 Lea Aug 2018 A1
20180240510 Hush et al. Aug 2018 A1
20180300128 Kim Oct 2018 A1
20190235780 DeBenedictis Aug 2019 A1
20190317892 Lee Oct 2019 A1
Foreign Referenced Citations (13)
Number Date Country
102141905 Aug 2011 CN
0214718 Mar 1987 EP
2026209 Feb 2009 EP
H0831168 Feb 1996 JP
2009259193 Mar 2015 JP
10-0211482 Aug 1999 KR
10-2010-0134235 Dec 2010 KR
10-2013-0049421 May 2013 KR
2001065359 Sep 2001 WO
2010079451 Jul 2010 WO
2013062596 May 2013 WO
2013081588 Jun 2013 WO
2013095592 Jun 2013 WO
Non-Patent Literature Citations (20)
Entry
Power ISA version 3.0. Datasheet [online], IBM, 2017 [retrieved on Feb. 11, 2021], Retrieved from the Internet: <URL: https://ibm.ent.box.com/s/1hzcwkwf8rbju5h9iyf44wm94amnlcrv>.
“4.9.3 MINLOC and MAXLOC”, Jun. 12, 1995, (5pgs.), Message Passing Interface Forum 1.1, retrieved from http://www.mpi-forum.org/docs/mpi-1.1/mpi-11-html/node79.html.
Stojmenovic, “Multiplicative Circulant Networks Topological Properties and Communication Algorithms”, (25 pgs.), Discrete Applied Mathematics 77 (1997) 281-305.
Boyd et al., “On the General Applicability of Instruction-Set Randomization”, Jul.-Sep. 2010, (14 pgs.), vol. 7, Issue 3, IEEE Transactions on Dependable and Secure Computing.
Elliot, et al., “Computational RAM: Implementing Processors in Memory”, Jan.-Mar. 1999, (10 pgs.), vol. 16, Issue 1, IEEE Design and Test of Computers Magazine.
Dybdahl, et al., “Destructive-Read in Embedded DRAM, Impact on Power Consumption,” Apr. 2006, (10 pgs.), vol. 2, Issue 2, Journal of Embedded Computing-Issues in embedded single-chip multicore architectures.
Kogge, et al., “Processing In Memory: Chips to Petaflops,” May 23, 1997, (8 pgs.), retrieved from: http://www.cs.ufc.edu/courses/cda5106/summer02/papers/kogge97PIM.pdf.
Draper, et al., “The Architecture of the DIVA Processing-In-Memory Chip,” Jun. 22-26, 2002, (12 pgs.), ICS '02, retrieved from: http://www.isi.edu/˜draper/papers/ics02.pdf.
Adibi, et al., “Processing-In-Memory Technology for Knowledge Discovery Algorithms,” Jun. 25, 2006, (10 pgs.), Proceeding of the Second International Workshop on Data Management on New Hardware, retrieved from: http://www.cs.cmu.edu/˜damon2006/pdf/adibi06inmemory.pdf.
U.S. Appl. No. 13/449,082, entitled, “Methods and Apparatus for Pattern Matching,” filed Apr. 17, 2012, (37 pgs.).
U.S. Appl. No. 13/743,686, entitled, “Weighted Search and Compare in a Memory Device,” filed Jan. 17, 2013, (25 pgs.).
U.S. Appl. No. 13/774,636, entitled, “Memory as a Programmable Logic Device,” filed Feb. 22, 2013, (30 pgs.).
U.S. Appl. No. 13/774,553, entitled, “Neural Network in a Memory Device,” filed Feb. 22, 2013, (63 pgs.).
U.S. Appl. No. 13/796,189, entitled, “Performing Complex Arithmetic Functions in a Memory Device,” filed Mar. 12, 2013, (23 pgs.).
International Search Report and Written Opinion for PCT Application No. PCT/US2013/043702, dated Sep. 26, 2013, (11 pgs.).
Pagiamtzis, et al., “Content-Addressable Memory (CAM) Circuits and Architectures: A Tutorial and Survey”, Mar. 2006, (16 pgs.), vol. 41, No. 3, IEEE Journal of Solid-State Circuits.
Pagiamtzis, Kostas, “Content-Addressable Memory Introduction”, Jun. 25, 2007, (6 pgs.), retrieved from: https://www.pagiamtzis.com/cam/camintro.
Debnath, Biplob, Bloomflash: Bloom Filter on Flash-Based Storage, 2011 31sst Annual Conference on Distributed Computing Systems, Jun. 20-24, 2011, 10 pgs.
Derby, et al., “A High-Performance Embedded DSP Core with Novel SIMD Features”, Apr. 6-10, 2003, (4 pgs.), vol. 2, pp. 301-304, 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing.
International Search Report and Written Opinion for related PCT Application No. PCT/US2019/055487, dated Oct. 10, 2019, 11 pages.
Related Publications (1)
Number Date Country
20200117454 A1 Apr 2020 US