专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09646014B1 Systems and methods for selective defragmentation 有权
公开(公告)号：US09646014B1
公开(公告)日：2017-05-09
申请号：US12550259
申请日：2009-08-28
申请人： Sanjay Jain , Anindya Banerjee , Kedar Patwardhan
发明人： Sanjay Jain , Anindya Banerjee , Kedar Patwardhan
IPC分类号： G06F17/30
CPC分类号： G06F17/30135
摘要： Various computer-implemented methods for selective defragmentation are disclosed. In one example, an exemplary method for performing such a task may include: 1) identifying a file system, 2) tracking changes to files in the file system, 3) creating a list of changed files, and then 4) selectively defragmenting files in the list of changed files. Various other methods, systems, and computer-readable media are also disclosed.

2. 发明授权

US09529812B1 Timestamp handling for partitioned directories 有权
标题翻译：分区目录的时间戳处理
公开(公告)号：US09529812B1
公开(公告)日：2016-12-27
申请号：US13104150
申请日：2011-05-10
申请人： Freddy James , Kedar Patwardhan , Sushil Patil , Anindya Banerjee
发明人： Freddy James , Kedar Patwardhan , Sushil Patil , Anindya Banerjee
IPC分类号： G06F17/30
CPC分类号： G06F17/30106
摘要： Various systems and methods use advisory metadata to track the status of file system objects. For example, one method can involve accessing a first item of advisory metadata, which is associated with a namespace-visible parent directory and identifies a first transaction and a first time, and accessing a second item of advisory metadata, which is also associated with the namespace-visible parent directory and identifies a second transaction and a second time. The namespace visible parent directory includes multiple namespace-hidden directories. The method can then select a time value of the advisory metadata for the namespace-visible parent directory, based upon the first item and the second item. The method can be performed by a computing device implementing a file system.
摘要翻译：各种系统和方法使用咨询元数据来跟踪文件系统对象的状态。例如，一种方法可以涉及访问第一项咨询元数据，该第一项与名称空间可见的父目录相关联，并且识别第一事务和第一次，以及访问第二项咨询元数据，该第二项还与命名空间可见的父目录，并标识第二个事务和第二次事务。命名空间可见父目录包含多个命名空间隐藏目录。然后，该方法可以基于第一项和第二项来选择名称空间可见父目录的咨询元数据的时间值。该方法可以由实现文件系统的计算设备执行。

3. 发明授权

US08930528B2 Method and system for partitioning directories 有权
标题翻译：用于分区目录的方法和系统
公开(公告)号：US08930528B2
公开(公告)日：2015-01-06
申请号：US12857453
申请日：2010-08-16
申请人： Rahul Ravindra Borade , Anindya Banerjee , Kedar Patwardhan
发明人： Rahul Ravindra Borade , Anindya Banerjee , Kedar Patwardhan
IPC分类号： G06F15/173 , G06F17/30
CPC分类号： G06F17/30115 , G06F17/30165
摘要： A method of partitioning directory. Accesses, e.g., shared/exclusive, and/or waiting requests, e.g., shared/exclusive, to access one or more files with a directory are monitored, e.g., incrementing/decrementing respective counters. The waiting requests are queued to be granted at a later time. The directory is determined to be primed for partitioning if a number of waiting requests to access the directory is greater than a threshold value of a plurality of heuristics and optionally further based on satisfying the condition for at least a programmable time threshold period. A trigger signal is automatically generated if the directory is primed for partitioning. The trigger signal causes a file system to partition the directory. It is appreciated that the plurality of heuristics is user programmable.
摘要翻译：分割目录的方法。监视例如共享/排除和/或等待请求，例如共享/排除，以访问具有目录的一个或多个文件，例如增加/减少相应的计数器。等待的请求排队等待在稍后的时间被授予。如果访问目录的多个等待请求大于多个启发式的阈值，并且可选地进一步基于满足至少可编程时间阈值周期的条件，则确定该目录被用于划分。如果该目录用于分区，则会自动生成触发信号。触发信号使文件系统对目录进行分区。可以理解，多个启发式是用户可编程的。

4. 发明授权

