公开(公告)号：US08849876B2

公开(公告)日：2014-09-30

申请号：US12648273

申请日：2009-12-28

申请人： Wenguang Wang ,  Deric Horn ,  David Alexander Majnemer ,  Owen Strain

发明人： Wenguang Wang ,  Deric Horn ,  David Alexander Majnemer ,  Owen Strain

IPC分类号： G06F12/00 ,  G06F17/30 ,  G06F15/16

CPC分类号： G06F17/30082 ,  G06F17/30 ,  G06F17/30088 ,  G06F17/30115 ,  G06F17/3012

摘要： Methods and apparatuses that maintain birth time for a file system to optimize file update operations are described. The file system can include a plurality of snapshots or clones of data stored in one or more extents of blocks allocated in a storage device. Each extent may be associated with a time stamp according to the birth time. A request may be received from an executable using the file system to update data in a particular extent associated with a particular time stamp. In response, the current birth time in the file system and the particular time stamp may be compared to determine if the particular extent is not shared by more than one of the snapshots. If the particular time stamp is equal to the current birth time, the particular extent may be updated directly without performing an expensive operation to check whether a reference count of the particular extent is equal to one.

摘要翻译： 描述了保持文件系统的出生时间来优化文件更新操作的方法和装置。 文件系统可以包括存储在存储设备中分配的块的一个或多个范围中的数据的多个快照或克隆。 每个范围可以根据出生时间与时间戳相关联。 可以使用文件系统从可执行程序接收请求以更新与特定时间戳相关联的特定范围内的数据。 作为响应，可以比较文件系统中的当前出生时间和特定时间戳，以确定特定范围是否不被多于一个快照共享。 如果特定时间戳等于当前出生时间，则可以直接更新特定范围，而不执行昂贵的操作来检查特定范围的引用计数是否等于1。

公开(公告)号：US20120173882A1

公开(公告)日：2012-07-05

申请号：US12985190

申请日：2011-01-05

申请人： Deric S. Horn ,  Joseph Sokol, JR. ,  Owen Joseph Strain ,  Wenguang Wang

发明人： Deric S. Horn ,  Joseph Sokol, JR. ,  Owen Joseph Strain ,  Wenguang Wang

IPC分类号： H04L9/00

CPC分类号： G06F21/78

摘要： Disclosed herein are systems, methods, and non-transitory computer-readable storage media for performing in-place encryption. A system configured to practice the method receives a request from a user to encrypt an unencrypted volume of a computing device and identifies, generates, and/or randomly selects a volume key. Then the system converts the unencrypted volume to an encryptable format divided into portions. The system then encrypts, based on the volume key, the encryptable volume, portion by portion, to enable the user to use the computing device while encrypting. The system can maintain an encryption progress status and display the encryption progress status. The system can monitor disk accesses to the encryptable volume, and, when the disk accesses exceed a first threshold, apply a back-off algorithm to stop encrypting until the disk accesses fall below a second threshold. Thus, the computing device can be used while the encryption occurs in the background.

摘要翻译： 这里公开了用于执行就地加密的系统，方法和非暂时的计算机可读存储介质。 被配置为实施该方法的系统接收来自用户的加密计算设备的未加密卷的请求，并且识别，生成和/或随机选择卷密钥。 然后，系统将未加密的卷转换成可分割的部分的可加密格式。 然后，该系统基于音量密钥逐个地加密可加密卷，以使得用户能够在加密时使用计算设备。 系统可以保持加密进度状态并显示加密进度状态。 系统可以监视对可加密卷的磁盘访问，并且当磁盘访问超过第一阈值时，应用退避算法来停止加密，直到磁盘访问低于第二阈值。 因此，可以在后台进行加密时使用计算装置。

公开(公告)号：US20110161381A1

公开(公告)日：2011-06-30

申请号：US12648273

申请日：2009-12-28

申请人： Wenguang Wang ,  Deric Horn ,  David Alexander Majnemer ,  Owen Strain

发明人： Wenguang Wang ,  Deric Horn ,  David Alexander Majnemer ,  Owen Strain

