公开(公告)号：US20070198458A1

公开(公告)日：2007-08-23

申请号：US11349474

申请日：2006-02-06

申请人： Ravisankar Pudipeddi

发明人： Ravisankar Pudipeddi

IPC分类号： G06F17/30

CPC分类号： G06F17/30067 ,  Y10S707/99952

摘要： Aspects of the subject matter described herein relate to distributed namespace aggregation. In aspects, a distributed file system is extended to allow multiple servers to seamlessly host files associated with aggregated links and/or aggregated roots. A request for a directory listing of an aggregated link or root may cause a server to sniff multiple other servers that host files associated with the link or root to create and return a concatenated result. Sniffing may also be used to determine which servers host the file to which the client is requesting access. Altitude may be used to determine which servers to make visible to the client and may also be used to determine which servers are in the same replica group and which are not.

摘要翻译： 本文描述的主题的方面涉及分布式命名空间聚合。 在方面，扩展分布式文件系统以允许多个服务器无缝地托管与聚合链接和/或聚合根相关联的文件。 对聚合链接或根目录列表的请求可能导致服务器嗅探托管与链接或根相关联的文件的多个其他服务器，以创建并返回连接结果。 也可以使用嗅探来确定哪些服务器托管客户端请求访问的文件。 海拔高度可用于确定哪些服务器使客户端可见，也可用于确定哪些服务器位于同一个副本组中，哪些服务器不在同一个副本组中。

公开(公告)号：US20070143563A1

公开(公告)日：2007-06-21

申请号：US11303419

申请日：2005-12-16

申请人： Ravisankar Pudipeddi ,  Kevin Seng ,  Garret Buban

发明人： Ravisankar Pudipeddi ,  Kevin Seng ,  Garret Buban

IPC分类号： G06F12/00 ,  G06F12/16

CPC分类号： G06F3/0644 ,  G06F3/0607 ,  G06F3/0608 ,  G06F3/0676

摘要： Described is a technology by which a new volume or partition may be created on a disk, e.g., by running a shrink program and then reclaiming freed space. Shrink occurs online, while the user or system processes may be otherwise using the disk for reads and writes. Further, the technology operates while protecting snapshot versions of the volume. To shrink, upon receiving a request to shrink a volume to within a boundary, new allocations are restricted such that any allocation is to a volume area within the boundary. Data is moved from outside the boundary to within the boundary, and the shrink is committed when no volume data remains outside the boundary. A reduced-size volume or partition that does not include the specified region is committed when the data has been moved out of the specified region. A new volume or partition may be freed that corresponds to the region.

摘要翻译： 描述了一种技术，通过该技术可以在盘上创建新的卷或分区，例如通过运行收缩程序然后回收释放的空间。 在线收缩，而用户或系统进程可能会以其他方式使用磁盘进行读写。 此外，该技术在保护卷的快照版本的同时运行。 要缩小，在收到将卷缩小到边界内的请求时，新的分配被限制，使得任何分配是在边界内的卷区域。 数据从边界外移动到边界内，并且当没有体数据保留在边界之外时，收缩被提交。 当数据移出指定区域之后，将提交不包含指定区域的缩小体积或分区。 可能会释放与该区域相对应的新卷或分区。

公开(公告)号：US20070061279A1

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

申请号：US11217986

申请日：2005-09-01

申请人： Neal Christiansen ,  Ravinder Thind ,  Ravisankar Pudipeddi ,  Sarosh Havewala

发明人： Neal Christiansen ,  Ravinder Thind ,  Ravisankar Pudipeddi ,  Sarosh Havewala

IPC分类号： G06F17/30

CPC分类号： G06F11/008 ,  Y10S707/99939 ,  Y10S707/99953

摘要： File system metadata regarding states of a file system affected by transactions is tracked consistently even in the face of dirty shutdowns which might cause rollbacks in transactions which have already been reflected in the metadata. In order to only request time- and resource-heavy rebuilding of metadata for metadata which may have been affected by rollbacks, reliability information is tracked regarding metadata items. When a metadata item is affected by a transaction which may not complete properly in the case of a problematic shutdown or other event, that metadata item's reliability information indicates that it may not be reliable in case of such a problematic (“dirty” or“abnormal”) event. In addition to flag information indicating unreliability, timestamp information tracking a time of the command which has made a metadata item unreliable is also maintained. This timestamp information can then be used, along with information regarding a period after which the transaction will no longer cause a problem in the case of a problematic event, in order to reset the reliability information to indicate that the metadata item is now reliable even in the face of a problematic event.

