会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • WEAVE SEQUENCE COUNTER FOR NON-VOLATILE MEMORY SYSTEMS
    • 用于非易失性存储器系统的WEAVE序列计数器
    • WO2013040537A1
    • 2013-03-21
    • PCT/US2012/055698
    • 2012-09-17
    • APPLE INC.POST, Daniel, J.WAKRAT, Nir, JacobKHMELNITSKY, Vadim
    • POST, Daniel, J.WAKRAT, Nir, JacobKHMELNITSKY, Vadim
    • G06F9/26
    • G06F12/0246G06F2212/7202G06F2212/7207G06F2212/7211
    • Systems and methods are disclosed for providing a weave sequence counter ("WSC") for non-volatile memory ("NVM") systems. The WSC can identify the sequence in which each page of the NVM is programmed. The "weave" aspect can refer to the fact that multiple blocks can be open for programming at once, thus allowing the pages of these blocks to be programmed in a "woven" manner. Systems and methods are also disclosed for providing a host weave sequence counter ("HWSC"). Each time new data is initially programmed to the NVM, this data can be associated with a particular HWSC. The HWSC associated with the data may not change, even when the data is moved to a new page (e.g., for wear leveling purposes and the like). The WSC and HWSC may aid in, for example, performing rollback, building logical -to-physical mappings, determining static-versus-dynamic page statuses, and performing maintenance operations (e.g., wear leveling).
    • 公开了用于为非易失性存储器(“NVM”)系统提供编织序列计数器(“WSC”)的系统和方法。 WSC可以识别NVM的每个页面被编程的顺序。 “编织”方面可以指多个块可以一次打开以进行编程,从而允许以“编织”的方式对这些块的页面进行编程。 还公开了用于提供主机编织序列计数器(“HWSC”)的系统和方法。 每当新数据最初被编程到NVM时,该数据可以与特定的HWSC相关联。 即使将数据移动到新页面(例如,用于磨损均衡目的等),与数据相关联的HWSC也可能不会改变。 WSC和HWSC可以帮助例如执行回滚,构建逻辑到物理映射,确定静态到动态页面状态以及执行维护操作(例如,磨损均衡)。
    • 6. 发明申请
    • METADATA REDUNDANCY SCHEMES FOR NON-VOLATILE MEMORIES
    • 非挥发性物质的元数据冗余计划
    • WO2011034652A1
    • 2011-03-24
    • PCT/US2010/042235
    • 2010-07-16
    • APPLE INC.POST, Daniel J.KHMELNITSKY, VadimWAKRAT, Nir J.
    • POST, Daniel J.KHMELNITSKY, VadimWAKRAT, Nir J.
    • G06F12/02G06F11/14
    • G06F12/0246G06F11/1402G06F11/1666G06F2212/7201G06F2212/7207
    • Systems and methods are provided for storing data to or reading data from a non-volatile memory ("NVM"), such as flash memory, using a metadata redundancy scheme. In some embodiments, an electronic device, which includes an NVM, may also include a memory interface for controlling access to the NVM. The memory interface may receive requests to write user data to the NVM. The user data from each request may be associated with metadata, such as a logical address, flags, or other data. In response to a write request, the NVM interface may store the user data and its associated metadata in a first memory location (e.g., page), and may store a redundant copy of the metadata in a second memory location. This way, even if the first memory location becomes inaccessible, the memory interface can still recover the metadata from the backup copy stored in the second memory location.
    • 提供了系统和方法,用于使用元数据冗余方案将数据存储到非易失性存储器(“NVM”)或从闪存中读取数据。 在一些实施例中,包括NVM的电子设备还可以包括用于控制对NVM的访问的存储器接口。 存储器接口可以接收将用户数据写入NVM的请求。 来自每个请求的用户数据可以与诸如逻辑地址,标志或其他数据的元数据相关联。 响应于写入请求,NVM接口可以将用户数据及其相关联的元数据存储在第一存储器位置(例如,页面)中,并且可以将元数据的冗余副本存储在第二存储器位置中。 这样,即使第一存储器位置变得不可访问,存储器接口仍然可以从存储在第二存储器位置的备份副本中恢复元数据。
    • 7. 发明申请
    • FASTER TREE FLATTENING FOR A SYSTEM HAVING NON-VOLATILE MEMORY
    • 用于具有非易失性存储器的系统的快速树状平铺
    • WO2013040538A1
    • 2013-03-21
    • PCT/US2012/055703
    • 2012-09-17
    • APPLE INC.POST, Daniel, J.KHMELNITSKY, Vadim
    • POST, Daniel, J.KHMELNITSKY, Vadim
    • G06F9/45
    • G06F3/0608G06F3/0643G06F3/0679G06F12/0246G06F2212/7201
    • Systems and methods are disclosed for efficient buffering for a system having non-volatile memory ("NVM"). A tree can be stored in volatile memory that includes a logical -to-physical mapping between a logical space and physical addresses of the NVM. When the amount of memory available for the tree is below a pre-determined threshold, a system can attempt to reduce the number of data fragments in the NVM, and consequently flatten a portion of the tree. The NVM interface may select an optimal set of entries of the tree to combine. Any suitable approach can be used such as, for example, moving one or more sliding windows across the tree, expanding a sliding window when a condition has been satisfied, using a priority queue while scanning the tree, and/or maintaining a priority queue while the tree is being updated.
    • 公开了用于具有非易失性存储器(“NVM”)的系统的有效缓冲的系统和方法。 一个树可以存储在易失性存储器中,其中包括逻辑空间和NVM的物理地址之间的逻辑到物理映射。 当可用于树的内存量低于预定阈值时,系统可以尝试减少NVM中的数据片段的数量,从而使树的一部分变平。 NVM接口可以选择要合并的树的最佳条目集合。 可以使用任何合适的方法,例如,在树上移动一个或多个滑动窗口,当满足条件时,使用优先级队列在扫描树时扩展滑动窗口和/或维护优先级队列 树正在更新。