公开(公告)号：US09286302B2

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

申请号：US12914892

申请日：2010-10-28

Applicant: Freddy James ,  Kedar Patwardhan ,  Sudheer Keshav Chepa

Inventor： Freddy James ,  Kedar Patwardhan ,  Sudheer Keshav Chepa

IPC: G06F17/30

CPC classification number: G06F17/30091

Abstract: Systems and methods for inode use are presented. In one embodiment; an inode reuse method includes: receiving an indication of an operation that involves access to file related information; assigning an inode to the access; identifying one of a plurality of inode reuse scenarios for the inode; and making the inode available for reuse in accordance with the one of the plurality of inode reuse scenarios. In one embodiment, the one of the plurality of inode reuse scenarios is a relatively expedited reuse scenario. In one exemplary implementation, the relatively expedited inode reuse scenario is utilized if the inode is not required for further processing associated with the operation. The inode can be reused for another immediately subsequent operation. In one embodiment, a first one of the plurality of inode reuse scenarios includes placing the inode at a head queue position of a use queue and a second one of the plurality of inode reuse scenarios includes placing the inode in a tail queue position of the use queue. Association of the inode to the inode reuse scenario can be tracked. The tracking can include flagging the inode for relatively expedited reuse.

Abstract translation: 介绍了使用inode的系统和方法。 在一个实施例中; 索引节点重用方法包括：接收涉及访问文件相关信息的操作的指示; 为访问分配一个inode; 识别索引节点的多个inode重用场景中的一个; 以及使得所述inode可用于根据所述多个inode重用场景中的一个重新使用。 在一个实施例中，多个inode重用场景中的一个是相对加速的重用场景。 在一个示例性实现中，如果与操作相关联的进一步处理不需要inode，则利用相对加速的inode重用场景。 inode可以重新用于另一个即时的后续操作。 在一个实施例中，多个inode重用场景中的第一个包括将inode放置在使用队列的头部队列位置，并且多个inode重用场景中的第二个包括将inode放置在使用的尾随队列位置 队列。 可以跟踪inode到inode重用场景的关联。 跟踪可以包括标记inode用于相对加速的重用。

公开(公告)号：US08868839B1

公开(公告)日：2014-10-21

申请号：US13081706

申请日：2011-04-07

Applicant: Anindya Banerjee ,  Amit Jambure ,  Kedar Patwardhan ,  Niranjan Pendharkar

Inventor： Anindya Banerjee ,  Amit Jambure ,  Kedar Patwardhan ,  Niranjan Pendharkar

IPC: G06F12/00

CPC classification number: G06F12/122 ,  G06F12/0804 ,  G06F12/0868 ,  G06F2212/463

Abstract: 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.

Abstract translation: 计算机实现的方法可以包括识别包括存储在存储设备内的一个或多个数据块的文件。 计算机实现的方法还可以包括确定该文件已经比存储在存储设备中的一个或多个其他文件更频繁地被访问，然后跟踪在该存储器中访问与该文件相关联的至少一个数据块的次数 设备。 计算机实现的方法还可以包括确定与存储设备中的文件相关联的数据块的次数高于预定阈值。 此外，计算机实现的方法可以包括将与文件相关联的数据块缓存在高速缓存机制中以减少访问数据块所需的时间量。 还公开了各种其它方法，系统和计算机可读介质。

公开(公告)号：US08595189B2

公开(公告)日：2013-11-26

申请号：US13420358

申请日：2012-03-14

Applicant: Kedar Patwardhan

Inventor： Kedar Patwardhan

IPC: G06F17/30

CPC classification number: G06F17/30212

Abstract: A method for fast incremental replication of a file system. The method includes, at a data storage level, tracking file system status for a plurality of files by using a data structure inside respective inodes for the plurality of files, and at a file system level, tracking file system status for a plurality of files by using a file system mask structure. For all files present in a backup, a catalogue of the file path name and inode number is maintained on a source file system. During incremental backup, a source file system data structure enumerating a plurality of modified inodes is consulted. For inodes that have not been marked as removed or created, the file system mask structure that tracks modified portions is consulted to obtain a file incremental change and inodes. The method further includes performing incremental backup using the inodes that have been modified and appended.

Abstract translation: 一种用于文件系统快速增量复制的方法。 该方法包括在数据存储级别通过使用多个文件的各个inode内的数据结构来跟踪多个文件的文件系统状态，并且在文件系统级包括通过以下方式跟踪多个文件的文件系统状态 使用文件系统掩码结构。 对于备份中存在的所有文件，将在源文件系统上维护文件路径名和inode号的目录。 在增量备份期间，查询枚举多个修改的索引节点的源文件系统数据结构。 对于未标记为已删除或创建的节点，查询跟踪修改部分的文件系统掩码结构，以获取文件增量更改和inode。 该方法还包括使用已修改和附加的inode执行增量备份。