摘要翻译： 即使遇到已经在元数据中反映的事务中可能导致回滚的脏关机，文档系统元数据也会一直被跟踪。 为了仅对请求可能受到回滚影响的元数据的元数据进行时间和资源重型重建，可以跟踪关于元数据项的可靠性信息。 当元数据项目受到可能无法在有问题的关闭或其他事件的情况下可能无法正常完成的事务的影响时，该元数据项的可靠性信息表明在出现这种问题（“肮脏”或“异常”）情况下可能不可靠 “）事件。 除了指示不可靠性的标志信息之外，还保持跟踪使得使元数据项不可靠的命令的时间的时间戳信息。 然后可以使用该时间戳信息以及关于事务不再在有问题的事件的情况下不再导致问题的时间段的信息，以便重置可靠性信息以指示元数据项目现在是可靠的，即使在 面对一个有问题的事件。

公开(公告)号：US20070050539A1

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

申请号：US11211863

申请日：2005-08-25

申请人： Ravisankar Pudipeddi

发明人： Ravisankar Pudipeddi

IPC分类号： G06F13/00

CPC分类号： G06F3/0638 ,  G06F3/061 ,  G06F3/0671 ,  G06F11/1064

摘要： A generic disk driver filter may be used to accelerate performance when writing to a disk. The generic disk driver filter may be connected between a file system and a disk driver and may be configured to be extensible and compatible with a variety of different file systems and different disk drivers. The generic disk driver filter has a filter component that intercepts and filters raw sector write commands from the file system before they are received by the disk driver. The generic disk driver filter may also have a cache memory component that stores a checksum for each sector which is written to the disk. The generic disk driver filter may also have a scavenger thread component that detects and removes latent checksum entries from the cache memory so as to preserve memory availability and reduce memory requirements.

摘要翻译： 可以使用通用磁盘驱动程序过滤器来加速写入磁盘时的性能。 通用磁盘驱动器过滤器可以连接在文件系统和磁盘驱动器之间，并且可以被配置为可扩展的并且与各种不同的文件系统和不同的磁盘驱动器兼容。 通用磁盘驱动程序过滤器具有一个过滤器组件，它们在被磁盘驱动程序接收之前拦截并过滤来自文件系统的原始扇区写入命令。 通用磁盘驱动程序过滤器还可以具有高速缓存存储器组件，其存储写入到磁盘的每个扇区的校验和。 通用磁盘驱动程序过滤器还可以具有清除线程组件，其检测和去除缓存存储器中的潜在校验和条目，以便保持存储器可用性并减少存储器需求。

公开(公告)号：US20060200635A1

公开(公告)日：2006-09-07

申请号：US11402493

申请日：2006-04-11

申请人： Ravisankar Pudipeddi ,  Neill Clift ,  Neal Christiansen

发明人： Ravisankar Pudipeddi ,  Neill Clift ,  Neal Christiansen

IPC分类号： G06F12/00

CPC分类号： G06F12/0261

摘要： A system and method for object rundown protection that scales with the number of processors in a shared-memory computer system is disclosed. In an embodiment of the present invention, prior to object rundown, a cache-aware reference count data structure is used to prevent cache-pinging that would otherwise result from data sharing across processors in a multiprocessor computer system. In this data structure, a counter of positive references and negative dereferences, aligned on a particular cache line, is maintained for each processor. When an object is to be destroyed, a rundown wait process is begun, during which new references on the object are prohibited, and the total number of outstanding references is added to an on-stack global counter. Destruction is delayed until the global reference count is reduced to zero. In an embodiment of the invention suited to implementation on non-uniform memory access multiprocessor machines, each processor's reference count is additionally allocated in a region of main memory that is physically close to that processor.

摘要翻译： 公开了一种与共享存储器计算机系统中的处理器数量相比较的对象破坏保护的系统和方法。 在本发明的一个实施例中，在对象清除之前，使用高速缓存感知引用计数数据结构来防止否则将在多处理器计算机系统中的处理器之间的数据共享导致的高速缓存ping。 在这种数据结构中，为每个处理器维护在特定高速缓存线上对齐的正引用和负解除引用的计数器。 当一个对象被破坏时，开始一个等待时间的过程，在该过程中，禁止对对象的新引用，并将未完成引用的总数添加到堆栈中的全局计数器。 破坏延迟，直到全局引用计数减少为零。 在适于在非均匀存储器访问多处理器机器上实现的本发明的实施例中，每个处理器的引用计数额外分配在物理上靠近该处理器的主存储器的区域中。

