公开(公告)号：US20130110787A1

公开(公告)日：2013-05-02

申请号：US13283540

申请日：2011-10-27

申请人： Neeta Garimella ,  Bernhard J. Klingenberg ,  Ryan J. Minniear ,  Mark A. Smith

发明人： Neeta Garimella ,  Bernhard J. Klingenberg ,  Ryan J. Minniear ,  Mark A. Smith

IPC分类号： G06F17/30

CPC分类号： G06F17/30235 ,  G06F17/30073

摘要： Embodiments of the invention relate to a virtual file system for communicating changes in metadata associated with data archived in a data storage system to applications. An aspect of the invention concerns a system that comprises a virtual file system for storing metadata files wherein each metadata file is associated with an archived data file, and a virtual file system interface coupled to the virtual file system for exposing changes in the metadata files to the applications.

摘要翻译： 本发明的实施例涉及一种虚拟文件系统，用于将与存储在数据存储系统中的数据相关联的元数据的改变传送给应用。 本发明的一个方面涉及一种系统，其包括用于存储元数据文件的虚拟文件系统，其中每个元数据文件与存档的数据文件相关联，以及耦合到虚拟文件系统的虚拟文件系统接口，用于将元数据文件中的更改暴露于 应用程序。

公开(公告)号：US09514154B2

公开(公告)日：2016-12-06

申请号：US13283540

申请日：2011-10-27

申请人： Neeta Garimella ,  Bernhard J. Klingenberg ,  Ryan J. Minniear ,  Mark A. Smith

发明人： Neeta Garimella ,  Bernhard J. Klingenberg ,  Ryan J. Minniear ,  Mark A. Smith

IPC分类号： G06F17/30

CPC分类号： G06F17/30235 ,  G06F17/30073

摘要： Embodiments of the invention relate to a virtual file system for communicating changes in metadata associated with data archived in a data storage system to applications. An aspect of the invention concerns a system that comprises a virtual file system for storing metadata files wherein each metadata file is associated with an archived data file, and a virtual file system interface coupled to the virtual file system for exposing changes in the metadata files to the applications.

摘要翻译： 本发明的实施例涉及一种虚拟文件系统，用于将与存储在数据存储系统中的数据相关联的元数据的改变传送给应用。 本发明的一个方面涉及一种系统，其包括用于存储元数据文件的虚拟文件系统，其中每个元数据文件与存档的数据文件相关联，以及耦合到虚拟文件系统的虚拟文件系统接口，用于将元数据文件中的更改暴露于 应用程序。

公开(公告)号：US20110083163A1

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

申请号：US12574562

申请日：2009-10-06

申请人： John J. Auvenshine ,  Bernhard J. Klingenberg ,  Neeta Garimella ,  Thomas K. Clark

发明人： John J. Auvenshine ,  Bernhard J. Klingenberg ,  Neeta Garimella ,  Thomas K. Clark

IPC分类号： G06F9/445 ,  G06F17/00

CPC分类号： H04L63/0884 ,  G06F8/65 ,  G06F21/30 ,  G06F21/31 ,  G06F21/57 ,  G06F21/60 ,  G06F21/62 ,  G06F21/6218 ,  G06F2221/2141 ,  G06F2221/2145 ,  G06F2221/2149 ,  H04L63/083 ,  H04L63/10

摘要： A root user identifier of a computing system is disabled. Thereafter, and in response to determining that a problem with the computing system requires root privileges to the computing system to solve, a code patch for installation on the computing system is received from a third party. The code patch is installed on the computing system, resulting in a user identifier temporarily having the root privileges to the computing system. The user identifier is different than the root user identifier is. A password for the user identifier is provided to the third party to permit the third party to solve the problem with the computing system using the root privileges, via the user identifier temporarily having the root privileges to the computing system. The code patch is computer code installable on the computing system.

摘要翻译： 计算系统的根用户标识符被禁用。 此后，响应于确定计算系统的问题需要计算系统的root权限来解决，则从第三方接收用于在计算系统上安装的代码补丁。 代码补丁安装在计算系统上，导致用户标识符暂时具有计算系统的root权限。 用户标识符与根用户标识符不同。 将用户标识符的密码提供给第三方，以允许第三方通过临时具有计算系统的根特权的用户标识符，使用根特权解决计算系统的问题。 代码补丁是可以在计算系统上安装的计算机代码。

公开(公告)号：US09043877B2

公开(公告)日：2015-05-26

申请号：US12574562

申请日：2009-10-06

申请人： John J. Auvenshine ,  Bernhard J. Klingenberg ,  Neeta Garimella ,  Thomas K. Clark

发明人： John J. Auvenshine ,  Bernhard J. Klingenberg ,  Neeta Garimella ,  Thomas K. Clark