公开(公告)号：US08515919B1

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

申请号：US13106919

申请日：2011-05-13

Applicant: Kedar Patwardhan ,  Sanjay Kumar Jain ,  Sushil Sarjerao Patil ,  Ramprasad Chinthekindi ,  Neha Naik

Inventor： Kedar Patwardhan ,  Sanjay Kumar Jain ,  Sushil Sarjerao Patil ,  Ramprasad Chinthekindi ,  Neha Naik

IPC: G06F7/00

CPC classification number: G06F17/30079

Abstract: Techniques for optimizing data migration are disclosed. In one particular embodiment, the techniques may be realized as a method for optimizing data migration may comprise receiving a request for initiating a data migration application and migrating, via at least one computer processor, at least one data file from a migration list during the data migration application. The method for optimizing data migration may also comprise monitoring the migration of the at least one data file and determining whether the at least one data file is active during the migration of the at least one data file. The method for optimizing data migration may further comprise deferring the migration of the at least one data file based at least in part on a determination that the at least one data file is active and recording information associated with the at least one data file if the at least one data file is active.

Abstract translation: 公开了优化数据迁移的技术。 在一个具体实施例中，可以实现这些技术，因为用于优化数据迁移的方法可以包括接收启动数据迁移应用的请求，并且经由至少一个计算机处理器在数据期间从迁移列表迁移至少一个数据文件 迁移应用程序。 用于优化数据迁移的方法还可以包括监视至少一个数据文件的迁移，并且在至少一个数据文件的迁移期间确定该至少一个数据文件是否是活动的。 用于优化数据迁移的方法还可以包括至少部分地基于至少一个数据文件是活动的确定来延迟所述至少一个数据文件的迁移，并且如果所述至少一个数据文件处于 至少有一个数据文件处于活动状态。

公开(公告)号：US09646014B1

公开(公告)日：2017-05-09

申请号：US12550259

申请日：2009-08-28

Applicant: Sanjay Jain ,  Anindya Banerjee ,  Kedar Patwardhan

Inventor： Sanjay Jain ,  Anindya Banerjee ,  Kedar Patwardhan

IPC: G06F17/30

CPC classification number: G06F17/30135

Abstract: 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.

公开(公告)号：US08930333B1

公开(公告)日：2015-01-06

申请号：US13099843

申请日：2011-05-03

Applicant: Harold B. Prince ,  Balemurughan Kumaresan ,  Kedar Patwardhan

Inventor： Harold B. Prince ,  Balemurughan Kumaresan ,  Kedar Patwardhan

IPC: G06F17/30

CPC classification number: G06F17/30171

Abstract: A system and method for efficiently performing simultaneous access of files in a clustered file system. A cluster of nodes is coupled to a data storage medium. A first node executes a first thread with write operations for a given file. A second node executes a second thread with read operations for the given file. The first thread is appending the given file. In response, the first node requests a write lock range between an end-of-file for the given file to a highest possible endpoint. If a prediction determines the second thread may request read locks after the range it is currently reading, then the method enables the locks to be efficiently transferred from the first node to the second node before they are required on the second node, allowing the reading second node to proceed with fewer delays.

Abstract translation: 一种用于有效地执行群集文件系统中的文件的同时访问的系统和方法。 一组节点耦合到数据存储介质。 第一个节点执行一个给定文件的写入操作的第一个线程。 第二个节点执行给定文件的读取操作的第二个线程。 第一个线程是附加给定的文件。 作为响应，第一个节点请求给定文件的文件结尾之间的写入锁定范围到最高可能的端点。 如果预测确定第二线程可能在其当前正在读取的范围之后请求读锁，则该方法使得能够在第二节点需要锁之前将其有效地从第一节点传送到第二节点，从而允许读取第二 节点进行更少的延迟。

公开(公告)号：US08924353B1

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

申请号：US13291753

申请日：2011-11-08

Applicant: Kedar Patwardhan ,  Sanjay Jain

Inventor： Kedar Patwardhan ,  Sanjay Jain

IPC: G06F17/30

CPC classification number: G06F17/30073 ,  G06F17/30289

Abstract: A computer-implemented method for copying database files may include (1) identifying a request to copy a database file to a target location, and in response to identifying the request to copy the database file to the target location, (2) identifying a preallocated but unused portion of the database file, (3) transmitting a used portion of the database file to the target location, and (4) transmitting a metadata representation of the unused portion of the database file to the target location, the metadata representation being smaller than the unused portion. Various other methods and systems are also disclosed.