US08868839B1 Systems and methods for caching data blocks associated with frequently accessed files 有权
标题翻译：用于缓存与经常访问的文件相关联的数据块的系统和方法
公开(公告)号：US08868839B1
公开(公告)日：2014-10-21
申请号：US13081706
申请日：2011-04-07
申请人： Anindya Banerjee , Amit Jambure , Kedar Patwardhan , Niranjan Pendharkar
发明人： Anindya Banerjee , Amit Jambure , Kedar Patwardhan , Niranjan Pendharkar
IPC分类号： G06F12/00
CPC分类号： G06F12/122 , G06F12/0804 , G06F12/0868 , G06F2212/463
摘要： A computer-implemented method may include identifying a file that includes one or more data blocks stored within a storage device. The computer-implemented method may also include determining that the file has been accessed more frequently than one or more other files stored within the storage device and then tracking the number of times that at least one data block associated with the file is accessed in the storage device. The computer-implemented method may further include determining that the number of times that the data block associated with the file has been accessed in the storage device is above a predetermined threshold. In addition, the computer-implemented method may include caching the data block associated with the file in a caching mechanism to decrease the amount of time required to access the data block. Various other methods, systems, and computer-readable media are also disclosed.
摘要翻译：计算机实现的方法可以包括识别包括存储在存储设备内的一个或多个数据块的文件。计算机实现的方法还可以包括确定该文件已经比存储在存储设备中的一个或多个其他文件更频繁地被访问，然后跟踪在该存储器中访问与该文件相关联的至少一个数据块的次数设备。计算机实现的方法还可以包括确定与存储设备中的文件相关联的数据块的次数高于预定阈值。此外，计算机实现的方法可以包括将与文件相关联的数据块缓存在高速缓存机制中以减少访问数据块所需的时间量。还公开了各种其它方法，系统和计算机可读介质。

5. 发明申请

US20120042062A1 METHOD AND SYSTEM FOR PARTITIONING DIRECTORIES 有权
标题翻译：分类方法和系统
公开(公告)号：US20120042062A1
公开(公告)日：2012-02-16
申请号：US12857453
申请日：2010-08-16
申请人： Rahul Ravindra Borade , Anindya Banerjee , Kedar Patwardhan
发明人： Rahul Ravindra Borade , Anindya Banerjee , Kedar Patwardhan
IPC分类号： G06F15/173 , G06F7/00
CPC分类号： G06F17/30115 , G06F17/30165
摘要： A method of partitioning directory. Accesses, e.g., shared/exclusive, and/or waiting requests, e.g., shared/exclusive, to access one or more files with a directory are monitored, e.g., incrementing/decrementing respective counters. The waiting requests are queued to be granted at a later time. The directory is determined to be primed for partitioning if a number of waiting requests to access the directory is greater than a threshold value of a plurality of heuristics and optionally further based on satisfying the condition for at least a programmable time threshold period. A trigger signal is automatically generated if the directory is primed for partitioning. The trigger signal causes a file system to partition the directory. It is appreciated that the plurality of heuristics is user programmable.
摘要翻译：分割目录的方法。监视例如共享/排除和/或等待请求，例如共享/排除，以访问具有目录的一个或多个文件，例如增加/减少相应的计数器。等待的请求排队等待在稍后的时间被授予。如果访问目录的多个等待请求大于多个启发式的阈值，并且可选地进一步基于满足至少可编程时间阈值周期的条件，则确定该目录被用于划分。如果该目录用于分区，则会自动生成触发信号。触发信号使文件系统对目录进行分区。可以理解，多个启发式是用户可编程的。

6. 发明授权