IPC分类号： G06F12/14 ,  G06F21/62 ,  G06F21/57

CPC分类号： H04L63/0884 ,  G06F8/65 ,  G06F21/30 ,  G06F21/31 ,  G06F21/57 ,  G06F21/60 ,  G06F21/62 ,  G06F21/6218 ,  G06F2221/2141 ,  G06F2221/2145 ,  G06F2221/2149 ,  H04L63/083 ,  H04L63/10

摘要： A root user identifier of a computing system is disabled. Thereafter, and in response to determining that a problem with the computing system requires root privileges to the computing system to solve, a code patch for installation on the computing system is received from a third party. The code patch is installed on the computing system, resulting in a user identifier temporarily having the root privileges to the computing system. The user identifier is different than the root user identifier is. A password for the user identifier is provided to the third party to permit the third party to solve the problem with the computing system using the root privileges, via the user identifier temporarily having the root privileges to the computing system. The code patch is computer code installable on the computing system.

摘要翻译： 计算系统的根用户标识符被禁用。 此后，响应于确定计算系统的问题需要计算系统的root权限来解决，则从第三方接收用于在计算系统上安装的代码补丁。 代码补丁安装在计算系统上，导致用户标识符暂时具有计算系统的root权限。 用户标识符与根用户标识符不同。 将用户标识符的密码提供给第三方，以允许第三方通过临时具有计算系统的根特权的用户标识符来解决计算系统使用根特权的问题。 代码补丁是可以在计算系统上安装的计算机代码。

公开(公告)号：US08316375B2

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

申请号：US12694146

申请日：2010-01-26

申请人： Bernhard J. Klingenberg ,  Mark A. Smith

发明人： Bernhard J. Klingenberg ,  Mark A. Smith

IPC分类号： G06F9/46 ,  G06F15/173

CPC分类号： G06F9/5088

摘要： A process is selected for movement from a current node to a new node, based on an inertia of the process. The inertia is a quantified measure of the impact resulting from the process being inaccessible while being moved. The inertia can take into account the number of current external connections to the process; the larger the number of current external connections is, the greater the inertia. The inertia can take into account the extent to which the process accepts external connections; the greater the extent to which the process accepts external connections is, the greater the inertia. The inertia can take into account the desired availability of the process; the greater the desired availability is, the greater the inertia. The inertia can take into account a specified quality of service of the process; the higher the specified quality of service is, the greater the inertia.

摘要翻译： 基于过程的惯性，选择用于从当前节点移动到新节点的过程。 惯性是衡量过程在移动过程中无法访问的影响的量化度量。 惯性可以考虑当前与该过程的外部连接的数量; 当前外部连接数越多，惯性越大。 惯性可以考虑过程接受外部连接的程度; 过程接受外部连接的程度越大，惯性越大。 惯性可以考虑到所需过程的可用性; 所需的可用性越大，惯性越大。 惯性可以考虑到过程的指定服务质量; 指定服务质量越高，惯性越大。

公开(公告)号：US20110185366A1

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

申请号：US12694146

申请日：2010-01-26

申请人： Bernhard J. Klingenberg ,  Mark A. Smith

发明人： Bernhard J. Klingenberg ,  Mark A. Smith

IPC分类号： G06F9/46 ,  G06F15/173

CPC分类号： G06F9/5088

摘要： A process is selected for movement from a current node to a new node, based on an inertia of the process. The inertia is a quantified measure of the impact resulting from the process being inaccessible while being moved. The inertia can take into account the number of current external connections to the process; the larger the number of current external connections is, the greater the inertia. The inertia can take into account the extent to which the process accepts external connections; the greater the extent to which the process accepts external connections is, the greater the inertia. The inertia can take into account the desired availability of the process; the greater the desired availability is, the greater the inertia. The inertia can take into account a specified quality of service of the process; the higher the specified quality of service is, the greater the inertia.

摘要翻译： 基于过程的惯性，选择用于从当前节点移动到新节点的过程。 惯性是衡量过程在移动过程中无法访问的影响的量化度量。 惯性可以考虑当前与该过程的外部连接的数量; 当前外部连接数越多，惯性越大。 惯性可以考虑过程接受外部连接的程度; 过程接受外部连接的程度越大，惯性越大。 惯性可以考虑到所需过程的可用性; 所需的可用性越大，惯性越大。 惯性可以考虑到过程的指定服务质量; 指定的服务质量越高，惯性越大。

公开(公告)号：US08037404B2

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

申请号：US12434658

申请日：2009-05-03

申请人： Bernhard J. Klingenberg ,  Steven J. Davis ,  David G. Van Hise ,  James E. Gruener ,  Alisa Neeman ,  Emil R. Nunez ,  Nathan L. Williams

