The present disclosure relates generally to semiconductor memory apparatuses and methods, and more particularly, to apparatuses and methods related to generating and executing a control flow.
Memory devices are typically provided as internal, semiconductor, integrated circuits in computers or other electronic systems. There are many different types of memory including volatile and non-volatile memory. Volatile memory can require power to maintain its data (e.g., host data, error data, etc.) and includes random access memory (RAM), dynamic random access memory (DRAM), static random access memory (SRAM), synchronous dynamic random access memory (SDRAM), and thyristor random access memory (TRAM), 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, and resistance variable memory such as phase change random access memory (PCRAM), resistive random access memory (RRAM), and magnetoresistive random access memory (MRAM), such as spin torque transfer random access memory (STT RAM), among others.
Electronic systems often include a number of processing resources (e.g., one or more processors), which may retrieve and execute instructions (e.g., control flow) and store the results of the executed instructions to a suitable location. A processor can comprise a number of functional units (e.g., herein referred to as functional unit circuitry) such as arithmetic logic unit (ALU) circuitry, floating point unit (FPU) circuitry, and/or a combinatorial logic block, for example, which can execute instructions to perform logical operations such as AND, OR, NOT, NAND, NOR, and XOR logical operations on data (e.g., one or more operands).
A number of components in an electronic system may be involved in providing instructions to the functional unit circuitry for execution. The instructions may be generated, for instance, by a processing resource such as a controller and/or host processor. Data (e.g., the operands on which the instructions will be executed to perform the logical operations) may be stored in a memory array that is accessible by the functional unit circuitry. The instructions and/or data may be retrieved from the memory array and sequenced and/or buffered before the functional unit circuitry begins to execute instructions on the data. Furthermore, as different types of operations may be executed in one or multiple clock cycles through the functional unit circuitry, intermediate results of the operations and/or data may also be sequenced and/or buffered.
In many instances, the processing resources (e.g., processor and/or associated functional unit circuitry) may be external to the memory array, and data can be accessed (e.g., via a bus between the processing resources and the memory array) to execute instructions. Data can be moved from the memory array to registers external to the memory array via a bus.
Examples of the present disclosure provide apparatuses and methods related to generating and executing a control flow. An example apparatus can include a first device configured to generate control flow instructions, and a second device including an array of memory cells, an execution unit to execute the control flow instructions, and a controller configured to control an execution of the control flow instructions on data stored in the array.
As used herein, a control flow refers to an order in which instructions (e.g., statements and/or function calls of a program) are executed. The order in which a number of instructions are executed can vary according to jumps, unconditional branches, conditional branches, loops, returns, and/or halts, among other instruction types associated with a program. In a number of examples, the number of instructions can also be function calls. An if-then statement is an example of a conditional branch. The condition evaluated in association with the if-then statement can be evaluated by a first device (e.g., a host processor) to generate a control flow. For example, a first set of instructions or a second set of instructions can be executed by a second device given the evaluation of a condition by the first device. The first device can further evaluate loops (e.g., for loops, while loops, etc.), for instance, to generate a number of instructions that are executed by a second device and an order associated with the number of instructions.
In various previous approaches, the control flow is generated and the instructions associated with the control flow are executed by a same device (e.g., a host processor). For example, the same device that generates a number of instructions and an order of execution associated with the instructions also executes the number of instructions according to the generated order. Generating the control flow and executing the instructions associated with the control flow in a same device can include generating the control flow before executing the instructions. For example, the control flow cannot be generated and the instructions executed at the same time if a single device is generating the control flow and executing the associated instructions.
In a number of examples according to the present disclosure, a first device can generate the control flow and a second device can execute the instructions corresponding to the control flow. For example, the control flow can be generated concurrently with the execution of the control flow. As used herein, instructions corresponding to a control flow, which may be referred to as “control flow instructions,” are meant to refer to instructions that involve manipulating data. For instance, instructions that involve manipulating data include instructions involving performing computations on data, which can include mathematical operations (e.g., addition, subtraction, multiplication, and/or division), which can include performing various Boolean logic operations such as AND, OR, invert, etc. Examples of instructions that do not involve manipulating data include memory commands such as data read, data write, and data refresh operations.
As an example, the first device can be a host. A host can include one of a central processing unit (CPU), a system on a chip (SoC), and an application specific integrated circuitry (ASIC), for instance. As an example, a SoC can comprise one or more processors and one or more controllers (e.g., channel controllers) coupled to a number of memory devices. A second device can be a memory device including a memory array, an execution unit, which can comprise sensing circuitry that includes a number of compute components, and a controller that controls of the execution unit to execute the instructions. The controller of the memory device can operate the compute components of the execution unit to coordinate the execution of the instructions associated with the control flow.
As an example, the instructions generated by a host can be executed by performing a number of operations. For example, an “add” instruction includes performing various logical operations. As used herein, instructions and operations are used interchangeably. Operations can be compare operations, swap operations, and/or logical operations (e.g., AND operations, OR operations, SHIFT operations, INVERT operations etc.). However, embodiments are not limited to these examples. As used herein, executing Single Instruction Multiple Data (SIMD) operations is defined as performing a same operation on multiple elements in parallel (e.g., simultaneously). As used herein, an element is a numerical value that can be stored (e.g., as a bit-vector) in a memory array.
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 one or more 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 designators “J,” “N,” “R,” “S,” “U,” “V,” “W,” and “X” particularly with respect to reference numerals in the drawings, indicates that a number of the particular feature so designated can be included. As used herein, “a number of” a particular thing can refer to one or more of such things (e.g., a number of memory arrays can refer to one or more memory arrays).
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. For example, 110 may reference element “10” in
System 100 includes a host 110 coupled to memory device 120, which includes a memory array 130. Host 110 can be a host system such as a personal laptop computer, a desktop computer, a digital camera, a mobile telephone, or a memory card reader, among various other types of hosts. Host 110 can include a system motherboard and/or backplane and can include a number of processing resources (e.g., one or more processors, microprocessors, or some other type of controlling circuitry) such as a CPU, SoC, ASIC, and/or memory buffer (e.g., registered dual in-line memory module (DIMM)). The system 100 can include separate integrated circuits or both the host 110 and the memory device 120 can be on the same integrated circuit. The system 100 can be, for instance, a server system and/or a high performance computing (HPC) system and/or a portion thereof. Although the example shown in
For clarity, the system 100 has been simplified to focus on features with particular relevance to the present disclosure. The memory array 130 can be a DRAM array, SRAM array, STT RAM array, PCRAM array, TRAM array, RRAM array, NAND flash array, and/or NOR flash array, for instance. The array 130 can comprise memory cells arranged in rows coupled by access lines (which may be referred to herein as word lines or select lines) and columns coupled by sense lines (which may be referred to herein as digit lines or data lines). Although a single array 130 is shown in
The memory device 120 includes address circuitry 142 to latch address signals provided over an I/O bus 156 (e.g., a data bus) through I/O circuitry 144. Address signals are received and decoded by a row decoder 146 and a column decoder 152 to access the memory array 130. Data can be read from memory array 130 by sensing voltage and/or current changes on the sense lines using sensing circuitry 150. The sensing circuitry 150 can read and latch a page (e.g., row) of data from the memory array 130. The I/O circuitry 144 can be used for bi-directional data communication with host 110 over the I/O bus 156. The write circuitry 148 is used to write data to the memory array 130.
Controller 140 decodes signals provided by control bus 154 from the host 110. These signals can include chip enable signals, write enable signals, and address latch signals that are used to control operations performed on the memory array 130, including data read, data write, and data erase operations. In various embodiments, the controller 140 is responsible for executing instructions from the host 110. The controller 140 can be a state machine, a sequencer, or some other type of controller.
As described further below, the controller 140 can comprise of multiple controllers (e.g., separate controller units). In a number of embodiments, the sensing circuitry 150 can comprise a number of sense amplifiers and a number of compute components, which may comprise an accumulator and can be used to perform logical operations (e.g., on data associated with complementary sense lines). In a number of embodiments, the sensing circuitry (e.g., 150) can be used to perform (e.g., execute) operations on data stored in array 130 and to store the results of the sort operation back to the array 130 without transferring data via a sense line address access (e.g., without firing a column decode signal) and/or without enabling a local I/O line coupled to the sensing circuitry. As such, operations can be performed using sensing circuitry 150 rather than and/or in addition to being performed by processing resources external to the sensing circuitry 150 (e.g., by a processor associated with host 110 and/or other processing circuitry, such as ALU circuitry, located on device 120 (e.g., on controller 140 or elsewhere)). In a number of embodiments the sensing circuitry 150 can be referred to as an execution unit. The execution unit may be coupled to the memory array 130 and/or may be decoupled from the memory array 130.
As such, in a number of embodiments, registers and/or an ALU external to array 130 and sensing circuitry 150 may not be needed to perform various operations as the sensing circuitry 150 can be controlled to perform the appropriate computations involved in performing operations using the address space of memory array 130. Additionally, operations can be performed without the use of an external processing resource. For instance, an external processing resource such as host 110 may generate a control flow, but the host 110 (e.g., an ALU of the host) may not be used to perform computations associated with executing the instructions corresponding to the control flow.
As used herein, the host 210 is a first device and the memory device 220-1 is a second device. Memory device 220-1 and/or memory device 220-2 can be volatile memory and/or non-volatile memory. For example, memory device 220-1 can be a volatile memory (e.g., DRAM) and memory device 220-2 can be non-volatile memory (e.g., a hard drive, solid state drive (SSD), etc.).
In a number of previous approaches, the host 210 can request data from memory device 220-1. The memory device 220-1 can transfer the data stored in memory array 230 to the host 210. The memory device 220-1 can retrieve the data from memory device 220-2 (e.g., via a suitable interface represented by arrow 272) if memory device 220-1 does not have the requested data. The memory device 220-1 can store the data retrieved from memory device 220-2 in memory array 230. The data can be stored in cache 262 by the host 210. The data can be, for example, a set of executable instructions associated with performing a particular task (e.g., a program).
The ALU 260 can be used by the host 210 to identify the location of a number of instructions that need to be executed from the data stored in the cache 262. After each instruction is identified, by the ALU 260, the host 210 can execute the identified instruction (as indicated by arrow 268). For example, the host 210 can generate a control flow and can further execute the instructions associated with the control flow.
The host 310 can be referred to as a first device and can comprise a CPU, SoC which may include a number of processors and a number of channel controllers (not shown), for example, and/or an ASIC, among other types of devices. The host 310 can be used to generate a control flow, which includes instructions and an execution order associated with the instructions. In a number of examples, the host 310 can utilize the ALU 360 to generate the control flow. Generating a control flow is further described in
The host 310 can request data associated with a program from memory device 320-1. The memory device can retrieve the requested data from memory array 330. The memory device can return the data to host 310. The host can store the data in cache 362 and utilize the ALU 360 to generate a control flow. In a number of examples, the data can be data associated with a set of executable instructions (e.g., a program). The program can be represented in various formats. For example, the program can be represented as a source file, an assembly file, an object file, and/or an executable file. In a number of examples, the program can be generated dynamically. For example, the program can be provided via assembly file and/or a buffer.
The data retrieved from memory array 330 can be used by host 310 to generate a control flow. For example, the ALU 360 can be used to retrieve a number of instructions that represent operations.
In contrast to the example of
The controller 340 can control execution of the control flow instructions on data stored in memory cells in the memory array 330. For example, the controller 340 can control the execution of the instructions by controlling the sensing circuitry 350, which may serve as an execution unit, to perform a number of operations associated with the control flow instructions. In contrast, the memory device 220-1 shown in
Control flow instructions can include a number of operations including AND operations, OR operations, INVERT operations, and/or SHIFT operations. The number of operations can include other operations. For example the operations can be any number of binary operations and non-binary operations such as an addition operation, a multiplication operation, and/or a comparison operation. In a number of examples, the number of operations can be performed without transferring data via an input/output (I/O) line 634 in
The controller 340 can control a plurality of compute components (e.g., compute components 631-0, 631-1, 631-2, 631-3, 631-4, 631-5, 631-6, 631-7, . . . , 631-X in
For example, the controller 340 can activate a number of sense lines 605 and access lines (e.g., access lines 604-0, 606-1, 606-2, 606-3, 606-4, 606-5, 606-6, . . . , 606-R in
The controller 340 can also activate the sense lines 605 and/or the access lines 604 to store the results of the operations (e.g., the results of the execution of the number of instructions) back to the array 330. In a number of examples, the controller 340 can further transfer the results of the operations and/or an indication that the operations have been executed back to host 310.
In a number of examples, the controller 340 can comprise a number of controllers. For example, the controller 340 can comprise a first controller and a number of second controllers. The first controller can receive the number of instructions from the host 310. The instructions can include instructions to perform, for example, an addition operation. The first controller can translate the number of instructions into a number of AND operations, OR operations, INVERT operations, and/or SHIFT operations, for example. The first controller can provide the AND operations, OR operations, INVERT operations, and/or SHIFT operations to the number of second controllers. The number of second controllers can control the compute components 631 and the sense amplifiers 606 to execute the AND operations, OR operations, INVERT operations, and/or SHIFT operations. For example, the number of second controllers can activate the sense lines 605, access lines 604, and/or latches associated with the compute components 631 and/or sense amplifiers 606 to execute the AND operations, OR operations, INVERT operations, and/or SHIFT operations. In a number of examples, each of the number of second controllers can control the compute components 631 and/or the sense amplifiers 606 to execute at least one of the AND operations, OR operations, INVERT operations, and/or SHIFT operations.
In accordance with a number of embodiments, a device on which a control flow is generated (e.g., host 310) can be independent from a device on which the corresponding control flow instructions are executed (memory device 320-1). As an example, a control flow can be generated in a number of portions. For instance, the host 310 can generate a control flow that includes a first portion and a second portion, with the first portion comprising a first number of control flow instructions and the second portion comprising a second number of control flow instructions. As an example, the host 310 can generate a first number of instructions that are associated with the first portion of the control flow and provide them to the memory device 320-1. The host 310 can generate the second number of instructions that are associated with the second portion of the control flow while the execution of the first number of instructions is occurring on the memory device 320-1 (e.g., the generation of the second portion of the control flow can occur concurrently with execution of the first portion of the control flow). The memory device 320-1 can return a result of the execution of the first number of instructions to the host 310 and the host 310 can provide the second number of instructions to the memory device 320-1. The memory device 320-1 can provide the result of the execution of the second number of instructions and/or an indication that the second number of instructions have been executed to the host 310.
Separating the creation of the control flow from the execution of the control flow provides the ability to execute the control flow concurrently with the creation of the control flow. Furthermore, separating the creation of the control flow from the execution of the control flow eliminates the need to move data to be operated on in association with the execution of the control flow to a host 310, since the control flow instructions are executed via an execution unit on a device (e.g., 320-1) separate from the host 310.
In this example, each of the memory devices 420 includes a controller, a memory array, and sense circuitry. For example, memory device 420-1 includes controller 440-1, memory array 430-1, and sense circuitry 450-1, memory device 420-2 includes controller 440-2, memory array 430-2, and sense circuitry 450-2, and memory device 420-N includes controller 440-N, memory array 430-N, and sense circuitry 450-N. The controller 440-1, the controller 440-2, . . . , and the controller 440-N are referred to generally as controllers 440. The array 430-1, the array 430-2, . . . , and the array 430-N are referred to generally as arrays 430. The sense circuitry 450-1, the sense circuitry 450-2, . . . , and the sense circuitry 450-N are referred to generally as sense circuitry 450. As described further below, in a number of embodiments, the sense circuitry 450 can be operated (e.g., by a corresponding controller 440) to serve as an execution unit.
Host 410 can generate a number of different control flows. Each of the control flows can be associated with a particular memory device 420. For example, a first control flow can be associated with memory device 420-1, a second control flow can be associated with memory device 420-2, . . . , and an Nth control flow can be associated with memory device 420-N. Arrows from host 410 to devices 420-1 to 420-N represent an interface (e.g., bus) over which data, addresses, and/or commands can be transferred. However, the devices 420 may be coupled to the host 410 via a common bus, for instance.
As an example, each of the different control flows can be associated with a single (e.g., same) program and/or the different control flows can be associated with a different programs. For example, the first and second control flow can be associated with a first program and the Nth control flow can be associated with a second (e.g., different) program. The first control flow can be associated with a first portion of the first program that is independent from a second portion of the first program. The second control flow can be associated with a second portion of the first program that is independent from the first portion of the first program. A first portion of a program can be considered as being independent from a second portion of a program if executing a number of instructions associated with the first portion does not have an impact on the execution of a second number of instructions associated with the second portion of the program.
Each of the memory devices 420 can execute different instructions from a plurality of instructions associated with the plurality of control flows. For example, the memory device 420-1 can execute a first number of instructions associated with the first control flow, the memory device 420-2 can execute a second number of instructions associated with the second control flow, . . . , and the memory device 420-N can execute an Nth number of instructions associated with the Nth control flow.
In contrast to the example of
Concurrent execution of a number of processes can include a host 410 generating control flows while the memory devices 420 are executing the control flows. For example, host 410 can generate a first control flow. The host 410 can provide the first control flow to memory device 420-1. The host 410 can generate a second control flow while the memory device 420-1 is executing a first number of instructions associated with the first control flow via the controller 440-1, the memory array 430-1, and the sense circuitry 450-1. The host 410 can provide the second control flow to memory device 420-2 while the memory device 420-1 is executing the first number of instructions associated with the first control flow. The host 410 can generate and provide an Nth control flow to the memory device 420-N while the memory device 420-1 and the memory device 420-2 are executing the first number of instructions associated with the first control flow and the second number of instructions associated with the second control flow, respectively. The memory device 420-2 can execute the second number of instructions via the controller 440-2, the memory array 430-2, and the sense circuitry 450-2. Each of the memory devices 420 can execute a different plurality of instructions associated with different control flows concurrently. For example, the memory device 410-2 can execute the first number of instructions, the memory device 410-2 can execute the second number of instructions, and the memory device 410-N can execute the Nth number of instructions concurrently. The memory device 410-N can execute the Nth number of instructions via the controller 440-N, the memory array 430-N, and the sense circuitry 450-N.
Each of the memory devices 420 can return a result of the execution of the different plurality of instructions and/or an indication that the different plurality of instructions have been executed. For example, the memory device 420-1 can inform the host 410 that the first number of instructions have been executed while the second number of instructions and the Nth number of instructions are being executed (e.g., on devices 420-2 and 420-N, respectively). The host 410 can generate a different control flow that is associated with the first control flow based on the result of the first number of instructions that are associated with the first control flow. The host 410 can provide the different control flow to the memory device 420-1 while the memory device 420-2 and the memory device 420-N are executing the second number of instructions and the Nth number of instructions, respectively. Each of the different control flows can be generated serially. For example, the second control flow can be generated after the first control flow is generated and the Nth control flow can be generated after the first control flow and the second control flow are generated. Each of a different number of instructions associated with the different control flows can be executed concurrently (e.g., at a same time). Each of the different number of instructions associated with the control flow can be executed concurrently with the creation of the different control flows.
The example of
In the example shown in
As described above the device 510 can be a host and the device 520 can be a memory device. Host 510 can be associated with a program counter. The program counter holds the memory address of the next instruction to be executed. The program counter can be incremented to get the address of the next instructions.
At 580, the device 510 fetches an instruction from memory using the program counter. At the end of the fetch operation the program counter can point to the next instruction that will be read at the next cycle. The device 510 can store the fetched instruction in a cache. Cache can be, for example, an instruction register and/or another form of memory.
At 582, the device 510 decodes the fetched instruction. Decoding the fetched instruction can include determining an operation to be performed based on op-code associated with the fetched instruction. For example, the device 510 can decode an instruction (e.g., fetched instruction) to determine that an addition operation is to be performed.
At 584, the device 510 generates memory operable instructions. Generating memory operable instructions can include dynamically generating memory operable instructions. Dynamically generating memory operable instructions can be synonymous with dynamically generating a control flow because the memory operable instructions can be control flow instructions that are associated with a control flow. The memory operable instructions can be dynamically generated when the device 510 evaluates the decoded instructions to generate the memory operable instructions. The device 510 can dynamically generate memory operable instructions by evaluating a decoded instruction to generate the memory operable instructions. For example, a decoded instruction can be an if-then statement. The if-then statement can be dynamically evaluated by the device 510. The device 510 can dynamically select a first memory operable instruction instead of a second memory operable instruction based on the evaluation of the if-then statement. In a number of examples, the memory operable instructions can be dynamically generated after a program has been compiled.
As used herein, memory operable instructions refers to instructions that are to be executed by the device 520. Memory operable instructions can include logical operations (e.g., AND operation, OR operations, etc.), addition operations, subtraction operations, multiplication operations, division operations, and/or comparison operations among other types of operations that can be associated with control flow instructions. Furthermore, memory operable instructions can include read operations and/or write operations (e.g., memory commands that do not involve manipulating data).
A plurality of memory operable instructions can be generated or a single memory operable instruction can be generated by device 510. At 586, the device 520 can receive the memory operable instructions. The memory operable instructions can be received at a controller (e.g., controller 340). At 588, the device 520 can activate access lines, sense lines, and/or latches to execute the memory operable instructions. For example, the controller can activate a number of access lines, sense lines, and/or latches associated with a memory array and/or sense circuitry in device 520. Activating the number of access lines, sense lines, and/or latches can move data from array in to the sensing circuitry.
The controller can further activate access lines, sense lines, and/or latches in sense circuitry to execute the memory operable instructions on the data stored in the sensing circuitry. In a number of examples, the result of the execution of the memory operable instructions can be stored back to the array. At 590, the result of the memory operable instructions can be returned to device 510.
In a number of examples, the device 510 and the device 520 at least partially decode the instructions. For example, the device 510 can partially decode an instruction to generate a memory operable instruction. The device 510 can provide the partially decoded memory operable instruction to the controller in device 520. The decoder can further decode the memory operable instruction and execute the fully decoded memory operable instruction.
In a number of examples, the device 510 can retain partial control over the memory operable instructions while the memory operable instructions are executed on device 520. The device 510 can retain partial control over the memory operable instructions by partially decoding the memory operable instructions. For example, the device 510 can partially decode memory operable instructions by translating a virtual address into a physical memory address and device 520 can retrieve an instruction from the translated physical memory address. The device 510 can retain partial control over the memory operable instructions by translating the virtual address into the physical memory address.
Each column of memory cells can be coupled to sensing circuitry (e.g., sensing circuitry 150 shown in
The sensing circuitry (e.g., compute components 631 and sense amplifiers 606) can be controlled by the controller (e.g., 140, 340, and 440) to execute control flow operations in accordance with a number of embodiments described herein. The example described in association with
According to the embodiment illustrated in
The logical operation selection logic 713-6 includes the swap gates 742, as well as logic to control the pass gates 707-1 and 707-2 and the swap gates 742. The logical operation selection logic 713-6 includes four logic selection transistors: logic selection transistor 762 coupled between the gates of the swap transistors 742 and a TF signal control line, logic selection transistor 752 coupled between the gates of the pass gates 707-1 and 707-2 and a TT signal control line, logic selection transistor 754 coupled between the gates of the pass gates 707-1 and 707-2 and a FT signal control line, and logic selection transistor 764 coupled between the gates of the swap transistors 742 and a FF signal control line. Gates of logic selection transistors 762 and 752 are coupled to the true sense line through isolation transistor 750-1 (having a gate coupled to an ISO signal control line). Gates of logic selection transistors 764 and 754 are coupled to the complementary sense line through isolation transistor 750-2 (also having a gate coupled to an ISO signal control line).
Logic Table 8-1 illustrated in
Via selective control of the pass gates 707-1 and 707-2 and the swap transistors 742, each of the three columns of the upper portion of Logic Table 8-1 can be combined with each of the three columns of the lower portion of Logic Table 8-1 to provide nine (e.g., 3×3) different result combinations, corresponding to nine different logical operations, as indicated by the various connecting paths shown at 875. The nine different selectable logical operations that can be implemented by the sensing circuitry 750 are summarized in Logic Table 8-2.
The columns of Logic Table 8-2 show a heading 880 that includes the states of logic selection control signals (e.g., FF, FT, TF, TT). For example, the state of a first logic selection control signal (e.g., FF) is provided in row 876, the state of a second logic selection control signal (e.g., FT) is provided in row 877, the state of a third logic selection control signal (e.g., TF) is provided in row 878, and the state of a fourth logic selection control signal (e.g., TT) is provided in row 879. The particular logical operation corresponding to the results is summarized in row 847.
The timing diagram shown in
As shown in
With the ROW X data value latched in the compute component 731, equilibration is disabled (e.g., EQ goes low at time T9). At time T10, ROW Y goes high to access (e.g., select) the ROW Y memory cell. At time T11, the sense amplifier 706 is enabled (e.g., SENSE AMP goes high), which drives the complementary sense lines 705-1 and 705-2 to the appropriate rail voltages (e.g., VDD and GND) responsive to the ROW Y data value (e.g., as shown by the DIGIT and DIGIT_ signals), and the ROW Y data value is latched in the sense amplifier 706. At time T12, the PHASE 2R and PHASE 2L signals go low, which disables feedback on the latch of the compute component 731 (e.g., by turning off transistors 786 and 790, respectively) such that the value stored in the compute component may be overwritten during the logical operation. Also, at time T12, ISO goes low, which disables isolation transistors 750-1 and 750-2. Since the desired logical operation in this example is an AND operation, at time T13, TT is enabled while TF, FT and FF remain disabled (as shown in TABLE 8-2, FF=0, FT=0, TF=0, and TT=1 corresponds to a logical AND operation). Whether enabling TT results in PASS going high depends on the value stored in the compute component 731 when ISO is disabled at time T12. For example, enable transistor 752 will conduct if node ST2 was high when ISO is disabled, and enable transistor will not conduct if node ST2 was low when ISO was disabled at time T12.
In this example, if PASS goes high at time T13, the pass transistors 707-1 and 707-2 are enabled such that the DIGIT and DIGIT_ signals, which correspond to the ROW Y data value, are provided to the respective compute component nodes ST2 and SF2. As such, the value stored in the compute component 731 (e.g., the “ROW X” data value) may be flipped, depending on the value of DIGIT and DIGIT_ (e.g., the ‘ROW Y” data value). In this example, if PASS stays low at time T13, the pass transistors 707-1 and 707-2 are not enabled such that the DIGIT and DIGIT_ signals, which correspond to the ROW Y data value, remain isolated from the nodes ST2 and SF2 of the compute component 731. As such, the data value in the compute component (e.g., the ROW X data value) would remain the same.
At time T14, TT is disabled, which results in PASS going (or remaining) low, such that the pass transistors 707-1 and 707-2 are disabled. It is noted that PASS* remains low between time T13 and T14 since the TF and FF signals remain low. At time T15, ROW Y is disabled, and PHASE 2R, PHASE 2L, and ISO are enabled. Enabling PHASE 2R and PHASE 2L at time T15 enables feedback on the latch of the compute component 731 such that the result of the AND operation (e.g., “A” AND “B”) is latched therein. Enabling ISO at time T15 again couples nodes ST2 and SF2 to the gates of the enable transistors 752, 754, 762, and 764. At time T16, equilibration is enabled (e.g., EQ goes high such that DIGIT and DIGIT_ are driven to an equilibrate voltage) and the sense amplifier 706 is disabled (e.g., SENSE AMP goes low).
The result of the AND operation, which is initially stored in the compute component 731 in this example, can be transferred back to the memory array (e.g., to a memory cell coupled to ROW X, ROW Y, and/or a different row via the complementary sense lines) and/or to an external location (e.g., an external processing component) via I/O lines.
The above sequence (e.g., enabling/disabling PHASE 1L and subsequently enabling/disabling PHASE 2L) can be repeated to achieve a desired number of left shifts. For instance, in this example, a second left shift is performed by enabling PHASE 1L at time T21 and disabling PHASE 1L at time T22. PHASE 2L is subsequently enabled at time T23 to complete the second left shift. Subsequent to the second left shift, PHASE 2L remains enabled and PHASE 2R is enabled (e.g., at time T24) such that feedback is enabled to latch the data values in the compute component latches.
Although 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 one or more 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. Combination 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 one or more embodiments of the present disclosure includes other applications in which the above structures and methods are used. Therefore, the scope of one or more 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, some 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.
This application is a Continuation of U.S. application Ser. No. 16/112,577, filed Aug. 24, 2018, which issues as U.S. Pat. No. 10,782,980 on Sep. 22, 2020, which is a Continuation of U.S. application Ser. No. 14/980,024, filed Dec. 28, 2015, which issued as U.S. Pat. No. 10,061,590 on Aug. 28, 2018, which claims the benefit of U.S. Provisional Application No. 62/100,717, filed Jan. 7, 2015, the contents of which are included by reference.
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 | Ail-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 |
5485629 | Dulong | 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 |
5696956 | Razdan et al. | Dec 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 |
6122211 | Morgan et al. | Sep 2000 | A |
6125071 | Kohno et al. | Sep 2000 | A |
6128733 | Miyaguchi et al. | Oct 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 |
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 |
6731542 | Le et al. | May 2004 | B1 |
6754746 | Leung et al. | Jun 2004 | B1 |
6760833 | Dowling | Jul 2004 | B1 |
6768679 | Le et al. | Jul 2004 | B1 |
6807614 | Chung | Oct 2004 | B2 |
6816422 | Hamade et al. | Nov 2004 | B2 |
6819612 | Achter | Nov 2004 | B1 |
6894549 | Eliason | May 2005 | B2 |
6928377 | Eustis et al. | Aug 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 |
6970988 | Chung | Nov 2005 | B1 |
6985394 | Kim | Jan 2006 | B2 |
6987693 | Cernea et al. | Jan 2006 | B2 |
7020017 | Chen et al. | Mar 2006 | B2 |
7028136 | Priyadarshan et al. | Apr 2006 | B1 |
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 |
7185179 | Furusho | Feb 2007 | B1 |
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 |
7415689 | Taylor | Aug 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 |
7596679 | Abbo | Sep 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 |
7859900 | Hsiao et al. | Dec 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 | Mokhlesi | 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 |
8650447 | Wortman et al. | Feb 2014 | B1 |
8710863 | Kilzer et al. | Apr 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 |
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 |
20010052062 | Lipovski | Dec 2001 | A1 |
20020059355 | Peleg et al. | May 2002 | A1 |
20020100032 | Metzgen | Jul 2002 | A1 |
20030018868 | Chung | Jan 2003 | 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 | Perner | 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 |
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 |
20080044107 | Horisaki | 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 |
20090044179 | Luszczek | Feb 2009 | 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 |
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 |
20110093665 | 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 |
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 |
20120191699 | George | 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 |
20130061006 | Hein | Mar 2013 | A1 |
20130070549 | Ghosh | 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 |
20140133237 | Sprouse et al. | May 2014 | A1 |
20140136761 | Li et al. | May 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 |
20150270015 | Murphy et al. | Sep 2015 | A1 |
20150279466 | Manning | Oct 2015 | A1 |
20150324290 | Leidel | Nov 2015 | A1 |
20150325272 | Murphy | Nov 2015 | A1 |
20150356009 | Wheeler et al. | 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 |
Number | Date | Country |
---|---|---|
1379879 | Nov 2002 | CN |
101127901 | Feb 2008 | CN |
102141905 | Aug 2011 | CN |
0214718 | Mar 1987 | EP |
2026209 | Feb 2009 | EP |
H0831168 | Feb 1996 | JP |
2009259193 | Mar 2015 | JP |
10-0211482 | Aug 1998 | KR |
10-2010-0134235 | Dec 2010 | KR |
10-2013-0049421 | May 2013 | KR |
I317131 | Nov 2009 | TW |
I336890 | Feb 2011 | TW |
2001065359 | Sep 2001 | WO |
2010079451 | Jul 2010 | WO |
2013062596 | May 2013 | WO |
2013081588 | Jun 2013 | WO |
2013095592 | Jun 2013 | WO |
Entry |
---|
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. |
Stojmenovic, “Multiplicative Circulant Networks Topological Properties and Communication Algorithms”, (25 pgs.), Discrete Applied Mathematics 77 (1997) 281-305. |
“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. |
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. |
Debnath, BIPLOB, Bloomflash: Bloom Filter on Flash-Based Storage, 2011 31st Annual Conference on Distributed Computing Systems, Jun. 20-24, 2011, 10 pgs. |
Pagiamtzis, Kostas, “Content-Addressable Memory Introduction”, Jun. 25, 2007, (6 pgs.), retrieved from: http://www.pagiamtzis.com/cam/camintro. |
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. |
International Search Report and Written Opinion for PCT Application No. PCT/US2013/043702, dated Sep. 26, 2013, (11 pgs.). |
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.ucf.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.). |
Office Action for related Taiwan Patent Application No. 105100417, dated Nov. 16, 2016, 14 pages. |
Office Action for related Taiwan Patent Application No. 105100417, dated Jun. 19, 2017, 12 pages. |
Decision of Rejection for related Taiwan Patent Application No. 105100417, dated Jan. 2, 2018, 12 pages. |
Kowarik et al., “Associative and Data Processing Mbit-DRAM”, Proceedings of the 1990 International Conference on Computer Design: VLSI in Computer and Processors, Sep. 17-19, 1990, Cambridge, MA, pp. 421-424. |
Extended European Search Report and Written Opinion for related EP Application No. 16735388.7, dated Jun. 29, 2018, 11 pages. |
Communication Pursuant to Article 94(3) EPC for related EP Application No. 16735388.7, dated Apr. 5, 2019, 8 pages. |
Office Action for related China Patent Application No. 201680008571.7, dated Mar. 17, 2020, 40 pages. |
Number | Date | Country | |
---|---|---|---|
20210004237 A1 | Jan 2021 | US |
Number | Date | Country | |
---|---|---|---|
62100717 | Jan 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16112577 | Aug 2018 | US |
Child | 17027431 | US | |
Parent | 14980024 | Dec 2015 | US |
Child | 16112577 | US |