METHODS AND APPARATUSES TO ALLOCATE FILE STORAGE VIA TREE REPRESENTATIONS OF A BITMAP
    3.
    发明申请
    METHODS AND APPARATUSES TO ALLOCATE FILE STORAGE VIA TREE REPRESENTATIONS OF A BITMAP 有权
    通过BITMAP的树表示来分配文件存储的方法和装置

    公开(公告)号:US20110153976A1

    公开(公告)日:2011-06-23

    申请号:US12645364

    申请日:2009-12-22

    IPC分类号: G06F12/02 G06F12/00 G06F17/30

    摘要: Methods and apparatuses that search tree representations of a bitmap for available blocks to allocate in storage devices are described. An allocation request for a file may be received to initiate the search. In one embodiment, the bitmap may include an array of bits corresponding to blocks in the storage devices. Each bit may indicate whether one of the blocks is available. The tree representations may include at least one red-black tree having nodes corresponding to one or more consecutive bits in the bitmap indicating an extent of available blocks. One of the tree representations may be selected according to a file associated with an allocation request to identify an extent of available block matching the allocation request. The tree representations may be synchronized as the bitmap is updated with changes of block allocations in the storage devices.

    摘要翻译: 对存储设备中分配的可用块的位图搜索树表示的方法和装置进行了说明。 可以接收对文件的分配请求以启动搜索。 在一个实施例中,位图可以包括对应于存储设备中的块的位阵列。 每个位可以指示其中一个块是否可用。 树表示可以包括至少一个具有对应于位图中的一个或多个连续位的节点的红黑树,指示可用块的程度。 可以根据与分配请求相关联的文件来选择树表示中的一个,以识别与分配请求匹配的可用块的范围。 当存储设备中的块分配的改变随着位图被更新时,树表示可以被同步。

    Methods and apparatuses to optimize updates in a file system based on birth time
    4.
    发明授权
    Methods and apparatuses to optimize updates in a file system based on birth time 有权
    基于出生时间优化文件系统中的更新的方法和装置

    公开(公告)号:US08849876B2

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

    申请号:US12648273

    申请日:2009-12-28

    IPC分类号: G06F12/00 G06F17/30 G06F15/16

    摘要: 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。

    Methods and apparatuses to allocate file storage via tree representations of a bitmap
    5.
    发明授权
    Methods and apparatuses to allocate file storage via tree representations of a bitmap 有权
    通过位图的树表示来分配文件存储的方法和装置

    公开(公告)号:US08504792B2

    公开(公告)日:2013-08-06

    申请号:US12645364

    申请日:2009-12-22

    摘要: Methods and apparatuses that search tree representations of a bitmap for available blocks to allocate in storage devices are described. An allocation request for a file may be received to initiate the search. In one embodiment, the bitmap may include an array of bits corresponding to blocks in the storage devices. Each bit may indicate whether one of the blocks is available. The tree representations may include at least one red-black tree having nodes corresponding to one or more consecutive bits in the bitmap indicating an extent of available blocks. One of the tree representations may be selected according to a file associated with an allocation request to identify an extent of available block matching the allocation request. The tree representations may be synchronized as the bitmap is updated with changes of block allocations in the storage devices.

    摘要翻译: 对存储设备中分配的可用块的位图搜索树表示的方法和装置进行了说明。 可以接收对文件的分配请求以启动搜索。 在一个实施例中,位图可以包括对应于存储设备中的块的位阵列。 每个位可以指示其中一个块是否可用。 树表示可以包括至少一个具有对应于位图中的一个或多个连续位的节点的红黑树,指示可用块的程度。 可以根据与分配请求相关联的文件来选择树表示中的一个,以识别与分配请求匹配的可用块的范围。 当存储设备中的块分配的改变随着位图被更新时,树表示可以被同步。

    METHODS AND APPARATUSES TO OPTIMIZE UPDATES IN A FILE SYSTEM BASED ON BIRTH TIME
    6.
    发明申请
    METHODS AND APPARATUSES TO OPTIMIZE UPDATES IN A FILE SYSTEM BASED ON BIRTH TIME 有权
    基于生产时间优化文件系统更新的方法和设备

    公开(公告)号:US20110161381A1

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

    申请号:US12648273

    申请日:2009-12-28

    IPC分类号: G06F17/30

    摘要: 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。