公开(公告)号：US07072914B2

公开(公告)日：2006-07-04

申请号：US11008822

申请日：2004-12-10

申请人： Luis Felipe Cabrera ,  Deborah C. Jones ,  Ravisankar Pudipeddi ,  Stefan R. Steiner

发明人： Luis Felipe Cabrera ,  Deborah C. Jones ,  Ravisankar Pudipeddi ,  Stefan R. Steiner

IPC分类号： G06F17/30

CPC分类号： G06F17/30067 ,  Y10S707/966 ,  Y10S707/99931 ,  Y10S707/99954

摘要： A technique is provided whereby a stream of data located in a first storage location is registered for migration administration and according to preset criteria, portion(s) of the stream of data that are suited to another storage location are migrated to maximize system storage efficiencies. The file system may have use of facilities that enable the monitoring of files/streams that have been registered for migration administration or files/streams may be polled according to preset criteria. If the stream of data has portions to migrate to another storage location, the hierarchical storage management (HSM) system migrates the data to the other storage location, such as to long term or off-line storage, and preserves the data relationships of the stream via metadata. The technique allows for multiple volumes to be spanned by the migration target location, and multiple file systems may service the source and target.

摘要翻译： 提供了一种技术，其中位于第一存储位置的数据流被注册用于迁移管理，并且根据预设标准，迁移适合于另一存储位置的数据流的部分以最大化系统存储效率。 文件系统可以使用能够监视已经注册用于迁移管理的文件/流的设施，或者可以根据预设标准轮询文件/流。 如果数据流具有要迁移到另一个存储位置的部分，则分层存储管理（HSM）系统将数据迁移到另一个存储位置，例如长期或离线存储，并保留数据流的数据关系 通过元数据。 该技术允许由迁移目标位置跨越多个卷，并且多个文件系统可以为源和目标服务。

公开(公告)号：US20060080367A1

公开(公告)日：2006-04-13

申请号：US10960675

申请日：2004-10-07

申请人： Ravisankar Pudipeddi

发明人： Ravisankar Pudipeddi

IPC分类号： G06F17/30

CPC分类号： G06F9/5016 ,  G06F9/466 ,  G06F9/52 ,  G06F2209/504 ,  G06F2209/508 ,  Y02D10/22

摘要： A method and system for limiting resource usage of a version store. A limit indicates a total amount of resources that may be consumed by in-progress transactions. A running total of the amount of remaining resources is maintained. Before a new transaction is started, a determination is made as to whether there are enough resources remaining to complete the new transaction. If so, the transaction starts and the running total is adjusted. If not, the transaction waits until more resources are available. When a transaction completes, if it is the oldest in-progress transaction, resources are released. Otherwise, the resources associated with the transaction are not released until all transactions that started before the transaction have completed. This ensures that a client of a version store does not exceed the limit of resources that may be consumed by in-progress transactions.

公开(公告)号：US06889232B2

公开(公告)日：2005-05-03

申请号：US09783787

申请日：2001-02-15

申请人： Ravisankar Pudipeddi ,  Ran Kalach

发明人： Ravisankar Pudipeddi ,  Ran Kalach

IPC分类号： G06F17/30

CPC分类号： G06F17/30221 ,  Y10S707/99931 ,  Y10S707/99934 ,  Y10S707/99938 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99945 ,  Y10S707/99948 ,  Y10S707/99953

摘要： A method for concurrent data migration includes classifying files to be migrated into plural jobs, selecting media to which to migrate each job, and using plural drives concurrently to write the jobs to the media. The selection of a medium is performed in a way that prevents the number of writeable media from exceeding the number of available drives, unless no allocated medium has sufficient space to store any files in a migration job. A medium is preferentially selected that has already been allocated for writing, has space to store at least one file in the job, is not in use for another job, and can be robotically mounted on a drive. If such a medium does not exist, then the set of available media is canvassed to locate an alternative medium. The attributes of each medium are evaluated to determine which medium can be selected most consistently with the goals of (1) preventing the number of media from exceeding the number of drives, and (2) providing sufficient media to allow plural drives to be used concurrently. The technique can be embodied in a file management environment that transparently migrates files meeting certain criteria and stores the location of the migrated file in a reparse point provided by the file system.