IPC分类号： G06F17/30

CPC分类号： G06F17/30082 ,  G06F17/30 ,  G06F17/30088 ,  G06F17/30115 ,  G06F17/3012

摘要： Methods and apparatuses that maintain birth time for a file system to optimize file update operations are described. The file system can include a plurality of snapshots or clones of data stored in one or more extents of blocks allocated in a storage device. Each extent may be associated with a time stamp according to the birth time. A request may be received from an executable using the file system to update data in a particular extent associated with a particular time stamp. In response, the current birth time in the file system and the particular time stamp may be compared to determine if the particular extent is not shared by more than one of the snapshots. If the particular time stamp is equal to the current birth time, the particular extent may be updated directly without performing an expensive operation to check whether a reference count of the particular extent is equal to one.

摘要翻译： 描述了保持文件系统的出生时间来优化文件更新操作的方法和装置。 文件系统可以包括存储在存储设备中分配的块的一个或多个范围中的数据的多个快照或克隆。 每个范围可以根据出生时间与时间戳相关联。 可以使用文件系统从可执行程序接收请求以更新与特定时间戳相关联的特定范围内的数据。 作为响应，可以比较文件系统中的当前出生时间和特定时间戳，以确定特定范围是否不被多于一个快照共享。 如果特定时间戳等于当前出生时间，则可以直接更新特定范围，而不执行昂贵的操作来检查特定范围的引用计数是否等于1。

公开(公告)号：US09710397B2

公开(公告)日：2017-07-18

申请号：US13605921

申请日：2012-09-06

申请人： Peter Macko ,  Wenguang Wang

发明人： Peter Macko ,  Wenguang Wang

IPC分类号： G06F12/123 ,  G06F3/06

CPC分类号： G06F12/123 ,  G06F3/0611 ,  G06F3/0656 ,  G06F3/068 ,  G06F2212/217

摘要： Approaches to managing a composite, non-volatile data storage device are described. In one embodiment, a method for managing a composite storage device made up of fast non-volatile storage, such as a solid state device, and slower non-volatile storage, such as a traditional magnetic hard drive, can include maintaining a first data structure, which stores instances of recent access to each unit in a set of units in the fast non-volatile storage device, such as the SSD device and also maintaining a second data structure that indicates whether or not units in the slower storage device, such as the HDD, have been accessed at least a predetermined number of times. In one embodiment, the second data structure can be a queue of Bloom filters.

公开(公告)号：US08924739B2

公开(公告)日：2014-12-30

申请号：US12985190

申请日：2011-01-05

申请人： Deric S. Horn ,  Joseph Sokol, Jr. ,  Owen Joseph Strain ,  Wenguang Wang

发明人： Deric S. Horn ,  Joseph Sokol, Jr. ,  Owen Joseph Strain ,  Wenguang Wang

IPC分类号： G06F21/00 ,  G06F21/78

CPC分类号： G06F21/78

摘要： Disclosed herein are systems, methods, and non-transitory computer-readable storage media for performing in-place encryption. A system configured to practice the method receives a request from a user to encrypt an unencrypted volume of a computing device and identifies, generates, and/or randomly selects a volume key. Then the system converts the unencrypted volume to an encryptable format divided into portions. The system then encrypts, based on the volume key, the encryptable volume, portion by portion, to enable the user to use the computing device while encrypting. The system can maintain an encryption progress status and display the encryption progress status. The system can monitor disk accesses to the encryptable volume, and, when the disk accesses exceed a first threshold, apply a back-off algorithm to stop encrypting until the disk accesses fall below a second threshold. Thus, the computing device can be used while the encryption occurs in the background.

摘要翻译： 这里公开了用于执行就地加密的系统，方法和非暂时的计算机可读存储介质。 被配置为实施该方法的系统接收来自用户的加密计算设备的未加密卷的请求，并且识别，生成和/或随机选择卷密钥。 然后，系统将未加密的卷转换成可分割的部分的可加密格式。 然后，该系统基于音量密钥逐个地加密可加密卷，以使得用户能够在加密时使用计算设备。 系统可以保持加密进度状态并显示加密进度状态。 系统可以监视对可加密卷的磁盘访问，并且当磁盘访问超过第一阈值时，应用退避算法来停止加密，直到磁盘访问低于第二阈值。 因此，可以在后台进行加密时使用计算装置。

