74results about How to "Reduce write operations" patented technology

A memory using an SRAM memory cell intended for low-voltage operation is designed to decrease the threshold value of MOS transistors constituting the memory cell without substantial decrease in the static noise margin, which is the operational margin of the memory cell. To this end, a voltage Vdd′ higher than a power supply voltage Vdd of a power supply line for peripheral circuits is supplied from a power supply line for memory cells as a power supply voltage for memory cells. Since the conductance of driver MOS transistors is increased, the threshold voltage of the MOS transistors within the memory cells can be reduced without reducing the static noise margin. Further the ratio of width between the driver MOS transistor and a transfer MOS transistor can be set to 1, thereby allowing a reduction in the memory cell area.

A Y selection line for write for controlling operations of a column selection switch within a write amplifier and a Y selection line for read for controlling operations of a column selection switch within a read amplifier are provided individually and the column selection switch within the read amplifier is set to the non-operating condition during the write operation. Accordingly, a through-current during the write operation may be reduced. In this case, the write IO line and read IO line are allocated crossing sense amplifier columns, while the column selection line for write and column selection line for read are allocated in parallel to the sense amplifier columns.

The invention discloses a memory-based frequent pattern mining method. The method comprises the following steps of 1, creating an initial frequent pattern tree, creating a root node T of the frequent pattern tree, and marking the root node with ''null''; scanning a database again, selecting out frequent items in each read transaction, and sorting the frequent items according to an order in L; creating a path of the frequent pattern tree by taking null as the root node after sorting, adding 1 to a count of only a final node on the path, and keeping counts of other nodes on the path unchanged; scanning all transactions in the whole database in sequence and obtaining the initial frequent pattern tree; and 2, traversing the initial frequent pattern tree in sequence by using a depth-first search algorithm, wherein a counter value of a traversed node is the sum of the value of the node and the values of all child nodes of the node. The method has the technical effects that the write operation of an NVM (Non-Volatile Memory) can be reduced, so that the frequent pattern tree can be quickly established; and a large amount of dense write operations on a node counting domain close to the root node can be reduced, so that the service life of the NVM is prolonged.