摘要翻译： 并行数据迁移的方法包括将要迁移到多个作业的文件进行分类，选择要迁移到每个作业的介质，并且同时使用多个驱动器将作业写入介质。 介质的选择以防止可写入介质数量超过可用驱动器数量的方式执行，除非没有分配的介质具有足够的空间来存储迁移作业中的任何文件。 优先选择已经被分配用于写入的介质，具有在作业中存储至少一个文件的空间，不用于另一作业，并且可以机械地安装在驱动器上。 如果这样的介质不存在，则可以使用该组可用介质来定位替代介质。 对每种介质的属性进行评估，以确定哪种介质最可以一致地选择（1）防止介质数量超过驱动器数量，以及（2）提供足够的介质以允许同时使用多个驱动器 。 该技术可以体现在文件管理环境中，该文件管理环境透明地迁移满足某些标准的文件，并将迁移的文件的位置存储在由文件系统提供的重新分析点中。

公开(公告)号：US06675257B1

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

申请号：US09607505

申请日：2000-06-28

申请人： ATM Shafiqul Khalid ,  Ravisankar Pudipeddi

发明人： ATM Shafiqul Khalid ,  Ravisankar Pudipeddi

IPC分类号： G06F1208

CPC分类号： G06F3/0644 ,  G06F3/0607 ,  G06F3/0682 ,  G11B20/1201 ,  G11B27/032 ,  G11B27/107 ,  G11B2220/90 ,  Y10S707/99953 ,  Y10S707/99954

摘要： A system and method store information to a sequential storage media such that storage space occupied-by data deemed obsolete may be reclaimed. Information may be written to the storage media as sequential data sets with each data set including a catalog describing the information in the data set. A reclamation catalog identifies the obsolete data stored on the media and is written to the media. A generation number on the storage media may indicate whether the storage media has been reclaimed. A reclamation process transfers data from the source media (e.g., the tape media that includes obsolete data) to a destination media (e.g., a blank tape) while excluding the obsolete data identified in the reclamation catalog. The reclamation process may read a catalog stored on the source media that describes the data stored on the source media. The reclamation process then modifies that catalog by the information stored in the reclamation catalog to create a unified catalog. The unified catalog identifies which of the data stored on the source media is to be copied to the destination media. The reclamation process then copies the data identified in the unified catalog to the destination media. The reclamation process may additionally increment the generation number to indicate that the storage media has been reclaimed.

摘要翻译： 系统和方法将信息存储到顺序存储介质，使得被认为过时的被数据占用的存储空间可以被回收。 可以将信息作为顺序数据集写入存储介质，每个数据集包括描述数据集中的信息的目录。 回收目录识别存储在介质上的过时数据，并将其写入介质。 存储介质上的代号可以指示存储介质是否已被回收。 回收过程将来自源介质（例如，包括过时数据的磁带介质）的数据传送到目的地介质（例如，空白磁带），同时排除在回收目录中标识的过时数据。 回收过程可以读取存储在源介质上的存储在源介质上的数据的目录。 回收过程然后根据存储在回收目录中的信息修改该目录以创建统一的目录。 统一的目录将存储在源媒体上的数据复制到目标介质。 然后，回收过程将统一目录中标识的数据复制到目标介质。 回收过程可以另外增加代数，以指示存储介质已被回收。

公开(公告)号：US08429395B2

公开(公告)日：2013-04-23

申请号：US12483465

申请日：2009-06-12

申请人： Christopher D. Russell ,  Eric P. Traut ,  Ravisankar Pudipeddi ,  Adam D. Stritzel ,  Suyash Sinha

发明人： Christopher D. Russell ,  Eric P. Traut ,  Ravisankar Pudipeddi ,  Adam D. Stritzel ,  Suyash Sinha

IPC分类号： G06F9/00

CPC分类号： G06F8/71

摘要： A request is received from a software component of a software product to access a value of a public setting of the software component. A check is made as to whether the request conforms to an appropriate format for the public setting. If the request conforms to the appropriate format, then the requested access is performed. However, if the request does not conform to the appropriate format, then the requested access is denied. Multiple values for the public setting can be received and maintained concurrently.