公开(公告)号：US20130219116A1

公开(公告)日：2013-08-22

申请号：US13605916

申请日：2012-09-06

申请人： Wenguang Wang ,  Peter Macko

发明人： Wenguang Wang ,  Peter Macko

IPC分类号： G06F12/08 ,  G06F12/14

CPC分类号： G06F12/123 ,  G06F3/0611 ,  G06F3/0656 ,  G06F3/068 ,  G06F2212/217

摘要： In one embodiment, a method for managing a composite storage device made up of fast non-volatile storage, such as a solid state device, and slower non-volatile storage, such as a traditional magnetic hard drive, can include maintaining a first data structure, which stores instances of recent access to each unit in a set of units in the fast non-volatile storage device, such as the SSD device and also maintaining a second data structure that indicates whether or not units in the slower storage device, such as the HDD, have been accessed at least a predetermined number of times. In one embodiment, the second data structure can be a probabilistic hash table, which has a low required memory overhead but is not guaranteed to always provide a correct answer with respect to whether a unit or block in the slower storage device has been referenced recently.

摘要翻译： 在一个实施例中，用于管理由诸如固态设备的快速非易失性存储器和诸如传统磁性硬盘驱动器的较慢非易失性存储器组成的复合存储设备的方法可以包括维护第一数据结构 其存储最近访问快速非易失性存储设备（例如SSD设备）中的一组单元中的每个单元的实例，并且还保持指示较慢存储设备中的单元（例如， HDD已被访问至少预定次数。 在一个实施例中，第二数据结构可以是概率散列表，其具有低的所需存储器开销，但是不能保证总是提供关于最近是否已经参考较慢存储设备中的单元或块的正确答案。

公开(公告)号：US09275096B2

公开(公告)日：2016-03-01

申请号：US13352256

申请日：2012-01-17

申请人： Owen Joseph Strain ,  Wenguang Wang

发明人： Owen Joseph Strain ,  Wenguang Wang

IPC分类号： G06F7/00 ,  G06F17/00 ,  G06F17/30 ,  G06F15/16

CPC分类号： G06F17/30362 ,  G06F17/30327 ,  G06F17/30961

摘要： The present technology includes an optimized b-tree. To improve concurrent access, a read lock can be applied to traversed nodes of a b-tree in a lock coupling. A read locked node can be promoted to a write locked node upon a determination that the node is likely to be modified, wherein the locked node first restricts access to further functions and then applies a write lock to the node when all existing functions accessing the node end. If one of the other functions attempts to promote the later function can be canceled and removed from the tree. A node can be promoted if the node is likely to be modified when considering multiple factors such as type of function, whether it is a leaf node, the number of keys in the node, or the number of keys in a child node.

摘要翻译： 本技术包括优化的b-tree。 为了改善并发访问，可以在锁耦合中对b-tree的遍历节点应用读锁。 当确定节点可能被修改时，读锁定节点可被升级到写锁定节点，其中锁定节点首先限制对其他功能的访问，然后当访问该节点的所有现有功能时向该节点应用写锁定 结束。 如果其他功能之一尝试提升后续功能，可以从树中取消并删除。 如果在考虑诸如功能类型，无论是叶节点，节点中的密钥数量还是子节点中的密钥数量等多个因素时可能会修改节点，则可以提升节点。

公开(公告)号：US20140059261A1

公开(公告)日：2014-02-27

申请号：US13592282

申请日：2012-08-22

申请人： Wenguang WANG ,  Richard Paul Spillane

发明人： Wenguang WANG ,  Richard Paul Spillane

IPC分类号： G06F9/52

CPC分类号： G06F9/524