Abstract translation: 用于复制数据库文件的计算机实现的方法可以包括（1）识别将数据库文件复制到目标位置的请求，以及响应于识别将数据库文件复制到目标位置的请求，（2）识别预分配 但是未使用的数据库文件部分，（3）将数据库文件的使用部分发送到目标位置，以及（4）将数据库文件的未使用部分的元数据表示发送到目标位置，元数据表示较小 比未使用部分。 还公开了各种其它方法和系统。

公开(公告)号：US08527990B1

公开(公告)日：2013-09-03

申请号：US13097635

申请日：2011-04-29

Applicant: Shailesh Vaman Marathe ,  Niranjan Pendharkar ,  Kedar Patwardhan

Inventor： Shailesh Vaman Marathe ,  Niranjan Pendharkar ,  Kedar Patwardhan

IPC: G06F9/455

CPC classification number: G06F9/4856 ,  G06F9/45558 ,  G06F2009/4557

Abstract: A computer-implemented method for migrating virtual machines may include: 1) identifying a request to migrate a virtual machine from a primary site to a secondary site, the primary site including a primary storage device used by the virtual machine and configured for asynchronous replication to a secondary storage device at the secondary site, 2) identifying a difference map that reflects differences between data on the primary storage device and the secondary storage device, 3) initiating the virtual machine at the secondary site, 4) intercepting an input/output attempt from the virtual machine at the secondary site to the secondary storage device, 5) determining, based on the difference map, that a region of the input/output attempt has not been synchronized from the primary storage device, and 6) retrieving the region from the primary storage device before allowing the input/output attempt to proceed. Various other methods, systems, and computer-readable media are disclosed.

Abstract translation: 用于迁移虚拟机的计算机实现的方法可以包括：1）识别将虚拟机从主站点迁移到辅助站点的请求，所述主站点包括虚拟机使用的主存储设备并且被配置为用于异步复制到 辅助站点上的辅助存储设备，2）识别反映主存储设备和辅助存储设备上的数据之间的差异的差异映射，3）在辅助站点启动虚拟机，4）拦截输入/输出尝试 从次要站点的虚拟机到次要存储设备，5）基于差异映射确定输入/输出尝试的区域未与主存储设备同步，以及6）从 允许输入/输出尝试继续进行的主存储设备。 公开了各种其它方法，系统和计算机可读介质。

公开(公告)号：US20120259819A1

公开(公告)日：2012-10-11

申请号：US13083013

申请日：2011-04-08

Applicant: Kedar Patwardhan ,  Rachit Chadha ,  Sushil Patil

Inventor： Kedar Patwardhan ,  Rachit Chadha ,  Sushil Patil

IPC: G06F17/30

CPC classification number: G06F17/30079 ,  G06F17/30171 ,  G06F17/30203

Abstract: A method for file lock recovery in a distributed computer system. The method includes executing a distributed computer system having a plurality of nodes comprising a cluster, and initiating a network file system server migration from one node of the cluster to a different node of the cluster. A migration count is incremented, wherein the migration count is stored at each of the nodes comprising the cluster. File lock services are paused at each of the nodes comprising the cluster. The network file system server migration is completed at the different node of the cluster. The migration count is then decremented in response to the completion. File lock services are then resumed at each of the nodes comprising cluster.

Abstract translation: 一种在分布式计算机系统中进行文件锁恢复的方法。 该方法包括执行具有包括集群的多个节点的分布式计算机系统，以及启动网络文件系统服务器从集群的一个节点迁移到集群的不同节点。 迁移计数增加，其中迁移计数被存储在包括集群的每个节点处。 在包含群集的每个节点上暂停文件锁服务。 网络文件系统服务器迁移在集群的不同节点完成。 然后，迁移计数将根据完成次数递减。 然后在包含群集的每个节点上恢复文件锁服务。

公开(公告)号：US20120042062A1

公开(公告)日：2012-02-16

申请号：US12857453

申请日：2010-08-16

Applicant: Rahul Ravindra Borade ,  Anindya Banerjee ,  Kedar Patwardhan

Inventor： Rahul Ravindra Borade ,  Anindya Banerjee ,  Kedar Patwardhan

IPC: G06F15/173 ,  G06F7/00

CPC classification number: G06F17/30115 ,  G06F17/30165

Abstract: 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.

Abstract translation: 分割目录的方法。 监视例如共享/排除和/或等待请求，例如共享/排除，以访问具有目录的一个或多个文件，例如增加/减少相应的计数器。 等待的请求排队等待在稍后的时间被授予。 如果访问目录的多个等待请求大于多个启发式的阈值，并且可选地进一步基于满足至少可编程时间阈值周期的条件，则确定该目录被用于划分。 如果该目录用于分区，则会自动生成触发信号。 触发信号使文件系统对目录进行分区。 可以理解，多个启发式是用户可编程的。