会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • Memory cell write
    • 存储单元写
    • US08345491B2
    • 2013-01-01
    • US13282331
    • 2011-10-26
    • Satish K. DamarajuAk R. AhmedScott E. Siers
    • Satish K. DamarajuAk R. AhmedScott E. Siers
    • G11C7/00
    • G11C11/412G11C11/419
    • Embodiments of a memory cell comprising a voltage module configured to supply a first supply voltage and a second supply voltage, a data node programming module configured to receive the first supply voltage and to program a data node based at least in part on a write data line, and a complementary data node programming module configured to receive the second supply voltage and to program a complementary data node based at least in part on a complementary write data line, wherein the voltage module is configured such that the first supply voltage is substantially different from the second supply voltage for a period of time while the memory device is being programmed. Additional variants and embodiments may also be disclosed and claimed.
    • 存储单元的实施例包括被配置为提供第一电源电压和第二电源电压的电压模块,数据节点编程模块,被配置为接收第一电源电压并且至少部分地基于写数据线来编程数据节点 以及互补数据节点编程模块,其被配置为接收所述第二电源电压并且至少部分地基于互补写入数据线来编程互补数据节点,其中所述电压模块被配置为使得所述第一电源电压基本上不同于 第二电源电压在存储器件被编程期间一段时间。 也可以公开和要求保护附加的变型和实施例。
    • 10. 发明授权
    • Look ahead LRU array update scheme to minimize clobber in sequentially accessed memory
    • 展望未来的LRU阵列更新方案,以最大限度地减少顺序存取的内存中的破坏
    • US07155574B2
    • 2006-12-26
    • US11414541
    • 2006-05-01
    • Peter J. SmithSatish K. DamarajuSubramaniam Maiyuran
    • Peter J. SmithSatish K. DamarajuSubramaniam Maiyuran
    • G06F12/00
    • G06F9/3808G06F12/123G06F12/127
    • A high-speed memory management technique that minimizes clobber in sequentially accessed memory, including but not limited to, for example, a trace cache. The method includes selecting a victim set from a sequentially accessed memory; selecting a victim way for the selected victim set; reading a next way pointer from a trace line of a trace currently stored in the selected victim way, if the selected victim way has the next way pointer; and writing a next line of the new trace into the selected victim way over the trace line of the currently stored trace. The method also includes forcing a replacement algorithm of next set to select a victim way of the next set using the next way pointer, if the trace line of the currently stored trace is not an active trace tail line.
    • 一种高速存储器管理技术,其使顺序访问的存储器中的电路最小化,包括但不限于例如跟踪高速缓存。 该方法包括从顺序访问的存储器中选择一个受害者集合; 选择所选受害者集合的受害方式; 如果所选择的受害者方式具有下一个方向指针,则从当前存储在所选择的受害者方式中的跟踪的跟踪行读取下一个方向指针; 并通过当前存储的轨迹的轨迹线将新轨迹的下一行写入所选的受害者方式。 该方法还包括,如果当前存储的跟踪的跟踪线不是活动跟踪尾线,则使用下一个方向指针强制下一集合的替换算法来选择下一集合的受害方式。