发明人： Bernhard J. Klingenberg ,  Steven J. Davis ,  David G. Van Hise ,  James E. Gruener ,  Alisa Neeman ,  Emil R. Nunez ,  Nathan L. Williams

IPC分类号： G06F17/00

CPC分类号： G06F17/2247

摘要： A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships. Redundant attributes among the relationships can thus be detected.

公开(公告)号：US20100281356A1

公开(公告)日：2010-11-04

申请号：US12434658

申请日：2009-05-03

申请人： Bernhard J. Klingenberg ,  Steven J. Davis ,  David G. Van Hise ,  James E. Gruener ,  Alisa Neeman ,  Emil R. Nunez ,  Nathan L. Williams

发明人： Bernhard J. Klingenberg ,  Steven J. Davis ,  David G. Van Hise ,  James E. Gruener ,  Alisa Neeman ,  Emil R. Nunez ,  Nathan L. Williams

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

CPC分类号： G06F17/2247

摘要： A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships. Redundant attributes among the relationships can thus be detected.

摘要翻译： 构建和分析表示计算架构的计算元件的标记语言文档，诸如数据存储架构的数据存储元件。 表示由第二计算元件包含的第一计算元件; 对应于第一计算元件的文档的第一标签被嵌套在对应于第二计算元件的标记语言文档的第二标签内。 还表示从第一计算元件到第三计算元件的不包含/包含的关系; 对应于数据访问路径的文档的指针标签嵌套在第一标签内，并引用对应于第三计算元件的文档的第三标签。 调用用于标记语言的Get-pointer-node和get-child-node应用程序编程接口，以便在包含/包含的关系中遍历。 跟踪指针标记以在不包含/包含的关系中遍历。 因此可以检测关系中的冗余属性。

公开(公告)号：US08271458B2

公开(公告)日：2012-09-18

申请号：US13226347

申请日：2011-09-06

申请人： Bernhard J. Klingenberg ,  Steven J. Davis ,  David G. Van Hise ,  James E. Gruener ,  Alisa Neeman ,  Emil R. Nunez ,  Nathan L. Williams

发明人： Bernhard J. Klingenberg ,  Steven J. Davis ,  David G. Van Hise ,  James E. Gruener ,  Alisa Neeman ,  Emil R. Nunez ,  Nathan L. Williams

IPC分类号： G06F17/30

CPC分类号： G06F17/2247

摘要： A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships. Redundant attributes among the relationships can thus be detected.

摘要翻译： 构建和分析表示计算架构的计算元件的标记语言文档，诸如数据存储架构的数据存储元件。 表示由第二计算元件包含的第一计算元件; 对应于第一计算元件的文档的第一标签被嵌套在对应于第二计算元件的标记语言文档的第二标签内。 还表示从第一计算元件到第三计算元件的不包含/包含的关系; 对应于数据访问路径的文档的指针标签嵌套在第一标签内，并引用对应于第三计算元件的文档的第三标签。 调用用于标记语言的Get-pointer-node和get-child-node应用程序编程接口，以便在包含/包含的关系中遍历。 跟踪指针标记以在不包含/包含的关系中遍历。 因此可以检测关系中的冗余属性。

公开(公告)号：US20110320929A1

公开(公告)日：2011-12-29

申请号：US13226347

申请日：2011-09-06

申请人： Bernhard J. Klingenberg ,  Steven J. Davis ,  David G. Van Hise ,  James E. Gruener ,  Alisa Neeman ,  Emil R. Nunez ,  Nathan L. Williams

发明人： Bernhard J. Klingenberg ,  Steven J. Davis ,  David G. Van Hise ,  James E. Gruener ,  Alisa Neeman ,  Emil R. Nunez ,  Nathan L. Williams

IPC分类号： G06F17/00

CPC分类号： G06F17/2247

摘要： A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships. Redundant attributes among the relationships can thus be detected.

摘要翻译： 构建和分析表示计算架构的计算元件的标记语言文档，诸如数据存储架构的数据存储元件。 表示由第二计算元件包含的第一计算元件; 对应于第一计算元件的文档的第一标签被嵌套在对应于第二计算元件的标记语言文档的第二标签内。 还表示从第一计算元件到第三计算元件的不包含/包含的关系; 对应于数据访问路径的文档的指针标签嵌套在第一标签内，并引用对应于第三计算元件的文档的第三标签。 调用用于标记语言的Get-pointer-node和get-child-node应用程序编程接口，以便在包含/包含的关系中遍历。 跟踪指针标记以在不包含/包含的关系中遍历。 因此可以检测关系中的冗余属性。