US08725866B2 Method and system for link count update and synchronization in a partitioned directory 有权
标题翻译：分区目录中的链接计数更新和同步的方法和系统
公开(公告)号：US08725866B2
公开(公告)日：2014-05-13
申请号：US12857460
申请日：2010-08-16
申请人： Rahul Ravindra Borade , Anindya Banerjee , Kedar Patwardhan
发明人： Rahul Ravindra Borade , Anindya Banerjee , Kedar Patwardhan
IPC分类号： G06F15/173
CPC分类号： G06F17/30197 , G06F17/30165
摘要： A method of updating a link count in a partitioned directory shared by a plurality of computers within a cluster. The partitioned directory is traversed once by a first computer to obtain a link count. The link count is stored in the first computer and broadcast to a cluster of computers. A total number of allocated links is less than a maximum limit on link count minus the link count. A respective number of links is allocated to each computer within the cluster. Delta values of each computer are updated in real-time as subdirectories are created/erased. A delta value associated with each of the plurality of computers is received. A delta value represents a net number of links created or removed by each computer. The link count is updated based on the previous link count and further based on each of the delta values and further based a delta value associated with the first computer. The updated link count is stored by the first computer and broadcast to the plurality of computers.
摘要翻译：一种更新由群集内的多个计算机共享的分区目录中的链接计数的方法。分区目录由第一台计算机遍历一次以获得链路计数。链接计数存储在第一台计算机中，并广播到一组计算机。分配链路的总数小于链路计数减去链路计数的最大限制。相应数量的链路被分配给集群内的每个计算机。当创建/删除子目录时，每台计算机的Delta值都会实时更新。接收与多个计算机中的每一个相关联的增量值。 delta值表示每个计算机创建或删除的链接的净数。链路计数基于先前的链路计数更新，并进一步基于每个增量值，并进一步基于与第一计算机相关联的增量值。更新的链接计数由第一计算机存储并广播到多个计算机。

7. 发明授权

US08429209B2 Method and system for efficiently reading a partitioned directory incident to a serialized process 有权
标题翻译：方法和系统，用于有效读取事件到序列化过程的分区目录
公开(公告)号：US08429209B2
公开(公告)日：2013-04-23
申请号：US12857441
申请日：2010-08-16
申请人： Mitul Kothari , Brad Boyer , Anindya Banerjee , Kedar Patwardhan , Ryan Robert Lefevre
发明人： Mitul Kothari , Brad Boyer , Anindya Banerjee , Kedar Patwardhan , Ryan Robert Lefevre
IPC分类号： G06F12/00
CPC分类号： G06F17/30091 , G06F17/30486
摘要： A method of reading data from a partitioned directory incident to a serialized process. A first read and an offset value are received. A first data block in a modeled fully partitioned directory is identified based on the offset value and a predetermined number of entries associated with a buffer. It is determined whether the first data block in the fully partitioned directory is present in the actual partitioned directory. Zeros are written in the buffer if the first data block in the fully partitioned directory is not present in the actual partitioned directory otherwise the first data block associated with the actual partitioned directory is written to the buffer. A second data block is similarly read by a second read operation and written. The second data block is associated with a second subdirectory, selected based on a horizontal node traversal at a node level of said first subdirectory.
摘要翻译：从事件到序列化处理的分区目录中读取数据的方法。接收到第一读取和偏移值。基于偏移值和与缓冲器相关联的预定数量的条目来识别建模完全分区目录中的第一数据块。确定完全分区目录中的第一数据块是否存在于实际分区目录中。如果完全分区目录中的第一个数据块不存在于实际分区目录中，则将零写入缓冲区，否则将与实际分区目录关联的第一个数据块写入缓冲区。第二数据块通过第二读取操作类似地读取并写入。所述第二数据块与第二子目录相关联，所述第二子目录是基于所述第一子目录的节点级的横向节点遍历来选择的。

8. 发明授权

US08392478B2 Method and system for efficiently reading a partitioned directory incident to a serialized process 有权
公开(公告)号：US08392478B2
公开(公告)日：2013-03-05
申请号：US12857441
申请日：2010-08-16
申请人： Mitul Kothari , Brad Boyer , Anindya Banerjee , Kedar Patwardhan , Ryan Robert Lefevre
发明人： Mitul Kothari , Brad Boyer , Anindya Banerjee , Kedar Patwardhan , Ryan Robert Lefevre
IPC分类号： G06F12/00
摘要： A method of reading data from a partitioned directory incident to a serialized process. A first read and an offset value are received. A first data block in a modeled fully partitioned directory is identified based on the offset value and a predetermined number of entries associated with a buffer. It is determined whether the first data block in the fully partitioned directory is present in the actual partitioned directory. Zeros are written in the buffer if the first data block in the fully partitioned directory is not present in the actual partitioned directory otherwise the first data block associated with the actual partitioned directory is written to the buffer. A second data block is similarly read by a second read operation and written. The second data block is associated with a second subdirectory, selected based on a horizontal node traversal at a node level of said first subdirectory.

