公开(公告)号：US07444317B2

公开(公告)日：2008-10-28

申请号：US10187119

申请日：2002-06-28

申请人： Ravisankar Pudipeddi ,  Eileen C. Brown ,  Neal R. Christiansen

发明人： Ravisankar Pudipeddi ,  Eileen C. Brown ,  Neal R. Christiansen

IPC分类号： G06F17/30

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

摘要： Described is a method and system that manages filenames for filter drivers in a file system. The present invention includes a filter manager that handles filename queries from the filter drivers. The filter manager returns a pointer to the requesting filter driver that points to a filename information structure corresponding to the type of filename requested. The filter manager also manages a cache of filename information structures that include information that can be shared among the various filter drivers, amortizing the filename queries for filter drivers. The caching functionality of the filter manager increases the efficiency and reduces the overhead of filename queries within the file system by reducing the number of filename operations required for a file system filter driver to retrieve a desired portion of the filename.

摘要翻译： 描述了一种管理文件系统中过滤器驱动程序的文件名的方法和系统。 本发明包括处理来自过滤器驱动程序的文件名查询的过滤器管理器。 过滤器管理器返回指向请求的过滤器驱动程序的指针，指向与所请求的文件名类型相对应的文件名信息结构。 过滤器管理器还管理文件名信息结构的缓存，其中包括可以在各种过滤器驱动程序之间共享的信息，为过滤器驱动程序分摊文件名查询。 过滤器管理器的缓存功能通过减少文件系统过滤器驱动程序检索文件名的所需部分所需的文件名操作数来提高文件系统中的文件名查询的效率并减少文件名查询的开销。

公开(公告)号：US20080091702A1

公开(公告)日：2008-04-17

申请号：US11752872

申请日：2007-05-23

申请人： Ravisankar Pudipeddi ,  Vishal Ghotge ,  Sarosh Havewala ,  Ravinder Thind ,  Mark Zbikowski

发明人： Ravisankar Pudipeddi ,  Vishal Ghotge ,  Sarosh Havewala ,  Ravinder Thind ,  Mark Zbikowski

IPC分类号： G06F7/00

CPC分类号： G06F17/30324 ,  G06F3/0607 ,  G06F3/0643 ,  G06F3/067 ,  G06F17/3007 ,  G06F17/30138 ,  G06F17/30182 ,  G06F17/30218 ,  G06F17/30342 ,  G06F17/30581 ,  G06F17/30598

摘要： An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries. The directory entry types can define whether a cluster chain corresponding to a file can be contiguously allocated.

摘要翻译： 提供了一种用于便携式存储介质的可扩展文件系统格式。 可扩展文件系统格式包括可以自定义定义的主要和次要目录条目类型的规范。 主要和次要目录条目类型可以进一步分类为关键和良性的目录条目。 目录条目类型可以定义是否可以连续分配对应于文件的集群链。

公开(公告)号：US20060253655A1

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

申请号：US11480799

申请日：2006-07-03

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

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

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

CPC分类号： G06F12/0261

摘要： Object rundown protection that scales with the number of processors in a shared-memory computer system is disclosed. 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 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.

公开(公告)号：US07133977B2

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

申请号：US10461755

申请日：2003-06-13

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

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

IPC分类号： G06F12/16

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.

公开(公告)号：US20060085428A1

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

申请号：US11053386

申请日：2005-02-07

申请人： Patrick Bozeman ,  Scott Colville ,  Mukul Gupta ,  Daniel Lovinger ,  Ravisankar Pudipeddi ,  Ramesh Shankar ,  Supriya Wickrematillake

发明人： Patrick Bozeman ,  Scott Colville ,  Mukul Gupta ,  Daniel Lovinger ,  Ravisankar Pudipeddi ,  Ramesh Shankar ,  Supriya Wickrematillake

IPC分类号： G06F17/30

CPC分类号： G06F17/30091 ,  G06F17/30194 ,  Y10S707/99953

摘要： A system and method for organizing and sorting targets received in a referral response and for realizing a target fail-back and a target priority policy in a distributed file system is provided. In one embodiment, a sorting method includes receiving a referral response in the form of a list of targets that are sorted into bounded sets. Having a sorted referral response in bounded sets provides a basis for implementing a target fail-back and a target priority policy. The computer system may select a target from a sorted list of targets sorted according to site-cost and/or target priority. Then, the computer system may determine if the set target is associated with a more preferred target when compared to all available targets in the sorted list and if not, switch back to a more preferred target.

公开(公告)号：US20050165820A1

公开(公告)日：2005-07-28

申请号：US11083273

申请日：2005-03-16

申请人： Ravisankar Pudipeddi ,  Ran Kalach

发明人： Ravisankar Pudipeddi ,  Ran Kalach

IPC分类号： G06F17/30 ,  G06F17/00

CPC分类号： G06F17/30988 ,  Y10S707/955 ,  Y10S707/956 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99938 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99945 ,  Y10S707/99952

