The present disclosure relates generally to memory, and more particularly, to apparatuses and methods associated with command selection policy with read priority.
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 instruction (e.g., a program, applications, etc.). A memory system can implement a scheduling policy used to determine an order in which memory access requests (e.g., read and write commands) received from the processing resource(s) are executed by the memory system. Such scheduling policies can affect computing system performance since program execution time on the computing system is affected by the execution time of the respective memory access requests, for example.
The present disclosure includes apparatuses and methods related to command selection policy. An example method can include receiving a read command to a memory controller, wherein the read command comprises an address for a bank and a channel of a memory device, inserting the read command into a queue of the memory controller, blocking a first number of write commands to the bank, issuing, to the memory device, an activation command associated with the read command, blocking a second number of write commands to the channel, and issuing the read command to the memory device. As used herein, blocking commands can also be referred to as deprioritizing commands.
A number of embodiments of the present disclosure can provide an improved command selection policy as compared to previous approaches. For instance, some prior command selection policies include FCFS (first-come, first-served) and FRFCFS (first-ready, first-come, first-served). A FCFS policy can include scheduling commands received to a memory controller for execution by a memory device (e.g., a main memory such as a DRAM device) based on the order in which the commands were received by (e.g., decoded) the controller. Therefore, in such cases, oldest commands are executed first. However, various memory systems include timing constraints that can affect whether a command can be issued (e.g., from the memory controller to the memory device). For example, various support circuitry associated with a memory array (e.g., row decode circuitry, column decode circuitry, sense amplifier circuitry, pre-charge circuitry, refresh circuitry, etc.) can include timing constraints that determine when/if a particular command is ready for execution by the memory device. Accordingly, a FCFS policy can increase execution latency since a newer command may be ready for issuance to the memory device (e.g., based on the timing constraints) but the command cannot be sent to the memory device until the older command is executed.
A FRFCFS policy can reduce latency as compared to a FCFS policy. For example, in the FRFCFS policy, a memory controller may iterate through the command queue and select the first command it encounters that is ready to be issued. Therefore, an older command not yet ready may be skipped over in favor of a newer pending command that is ready.
As an example, a FRFCFS policy may include prioritizing column commands over row commands such that the policy includes searching the command queue for the oldest column command ready to be issued and if an issuable column command is not found, the oldest row command that is ready to be issued is selected for issuance to the memory device. As those skilled in the art appreciate, memory and storage arrays may be organized logically or physically, or both, in columns and rows. So, as used herein, a “column” command refers to a command directed to an address corresponding to an open (e.g., activated) row (e.g., page) of an array of the memory device, and a “row” command refers to a command directed to an address corresponding to a closed (e.g., deactivated) row of the array.
In some implementations, neither a FCFS policy nor a FRFCFS policy prioritizes read commands (e.g., over write commands). Prioritizing read commands can improve system performance since various instructions executed by a processing resource (e.g., a central processing unit) can be dependent on execution of other instructions. For example, various instructions to be executed by a CPU may be dependent upon a read command issued to a memory system. Therefore, the dependent instructions in such implementations might not be executed by the CPU until the data corresponding to the read command is returned to the CPU. As such, delay in execution of read commands sent to the memory system can result in delay in program execution.
A number of embodiments of the present disclosure can implement a command selection policy that prioritizes read commands (e.g., both column read commands and row read commands) over write commands, which can provide benefits such as reducing latency associated with read access requests to memory, among other benefits. As described further herein, a number of embodiments include implementing a command selection policy that has similarities to a FRFCFS policy along with a strict read priority. A number of embodiments can be implemented via execution of instructions stored on machine-readable media, which can include various non-transitory media including, but not limited to, volatile and/or nonvolatile memory, such as solid-state memories, phase-change memory, ferroelectric memory, optical media, and/or magnetic media among other types of machine readable media.
With a strict read priority policy, if the memory controller is in the process of issuing write commands and one or more read commands enter a queue (e.g., command queue), the memory controller can cease issuing write commands to service the read commands. Although, a strict read priority can lead to low latency for the read commands due to various factors, the read commands may not be ready for immediate issuance at the time that they enter the queue. A policy in which a memory controller blocks write commands can leave a bus unnecessarily idle. For example, a bus can be unnecessarily idle between a time in which the memory controller blocks a write command and a time when a read command is ready to issue.
Upon adding a read command to the queue, the memory controller can block outstanding writes that are ready to issue even though the read command is not ready to issue. The memory controller can cease issuing further write commands causing a duration of time in which the bus is idle. During the idle bus time the memory controller can issue pre-charge (“PRE”) commands and/or activate (“ACT”) command to prepare the memory device for the read command. The memory controller can unnecessarily cease issuing write commands given that the read command is not ready for issuance. The pre-charge commands can be a row pre-charge command.
Some embodiments can prevent the memory controller from unnecessarily ceasing to issue write commands. For example, the memory controller can cease issuing write commands if read commands are ready to be issued. However, timing constraints of a memory device can dictate that pending write commands become issuable before pending read commands become issuable if a most recently issued command was a write command.
The memory controller may continue to issue the write commands until there are no write commands left in a queue, at which point the memory controller may issue the read. An unintended effect of the decision to delay blocking the write commands is that the read command may no longer receive priority over the write commands. The issuance of the read command may be further delayed if additional write commands are added to the queue and become issuable before the pending read command becomes issuable. Delaying the issuance of the read command to issue the write commands and continuing to issue write command until the write commands in a queue are processed may be referred to as “read starvation.” That is, read starvation can describe the delaying of blocking write commands which can result in further undesirable delays for issuing a read command given that new issuable write commands may be added to a queue and become issuable before the pending read command becomes issuable.
Another challenge is that, although the memory device may be in a state in which it can allow a read command to an open row, there may be pending read commands to closed rows. These read commands may not become issuable until their associated rows are opened. If a bank which is being accessed by a read command has a row open other than the row accessed by that read command, then the controller may issue a pre-charge command to the row accessed by the read command of the bank prior to issuing the read command.
The command selection policy may force the pre-charge commands and activate commands to prepare for the pending reads, while allowing the issuing of write commands, provided that they don't delay the pre-charge commands, the activate commands, and the read commands to an unacceptable degree. That is, the command selection policy can enforce a read command priority for read commands to specific channels and/or banks while allowing the issuance of write commands to different channels and/or banks.
The command selection policy and the examples described herein can be implemented using DRAM devices, ferroelectric random access memory (FeRAM) devices, and 3D) (Point™ (3DXP) devices, among other types of memory.
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.
The system 120 can comprise multiple channels each having a number of devices 110-1 to 110-N corresponding thereto. The devices 110-1 to 110-N can collectively be referred to as devices 110. Each of the devices 110 can be, for example, a “chip” comprising multiple banks. The controller 104 can service multiple memory channels or the controller 104 can be implemented as multiple separate controllers (e.g., one for each channel). For example, the system 120 can comprise a plurality of modules (e.g., dual in-line memory modules (DIMMs)).
In this example, the computing system includes a host 102 coupled to a controller 104 (e.g., via an interface 103), which is coupled to the memory system 120 (e.g., via an interface 105). The computing system 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 host 102 can include a number of processing resources (e.g., one or more processors) capable of accessing memory 120 (e.g., via controller 104). The host 102 may be responsible for execution of an operating system (OS) and/or various applications that can be loaded thereto (e.g., from memory system 120 via controller 104).
The controller 104 may receive memory access requests (e.g., in the form of read and write commands, which may be referred to as load and store commands, respectively) from the host 102. The controller 104 can transfer commands and/or data between the host 102 and the memory system 120 over the interfaces 103 and 105, which can comprise physical interfaces such as buses, for example, employing a suitable protocol. Such protocol may be custom or proprietary, or one or both interfaces 103 and 105 may employ a standardized protocol, such as Peripheral Component Interconnect Express (PCIe), Gen-Z, CCIX, or the like.
As an example, the interfaces 103 and 105 may comprise combined address, command, and data buses or separate buses for respective address, command, and data signals. The controller 104 can comprise control circuitry, in the form of hardware, firmware, or software, or any combination of the three. As an example, the controller 104 can comprise 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. In a number of embodiments, the controller 104 may be co-located with the host 102 (e.g., in a system-on-chip (SOC) configuration). Also, the controller 104 may be co-located with the memory system 120. The controller 104 can be, for example, a controller such as a controller comprising issue unit 322 in
As shown in
Signal 212 indicates commands provided from a memory controller (e.g., 104) to a memory device (e.g., 110). The commands corresponding to signal 212 can include activation commands (ACT), pre-charge commands (PRE), read commands, and/or write commands, among other possible commands that the controller can provide to the memory device. Signal 211 indicates a command/address bus status associated with executing commands. Signal 214 indicates the quantity of entries (e.g., read and write commands) in a command queue. Signal 216 indicates the quantity of pending read commands in the queue (e.g., commands remaining to be issued). Signal 218 indicates the quantity of pending write commands in the queue. Signal 217 indicates the bank address to which commands are directed. Signal 220 indicates a data bus status corresponding to a data bus between the controller and the memory device (e.g., a data bus of interface 105 shown in
In accordance with various embodiments of the present disclosure, an issue unit (e.g., 322) of a memory controller can block the issuance of write commands on a channel of a memory device in two stages, which can prevent unnecessarily ceasing issuance of write commands in order to issue a prioritized read command. As shown in
In a number of embodiments, timing constraints associated with a memory device may prevent a read from becoming issuable immediately after its activation command (e.g., 206) issues. Therefore, in order to avoid gaps in data bus activity, it may be beneficial to delay blocking of the channel until a particular amount of time has passed since the issuance of the activation command. In a number of embodiments, the delay may be equal to a difference between tRCD (row-to-column delay) and tWTR (write-to-read delay) (e.g., tRCD−tWTR), where tRCD corresponds to the number of clock cycles between opening a row and accessing columns within it, and tWTR corresponds to the number of clock cycles required between a valid write command and a next read command. For instance, as shown in
To enable the implementation of the wait time (e.g., tRCD−tWTR) associated with blocking the channel, the issue unit may retain a timestamp for each activation command (e.g., 206). Accordingly, a received read command will not result in blocking of the channel until tRCD−tWTR has passed since the corresponding activation command 206 has issued.
The timing diagram 200 shows a timing of command issuances using separate bank and channel blockings. For example, the particular bank to which the received read command is directed may be blocked responsive to receiving the read command. However, as shown, the issue unit may continue to issue write commands (e.g., 202-2) to other banks of the channel prior to blocking all writes to the channel, which can reduce idle time of the data bus (e.g., as shown by signal 220). Subsequent to issuing the activation command 206, the issue unit can block writes to the channel. However, as noted above, bus idle time can be further reduced by delaying the blocking of the channel until after time tRCD−tWTR has passed since issuance of the activation command 206 (e.g., as indicated by issuance of write command 202-3).
As shown in
Utilizing a read priority command selection policy can involve the memory controller elevating the priority of write commands when one or more newer read commands access a same row as the write (e.g., due to a “read-after-write dependence”). Accounting for read-after-write dependence in association with a read priority command selection policy can result in issuing dependent read commands (e.g., commands that are not to issue until after one or more subsequently received writes to the same row) sooner than they would otherwise have issued. For the purposes of the scheduling policy described herein, a write command that is elevated in priority (e.g., due to a read-after-write dependence) can be given a same priority as a read command.
However, to avoid violating timing constraints of a memory device, the delay time associated with blocking the channel (e.g., the delay subsequent to issuance of the row activation command) can be adjusted for elevated write commands (e.g., as compared to read commands). For example, for elevated write commands, the delay can be tRCD−tCCD rather than tRCD−tWTR where tCCD is the column-to-column delay (e.g., the number of clock cycles required between successive writes to an activated row). Example command selection policies such as that described in
A command whose execution priority level has been elevated (e.g., as part of a command selection policy) can be referred to as an elevated command. For example, an elevated write command can refer to a write command whose execution priority level is elevated as compared to other write commands in a command queue (e.g., due to a read-after-write dependence associated with the write command).
In various instances, a read command can be directed to a bank in which a read-after-write dependence is occurring. In such cases, the read command can involve sending a pre-charge command to the bank in order to activate the row to which the read is directed. However, due to the read-after-write dependence occurring on the bank, it can be preferable to allow write command(s) to the row to occur so that the read command having the dependence can execute. Accordingly, embodiments of the present disclosure can include blocking pre-charge commands to banks through which a read-after-write dependence is occurring.
The issue unit 322 can receive incoming commands 326 (e.g., read and/or write commands). The commands 326 can be placed in a command queue 334 and their corresponding addresses (e.g., rank address, bank address, etc.) can be decoded by the decoder 328. The bank unit 330 can provide indications (e.g., via one or more lists) of those banks having particular characteristics. For example, bank unit 330 can indicate bank addresses (e.g., bank IDs) associated with outstanding read commands and/or elevated write commands.
The command queue 334 can comprise one or more queues. For example, the command queue 334 can comprise a first queue configured to receive the incoming commands 326 and a number of “prioritized” queues. As an example, the command selection logic 324 can be configured to place each of the incoming commands 326 into one of a plurality of queues indexed in priority order. For instance, a highest priority queue might include column read commands, a second highest priority queue might include row read commands, a third highest priority queue might include column write commands, and a fourth highest priority queue might include row write commands. Commands can be placed in the prioritized queues in accordance with various command selection policies such as those described herein. The command queue 334 can be, for example, a first-in first-out (FIFO) queue(s).
As used herein, the term “queue” is not intended to be limited to a specific data structure implementation, but rather the term queue can refer to a collection of elements organized in various manners and which can have characteristics of one or more different types of queues and/or lists (e.g., a list, a linked list, etc.), among others.
The system timer 336 provides the time (e.g., 0 picosecond (ps), 1 ps, 2 ps, etc.), while the command selection logic 324 and/or time unit 332 samples the times from the system timer 336, logs the sampled times, and uses the sampled times in conjunction with the device's timing parameters (e.g., timing parameters associated with operating the memory devices 340 or other components of the system comprising the memory devices 340 and issue unit 322), to determine the issuability of the outstanding commands.
Such timing parameters can include timing constraints such as those described above (e.g., tRCD, tWTR, tCCD etc.). The time unit 332 can provide timestamps for use in implementing the command selection policy. For example, the time unit 332 can provide timestamps for row activation commands, which can be used in association with determining suitable times at which to perform channel blocking. The bank state unit 338 can indicate the state of various banks corresponding to the memory devices 340. For instance, the bank state unit 338 can indicate whether banks are currently blocked.
The command selection logic 324 is configured to implement command selection policies described herein. For example, in operation, the command selection logic 324 is configured to maintain the lists associated with bank unit 330 and command queue 334. The command queue 334 selects commands (e.g., from command queue 334) for issuance to memory devices 340 based on input from various components. The command selection logic 324 can select the commands 326 stored in the command queue 334 for issuance using the row activation times provided by the time unit 332, the bank states provided by the bank states unit 338, the list of banks provided by the bank unit 330, and data provided by the decoder 328 and the system timer 336.
In some examples, the command selection logic 324 is configured to communicate with the decoder 328. For example, the command selection logic 324 can request banks and/or rows associated with the commands 326. The command selection logic 324 can also request a list of banks and/or rows with outstanding read commands and/or elevated write commands from the bank unit 330. That is, the bank unit 330 can store bank and/or row data associated with the commands 326. The command selection logic 324 can compare a bank and/or row received from the decoder 328 and corresponding to a command 326 to a list of banks and/or rows provided by the bank unit 330 to determine whether a read-after-write dependence exists. In some examples, the read-after-write dependence can be a function of the row address of the commands 326 rather than the bank address of the commands.
The command selection logic 324 can also log times associated with commands using the time unit 332 and the system timer 336. For example, the command selection logic 324 can receive a first time provided by the system timer 336 and associate the time with an activation command. The command selection logic 324 can also receive a second time provided by the system timer 336 to determine whether a duration of time has expired sufficient to issue a read command and/or to block write commands from issuing. The command selection logic 324 can request times associated with activation commands and can update times associated with activation commands. For example, the command selection logic 324 can provide an identifier (ID) associated with an activation command and/or a time associated with the activation command and/or the activation command ID to store and/or update a time associated with an activation command. The components of the issue unit 322 can comprise hardware, firmware, and/or software.
At 444, a command enters the queue (e.g., a command queue 334). At 446, a determination is made regarding whether the command is a read command. If the command is not a read command (e.g., the command is a write command), no further action is necessary and the method shown in flow chart 442 terminates at 456.
Responsive to a determination (e.g., at 446) that the command is a read command, at 448 a determination is made regarding whether the bank ID associated with the read command is in a list of banks with outstanding read commands and/or elevated write commands (e.g., the bank ID of the read command is compared with the list of bank IDs in a bank unit such as 330 shown in
Responsive to a determination (e.g., at 448) that the bank ID of the read is not on the list of banks with outstanding read commands and/or elevated write commands, at 450 the bank ID is added to the list of banks with outstanding read commands and/or elevated write commands (e.g., the list maintained by a bank unit such as 330), and the flow continues to 452 where a read-after-write dependence check is made.
As used herein, the terms “old” and “new” are used to reference the relative time commands have been in the command queue. For example, referring to a command as “older” relative to other commands indicates it entered the command queue prior to the other commands. For instance, commands entering the command queue (e.g., at 444) will be newer than those commands already in the command queue.
Responsive to determining (e.g., at 452) that one or more older write command accesses a same row as the read command (e.g., such that a read-after-write dependence exists), at 454 each such older write command is marked as an elevated write command (e.g., the priority of those write commands is increased in order to ensure they issue prior to some other read commands that may otherwise have higher priority according to the selection policy), and the flow terminates as shown at 456. Responsive to determining (e.g., at 452) that no older write commands access the same row as the read command (e.g., no read-after-write dependence exists), flow terminates as shown at 456.
As shown in
At 566, a determination is made as to whether command i (e.g., the “ith” command) is not a read command, whether the ith command is not an elevated write command, and whether a bank ID corresponding to the ith command is in the list of banks with outstanding read commands and/or elevated write commands (e.g., a list maintained by bank unit 330).
If it is determined that the ith command is not a read command, the ith command is not an elevated write command, and the bank ID associated with the ith command is in the list of banks with outstanding read commands and/or elevated write commands, then a bank block is executed at 574 and command i is marked as not issuable as shown at 576. A bank block refers to the issue unit (e.g., 322) blocking particular commands from issuing to a particular bank even the commands may otherwise be issuable (e.g., ready to issue) according to a selection policy. As shown at 572, the index i is incremented (e.g., i=i+1) and the flow returns to 564.
Responsive to a determination that command i is a read command, command i is an elevated write command, or the bank ID associated with command i is not in the list of banks with outstanding read commands and/or elevated write commands, a determination regarding whether command i is a read command or whether command i is an elevated write command is made (e.g., at 568 and 570, respectively). If command i is a read command, the flow proceeds to 578 where it is determined whether the read command i has a read-after-write dependence. If the read command i has a read-after-write dependence, then the read command i is marked as not issuable at 576 and flow proceeds to 572 with an increment to index i.
If the read command i does not have a read-after-write dependence (as determined at 578), then flow continues to 582. At 582 it is determined whether a read command “R” exists that has a read-after-write dependence through the same bank as the bank to which the read command i is directed and where the R's row is open. If such a read exists, then at 576 the read command i is marked as not issuable (e.g., such that a pre-charge command corresponding to the read command i is blocked from issuing to the bank), such that read command R (and the writes on which it depends) can proceed prior to issuance of the pre-charge command corresponding to read command i. If such a read command R does not exist (e.g., as determined at 582), then flow proceeds to 584. At 584 a determination is made regarding whether time tRCD−tWTR has passed since an activation of read command i's row (e.g., via an activation command ACT).
If time tRCD−tWTR has not passed since activation of read command i's row, then flow proceeds with incrementing index i at 572. If time tRCD−tWTR has passed since activation of read command i's row, then the channel is blocked at 586 and all commands in the queue other than read commands and elevated write commands are marked as not issuable at 588, and flow proceeds to 590. Executing the channel block at 586 prevents further commands to the channel from issuing until the read command i (or it's corresponding ACT and/or PRE command) has issued. As described above, prior to the passing of time tRCD−tWTR since read command i's row being activated, write commands may continue being issued to other banks of the channel (e.g., even though writes to read command i's bank may be blocked).
Responsive to a determination (e.g., at 570) that command i is an elevated write command, a determination as to whether time tRCD−tCCD has passed since an activation of write command i's row (e.g., via an ACT command). If time tRCD−tCCD has expired, then the channel is blocked at 586 and all commands in the queue other than read commands and elevated write commands are marked as not issuable at 588, and flow proceeds to 590. If time tRCD−tCCD has not passed since activation of write command i's row, then flow proceeds with incrementing index i at 572.
Responsive to iterating through the commands in the queue, as described above, the issue unit selects a command “C” for issuance (e.g., at 590). Command C can be selected from among column commands such as read commands and write commands, as well as row commands such as activation commands (ACT) and pre-charge commands (PRE) corresponding to reads and/or writes. As shown at 590, the command C can be selected in accordance with a FRFCFS read priority policy such as those described herein.
As shown at 591, a determination can be made as to whether selected command C is an activation command (ACT). As shown at 594, if the selected command C is an activation command, then the current time is added to a list of bank activation times (e.g., such as described above in association with time unit 322), and flow continues to 598 (e.g., with issuance of the activation command to the target bank).
As shown at 592, a determination can be made as to whether selected command C is a pre-charge command (PRE). As shown at 595, if the selected command C is a pre-charge command (PRE), then the activation time corresponding to command C's bank is removed from the list of bank activation times, and flow continues to 598 (e.g., with issuance of the pre-charge command to the target bank).
As shown at 593, a determination can be made as to whether selected command C is a read command or an elevated write command. As shown at 596, if the selected command C is a read or an elevated write, then a determination is made at 596 regarding whether the queue contains any other reads or elevated writes to command C's bank. If the queue contains more reads or elevated writes to the same bank as command C, then flow continues to 598 and selected command C (e.g., the read or elevated write) issues. If it is determined at 596 that the queue does not contain more reads or elevated writes to command C's bank, then flow continues to 597 and the bank ID corresponding to command C's bank is removed from the list of banks with reads and/or elevated writes (e.g., a list such as that described in association with bank unit 330) and the selected command C (e.g., the read or elevated write) issues at 598.
The examples show in
While the devices that use row and column based addressing are composed of banks, where each bank can have one row active at a time, the 3DXP devices are composed of partitions, where partitions do not comprise row addressing nor row activation commands. While the DRAM devices and FeRAM devices have the timing parameter tRCD to specify a time required between sending a row command and sending a column command, as well as the timing parameter tWTR for specifying the minimum time between sending a write command and a read command, an 3DXP device does not have said timing parameters. Rather, 3DXP has timing parameters that specify the minimum time required between commands to the same partition and commands to different partitions.
The timing parameters can include tWR2WR_SAMEPART to describe a time to perform two write operations to a same partition, tWR2WR_DIFFPART to describe a time to perform two write operations to different partitions, tRD2RD_SAMEPART to describe a time to perform two read operations to a same partition, tRD2RD_DIFFPART to describe a time to perform two read operations to different partitions, tWR2RD_SAMEPART to describe a time to perform a write operation and a read operation to a same partition, tWR2RD_DIFFPART to describe a time to perform a write operation and a read operation to different partitions, tRD2WR_SAMEPART to describe a time to perform a read operation and a write operation to a same partition, tRD2WR_DIFFPART to describe a time to perform a read operation and a write operation to different partitions, and tDQ_TURN_AROUND to describe a time penalty for turning a bus around.
For a given permutation of two commands (e.g., two read commands, two write commands, a read command followed by a write command, and/or a write command followed by a read command), the time (e.g., minimum time) used to send those two commands to the same partition is greater than the time to send two commands to different partitions. Due to this, sending a non-elevated write command to a partition for which there is an outstanding read command and/or an elevated write command, can be avoided, as sending the non-elevated write command can incur delays in the issuance of the read commands and/or elevated write commands. The bank blocking examples used herein can be applied to 3DXP devices by blocking partitions in the same manner that banks are blocked.
However, blocking partitions can be different than blocking banks as applied to 3DXP devices given that the time parameter at which the channel block is applied is a function of row activation times and either tRCD and tWTR in the case of a channel block for a read command or tRCD and tCCD (in the case of a channel block for an elevated write). Given that 3DXP devices have neither row activations nor associated timing parameters, the examples described herein can be adapted to 3DXP devices. For example, the activation time unit 332 in
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 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.
This application is a Continuation of U.S. application Ser. No. 16/117,356, filed Aug. 30, 2018, which issues as U.S. Pat. No. 10,877,694 on Dec. 29, 2020, which is a Continuation of U.S. application Ser. No. 15/951,896, filed Apr. 12, 2018, which issued as U.S. Pat. No. 10,725,696 on Jul. 28, 2020, the contents of which are included herein 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 | 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 | Midina 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 |
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 |
6182177 | Harriman | 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 |
6533245 | Takemoto | Mar 2003 | B2 |
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 |
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 |
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 | 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 |
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 |
9836226 | Park et al. | Dec 2017 | B2 |
20010007112 | Porterfield | Jul 2001 | A1 |
20010008492 | Higashiho | Jul 2001 | A1 |
20010010057 | Tamada | Jul 2001 | A1 |
20010028584 | Nakayama et al. | Oct 2001 | A1 |
20010043089 | Forbes et al. | Nov 2001 | A1 |
20020059355 | Peleg et al. | May 2002 | A1 |
20030061459 | Aboulenein et al. | Mar 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 | Pemer | 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 |
20060059320 | Akizuki | Mar 2006 | A1 |
20060069849 | Rudelic | Mar 2006 | A1 |
20060112240 | Walker et al. | May 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 |
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 |
20090138670 | Mutlu et al. | May 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 |
20110023037 | Memik et al. | Jan 2011 | 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 |
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 |
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 |
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 |
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 |
20160071608 | Bronner et al. | Mar 2016 | A1 |
20160098208 | Willcock | Apr 2016 | A1 |
20160098209 | Leidel et al. | Apr 2016 | A1 |
20160110135 | Wheeler et al. | Apr 2016 | A1 |
20160124873 | Xu et al. | May 2016 | A1 |
20160125919 | Hush | May 2016 | A1 |
20160154596 | Willcock et al. | Jun 2016 | A1 |
20160155482 | La Fratta | 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 |
20160371014 | Roberts | Dec 2016 | A1 |
20160371033 | La Fratta et al. | Dec 2016 | A1 |
20170052906 | Lea | Feb 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 |
20170249104 | Moon 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 |
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 |
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 |
20160008620 | Jan 2016 | KR |
20160036693 | Apr 2016 | KR |
20160094764 | Aug 2016 | KR |
2001065359 | Sep 2001 | WO |
2010079451 | Jul 2010 | WO |
2013062596 | May 2013 | WO |
2013081588 | Jun 2013 | WO |
2013095592 | Jun 2013 | WO |
Entry |
---|
Search Report from related European Patent Application No. EP19786233.7, dated Dec. 8, 2021, 10 pages. |
Reasons for Rejection from related Korea Patent Application No. 10-2020-7032452, dated Jan. 14, 2022, 18 pages. |
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.). |
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: http://www.pagiamlzis.com/cam/camintro. |
Debnath, Biplob, Bloomflash: Bloom Filter on Flash-Based Storage, 2011 31st 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. |
“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. |
International Search Report and Written Opinion for related PCT Application No. PCT/US2019/026974, dated Aug. 2, 2019, 10 pages. |
Number | Date | Country | |
---|---|---|---|
20210109678 A1 | Apr 2021 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16117356 | Aug 2018 | US |
Child | 17127850 | US | |
Parent | 15951896 | Apr 2018 | US |
Child | 16117356 | US |