9. 发明申请

US20120042063A1 METHOD AND SYSTEM FOR LINK COUNT UPDATE AND SYNCHRONIZATION IN A PARTITIONED DIRECTORY 有权
标题翻译：方法和系统用于链接计数更新和分区目录中的同步
公开(公告)号：US20120042063A1
公开(公告)日：2012-02-16
申请号：US12857460
申请日：2010-08-16
申请人： Rahul Ravindra Borade , Anindya Banerjee , Kedar Patwardhan
发明人： Rahul Ravindra Borade , Anindya Banerjee , Kedar Patwardhan
IPC分类号： G06F15/173
CPC分类号： G06F17/30197 , G06F17/30165
摘要： A method of updating a link count in a partitioned directory shared by a plurality of computers within a cluster. The partitioned directory is traversed once by a first computer to obtain a link count. The link count is stored in the first computer and broadcast to a cluster of computers. A total number of allocated links is less than a maximum limit on link count minus the link count. A respective number of links is allocated to each computer within the cluster. Delta values of each computer are updated in real-time as subdirectories are created/erased. A delta value associated with each of the plurality of computers is received. A delta value represents a net number of links created or removed by each computer. The link count is updated based on the previous link count and further based on each of the delta values and further based a delta value associated with the first computer. The updated link count is stored by the first computer and broadcast to the plurality of computers.
摘要翻译：一种更新由群集内的多个计算机共享的分区目录中的链接计数的方法。分区目录由第一台计算机遍历一次以获得链路计数。链接计数存储在第一台计算机中，并广播到一组计算机。分配链路的总数小于链路计数减去链路计数的最大限制。相应数量的链路被分配给集群内的每个计算机。当创建/删除子目录时，每台计算机的Delta值都会实时更新。接收与多个计算机中的每一个相关联的增量值。 delta值表示每个计算机创建或删除的链接的净数。链路计数基于先前的链路计数更新，并进一步基于每个增量值，并进一步基于与第一计算机相关联的增量值。更新的链接计数由第一计算机存储并广播到多个计算机。

10. 发明申请

US20120041923A1 METHOD AND SYSTEM FOR EFFICIENTLY READING A PARTITIONED DIRECTORY INCIDENT TO A SERIALIZED PROCESS 有权
标题翻译：方法和系统有效读取分类方法对序列化过程的影响
公开(公告)号：US20120041923A1
公开(公告)日：2012-02-16
申请号：US12857441
申请日：2010-08-16
申请人： Mitul Kothari , Brad Boyer , Anindya Banerjee , Kedar Patwardhan , Ryan Robert Lefevre
发明人： Mitul Kothari , Brad Boyer , Anindya Banerjee , Kedar Patwardhan , Ryan Robert Lefevre
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30091 , G06F17/30486
摘要： A method of reading data from a partitioned directory incident to a serialized process. A first read and an offset value are received. A first data block in a modeled fully partitioned directory is identified based on the offset value and a predetermined number of entries associated with a buffer. It is determined whether the first data block in the fully partitioned directory is present in the actual partitioned directory. Zeros are written in the buffer if the first data block in the fully partitioned directory is not present in the actual partitioned directory otherwise the first data block associated with the actual partitioned directory is written to the buffer. A second data block is similarly read by a second read operation and written. The second data block is associated with a second subdirectory, selected based on a horizontal node traversal at a node level of said first subdirectory.
摘要翻译：从事件到序列化处理的分区目录中读取数据的方法。接收到第一读取和偏移值。基于偏移值和与缓冲器相关联的预定数量的条目来识别建模完全分区目录中的第一数据块。确定完全分区目录中的第一数据块是否存在于实际分区目录中。如果完全分区目录中的第一个数据块不存在于实际分区目录中，则将零写入缓冲区，否则将与实际分区目录关联的第一个数据块写入缓冲区。第二数据块通过第二读取操作类似地读取并写入。所述第二数据块与第二子目录相关联，所述第二子目录是基于所述第一子目录的节点级的横向节点遍历来选择的。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式