摘要： A technique for recalling data objects stored on media. A queue is created for each medium on which data objects are located, where each request to recall a data object is placed on the queue corresponding to the medium on which the data object is located. A queue is “active” when its corresponding medium is mounted and being used for recall; otherwise the queue is “non-active.” A thread is created for each active queue, where the thread retrieves from a medium the requested items on the active queue. When plural drives are available for mounting and reading media, plural queues may be active concurrently, so that the plural queues' respective threads may recall items from the plural media in parallel. Preferably, the requests on each queue are organized in an order such that the offset locations of the requested items form two monotonically increasing sequences.

公开(公告)号：US06920447B2

公开(公告)日：2005-07-19

申请号：US09783820

申请日：2001-02-15

申请人： Ravisankar Pudipeddi ,  Ran Kalach

发明人： Ravisankar Pudipeddi ,  Ran Kalach

IPC分类号： G06F17/30

CPC分类号： G06F17/30988 ,  Y10S707/955 ,  Y10S707/956 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99938 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99945 ,  Y10S707/99952

摘要： A technique for recalling data objects stored on media. A queue is created for each medium on which data objects are located, where each request to recall a data object is placed on the queue corresponding to the medium on which the data object is located. A queue is “active” when its corresponding medium is mounted and being used for recall; otherwise the queue is “non-active.” A thread is created for each active queue, where the thread retrieves from a medium the requested items on the active queue. When plural drives are available for mounting and reading media, plural queues may be active concurrently, so that the plural queues' respective threads may recall items from the plural media in parallel. Preferably, the requests on each queue are organized in an order such that the offset locations of the requested items form two monotonically increasing sequences.

摘要翻译： 一种用于调用存储在媒体上的数据对象的技术。 为数据对象所在的每个媒体创建一个队列，其中调用数据对象的每个请求被放置在与数据对象所在的媒体对应的队列上。 当其对应的媒体被安装并被用于召回时，队列是“活动的” 否则队列是“非活动的”。 为每个活动队列创建一个线程，线程从媒体中检索活动队列上的请求的项目。 当多个驱动器可用于安装和读取介质时，多个队列可以并发地激活，使得多个队列的各个线程可以并行地从多个媒体中调用项目。 优选地，每个队列上的请求按照使得所请求的项目的偏移位置形成两个单调递增序列的顺序被组织。

公开(公告)号：US07779425B2

公开(公告)日：2010-08-17

申请号：US11344258

申请日：2006-01-30

申请人： Ravisankar Pudipeddi ,  Eileen C. Brown ,  Neal Christiansen ,  Ravinder Thind ,  Brian K. Dewey ,  David P. Golds ,  Mark J. Zbikowski

发明人： Ravisankar Pudipeddi ,  Eileen C. Brown ,  Neal Christiansen ,  Ravinder Thind ,  Brian K. Dewey ,  David P. Golds ,  Mark J. Zbikowski

IPC分类号： G06F3/00 ,  G06F9/44

CPC分类号： G06F9/4411 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99934

摘要： A model in which filter drivers are managed to receive callbacks for I/O requests in which the filter drivers have registered an interest. Per-volume instances of filter drivers register with a filter manager for pre-callbacks (for I/O to the file system) and post-callbacks (for I/O from the file system), and identify which I/O requests (e.g., create, read, write) they are registering to receive callbacks. The filter manager orders the instances for callbacks. When an I/O request is received, the filter manager converts the I/O request to callback data and calls the interested filters in the callback order, whereby the filter instances can process the I/O data. As the request returns from the file system, filters desiring post callbacks are called in the reverse order. Efficient context management for the filters and other functions, such as non-reentrant file I/O, are also provided by the model.

摘要翻译： 管理过滤器驱动程序以接收过滤器驱动程序注册感兴趣的I / O请求的回调的模型。 过滤器驱动程序的每卷实例向过滤器管理器注册预回调（对于文件系统的I / O）和后回调（对于文件系统中的I / O），并识别哪些I / O请求（例如 ，创建，读取，写入）他们正在注册以接收回调。 过滤器管理器命令实例进行回调。 当接收到I / O请求时，过滤器管理器将I / O请求转换为回调数据，并在回调顺序中调用感兴趣的过滤器，从而过滤器实例可以处理I / O数据。 当请求从文件系统返回时，按照相反的顺序调用期望发回回调的过滤器。 该模型还提供了过滤器和其他功能的高效上下文管理，如非可重入文件I / O。

公开(公告)号：US07496609B2

公开(公告)日：2009-02-24

申请号：US11217986

申请日：2005-09-01

申请人： Neal R. Christiansen ,  Ravinder S. Thind ,  Ravisankar Pudipeddi ,  Sarosh Cyrus Havewala

发明人： Neal R. Christiansen ,  Ravinder S. Thind ,  Ravisankar Pudipeddi ,  Sarosh Cyrus Havewala

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

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.

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

公开(公告)号：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.

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