首页>
外国专利>
Faster tree flattening for a system having non-volatile memory
Faster tree flattening for a system having non-volatile memory
展开▼
机译:对于具有非易失性存储器的系统,更快的树展平
展开▼
页面导航
摘要
著录项
相似文献
摘要
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.
展开▼