摘要： A method for resolving deadlock in a multi-threaded computing system using a novel lock lease is disclosed. A first thread leases a lock held by the first thread to a second thread different from the first thread. The leasing transfers control of the lock to the second thread while the first thread retains ownership of the lock. To lease the lock: (1) the second thread applies for the lease from the first thread; (2) the first thread grants the lease; (3) the first thread waits for the second thread to complete a task; (4) the second thread terminates the lease; (5) the first thread confirms termination of the lease. The first thread receives control of the lock back from the second thread after the second thread has finished using resources controlled by the lock. The second thread also can sublease the lock to a third thread.

摘要翻译： 公开了一种使用新颖的锁租赁来解决多线程计算系统中的死锁的方法。 第一线程将由第一线程保持的锁定租给与第一线程不同的第二线程。 租赁将锁定的控制转移到第二个线程，而第一个线程保持锁的所有权。 租赁锁：（1）第二个线程从第一个线程申请租约; （2）第一线程授予租约; （3）第一个线程等待第二个线程完成任务; （4）第二线程终止租约; （5）第一线程确认终止租约。 在第二个线程完成使用由锁控制的资源之后，第一个线程从第二个线程接收到锁定的控制。 第二个线程也可以将锁转移到第三个线程。

公开(公告)号：US20130185271A1

公开(公告)日：2013-07-18

申请号：US13352256

申请日：2012-01-17

申请人： Owen Joseph Strain ,  Wenguang Wang

发明人： Owen Joseph Strain ,  Wenguang Wang

IPC分类号： G06F17/30

CPC分类号： G06F17/30362 ,  G06F17/30327 ,  G06F17/30961

摘要： The present technology includes an optimized b-tree. To improve concurrent access, a read lock can be applied to traversed nodes of a b-tree in a lock coupling. A read locked node can be promoted to a write locked node upon a determination that the node is likely to be modified, wherein the locked node first restricts access to further functions and then applies a write lock to the node when all existing functions accessing the node end. If one of the other functions attempts to promote the later function can be canceled and removed from the tree. A node can be promoted if the node is likely to be modified when considering multiple factors such as type of function, whether it is a leaf node, the number of keys in the node, or the number of keys in a child node.

摘要翻译： 本技术包括优化的b-tree。 为了改善并发访问，可以在锁耦合中对b-tree的遍历节点应用读锁。 当确定节点可能被修改时，读锁定节点可被升级到写锁定节点，其中锁定节点首先限制对其他功能的访问，然后当访问该节点的所有现有功能时向该节点应用写锁定 结束。 如果其他功能之一尝试提升后续功能，可以从树中取消并删除。 如果在考虑诸如功能类型，无论是叶节点，节点中的密钥数量还是子节点中的密钥数量等多个因素时可能会修改节点，则可以提升节点。

公开(公告)号：US08381194B2

公开(公告)日：2013-02-19

申请号：US12550318

申请日：2009-08-28

申请人： Wenguang Wang

发明人： Wenguang Wang

IPC分类号： G06F9/44

CPC分类号： G06F11/3676 ,  G06F8/20

摘要： Methods and apparatuses that collect code coverage information for selected code locations when executing executable code are described. Source code in one or more files may be annotated at the selected code locations. The executable code may be compiled from the annotated source code using standard compilers. The code coverage information may be collected into a run time data store accessible by other applications. In response to receiving a code coverage request, the code coverage information can be retrieved from the data store to compare with annotations identified from the source code. A code coverage report can be generated to indicate whether one or more of the selected code locations are not covered when executing the executable code.

摘要翻译： 描述在执行可执行代码时收集所选代码位置的代码覆盖率信息的方法和装置。 一个或多个文件中的源代码可以在选定的代码位置注释。 可以使用标准编译器从注释的源代码编译可执行代码。 代码覆盖信息可以被收集到可由其他应用访问的运行时数据存储器中。 响应于接收到代码覆盖请求，可以从数据存储中检索代码覆盖率信息，以便与从源代码识别的注释进行比较。 可以生成代码覆盖率报告以指示在执行可执行代码时是否不覆盖所选代码位置中的一个或多个。