-
公开(公告)号：US20110258306A1
公开(公告)日：2011-10-20
申请号：US13168952
申请日：2011-06-25
申请人： Sudhir G. Rao , Myung M. Bae , Thomas K. Clark , Douglas Griffith , Roger L. Haskin , Shah Mohammad Rezaul Islam , Felipe Knop , Soumitra Sarkar , Frank B. Schmuck , Theodore B. Vojnovich , Yi Zhou , Robert Curran
发明人： Sudhir G. Rao , Myung M. Bae , Thomas K. Clark , Douglas Griffith , Roger L. Haskin , Shah Mohammad Rezaul Islam , Felipe Knop , Soumitra Sarkar , Frank B. Schmuck , Theodore B. Vojnovich , Yi Zhou , Robert Curran
IPC分类号： G06F15/173
CPC分类号： H04L67/1097 , G06F9/5061 , G06F11/1425 , G06F2209/505
摘要： The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.
摘要翻译： 公开了在分割的簇的节点之间获取锁。 一种方法可由集群的至少一个节点中的每个节点执行。 节点等待与其标识符相对应的延迟。 节点断言通过将其标识符写入另一个节点未能获取锁的X和Y变量来获取锁定。 节点等待另一个节点获取其他节点已经写入X的锁，并且在Y保持等于其自己的标识符的情况下继续进行。 该节点等待另一个节点获取其他节点已写入Z变量的锁，并将其自己的标识符写入Z，并在另一个节点发生故障的情况下进行。 节点将一个值写入Y表示它正在获取锁定，并通过周期性写入Z维持获取。
-
公开(公告)号：US07991753B2
公开(公告)日：2011-08-02
申请号：US10851812
申请日：2004-05-21
申请人： Sudhir G. Rao , Myung M. Bae , Thomas K. Clark , Douglas Griffith , Roger L. Haskin , Shah Mohammad Rezaul Islam , Felipe Knop , Soumitra Sarkar , Frank B. Schmuck , Theodore B. Vojnovich , Yi Zhou , Robert Curran
发明人： Sudhir G. Rao , Myung M. Bae , Thomas K. Clark , Douglas Griffith , Roger L. Haskin , Shah Mohammad Rezaul Islam , Felipe Knop , Soumitra Sarkar , Frank B. Schmuck , Theodore B. Vojnovich , Yi Zhou , Robert Curran
IPC分类号： G06F7/00
CPC分类号： H04L67/1097 , G06F9/5061 , G06F11/1425 , G06F2209/505
摘要： The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.
摘要翻译： 公开了在分割的簇的节点之间获取锁。 一种方法可由集群的至少一个节点中的每个节点执行。 节点等待与其标识符相对应的延迟。 节点断言通过将其标识符写入另一个节点未能获取锁的X和Y变量来获取锁定。 节点等待另一个节点获取其他节点已经写入X的锁，并且在Y保持等于其自己的标识符的情况下继续进行。 该节点等待另一个节点获取其他节点已写入Z变量的锁，并将其自己的标识符写入Z，并在另一节点发生故障的情况下继续进行。 节点将一个值写入Y表示它正在获取锁定，并通过周期性写入Z维持获取。
-
公开(公告)号：US20050262143A1
公开(公告)日：2005-11-24
申请号：US10851812
申请日：2004-05-21
申请人： Sudhir Rao , Myung Bae , Thomas Clark , Douglas Griffith , Roger Haskin , Shah Rezaul Islam , Felipe Knop , Soumitra Sarkar , Frank Schmuck , Theodore Vojnovich , Yi Zhou , Robert Curran
发明人： Sudhir Rao , Myung Bae , Thomas Clark , Douglas Griffith , Roger Haskin , Shah Rezaul Islam , Felipe Knop , Soumitra Sarkar , Frank Schmuck , Theodore Vojnovich , Yi Zhou , Robert Curran
CPC分类号： H04L67/1097 , G06F9/5061 , G06F11/1425 , G06F2209/505
摘要： The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.
摘要翻译： 公开了在分割的簇的节点之间获取锁。 一种方法可由集群的至少一个节点中的每个节点执行。 节点等待与其标识符相对应的延迟。 节点断言通过将其标识符写入另一个节点未能获取锁的X和Y变量来获取锁定。 节点等待另一个节点获取其他节点已经写入X的锁，并且在Y保持等于其自己的标识符的情况下继续进行。 该节点等待另一个节点获取其他节点已写入Z变量的锁，并将其自己的标识符写入Z，并在另一个节点发生故障的情况下进行。 节点将一个值写入Y表示它正在获取锁定，并通过周期性写入Z维持获取。
-
公开(公告)号：US20110153825A1
公开(公告)日：2011-06-23
申请号：US12640268
申请日：2009-12-17
IPC分类号： G06F15/173
CPC分类号： G06F9/5038 , G06F2209/5021
摘要： A method, programmed medium and system are disclosed which provide for end-to-end QoS for a set of processes that comprise a workload over nfs. A set of processes that comprise a workload such as the processes of a WPAR, or an entire LPAR are given a class designation and assigned priority/limits. The data are then passed to the server which allocates resources based on the sum total of all the current classes and their priorities and/or limits. This requires re-engineering the nfs client code to be workload-aware and the nfs server code to accommodate the resource allocation and prioritization needs of the nfs clients.
摘要翻译： 公开了一种方法，编程介质和系统，其为包括nfs上的工作负载的一组进程提供端到端QoS。 给出了一组包含WPAR或整个LPAR的工作负载的进程，并给出了类别指定和分配的优先级/限制。 然后将数据传递给服务器，该服务器根据所有当前类及其优先级和/或限制的总和来分配资源。 这需要重新设计nfs客户端代码以使工作负载感知和nfs服务器代码适应nfs客户端的资源分配和优先级排序。
-
公开(公告)号：US08356099B2
公开(公告)日：2013-01-15
申请号：US13459193
申请日：2012-04-29
IPC分类号： G06F15/16
CPC分类号： G06F9/5038 , G06F2209/5021
摘要： A method, programmed medium and system are disclosed which provide for end-to-end QoS for a set of processes that comprise a workload over nfs. A set of processes that comprise a workload such as the processes of a WPAR, or an entire LPAR are given a class designation and assigned priority/limits. The data are then passed to the server which allocates resources based on the sum total of all the current classes and their priorities and/or limits. This requires re-engineering the nfs client code to be workload-aware and the nfs server code to accommodate the resource allocation and prioritization needs of the nfs clients.
摘要翻译： 公开了一种方法，编程介质和系统，其为包括nfs上的工作负载的一组进程提供端到端QoS。 给出了一组包含WPAR或整个LPAR的工作负载的进程，并给出了类别指定和分配的优先级/限制。 然后将数据传递给服务器，该服务器根据所有当前类及其优先级和/或限制的总和来分配资源。 这需要重新设计nfs客户端代码以使工作负载感知和nfs服务器代码适应nfs客户端的资源分配和优先级排序。
-
公开(公告)号：US08990541B2
公开(公告)日：2015-03-24
申请号：US13611204
申请日：2012-09-12
IPC分类号： G06F12/10
CPC分类号： G06F12/1009 , G06F12/023 , G06F12/08 , G06F2212/1044 , G06F2212/657
摘要： A method, system, and computer program product for improving memory utilization of sparse pages are provided in the illustrative embodiments. A set of virtual pages is identified. Each virtual page in the set of virtual pages is a sparse virtual page. The set of virtual pages includes a first sparse virtual page and a second sparse virtual page. At least a portion of data of the first sparse virtual page in the set of virtual pages is stored in a first physical page. The first physical page belongs to a set of consolidation physical pages, and the first physical page also stores at least a portion of the data of the second sparse virtual page. The first and the second sparse pages are mapped to the first physical page.
摘要翻译： 在说明性实施例中提供了用于改善稀疏页面的存储器利用的方法，系统和计算机程序产品。 识别一组虚拟页面。 虚拟页面集中的每个虚拟页面都是稀疏的虚拟页面。 该虚拟页面集合包括第一稀疏虚拟页面和第二稀疏虚拟页面。 虚拟页面集合中的第一稀疏虚拟页面的至少一部分数据被存储在第一物理页面中。 第一物理页面属于一组合并物理页面，并且第一物理页面还存储第二稀疏虚拟页面的数据的至少一部分。 第一个和第二个稀疏页面被映射到第一个物理页面。
-
公开(公告)号：US08321569B2
公开(公告)日：2012-11-27
申请号：US12640268
申请日：2009-12-17
IPC分类号： G06F15/173
CPC分类号： G06F9/5038 , G06F2209/5021
摘要： A method, programmed medium and system are disclosed which provide for end-to-end QoS for a set of processes that comprise a workload over nfs. A set of processes that comprise a workload such as the processes of a WPAR, or an entire LPAR are given a class designation and assigned priority/limits. The data are then passed to the server which allocates resources based on the sum total of all the current classes and their priorities and/or limits. This requires re-engineering the nfs client code to be workload-aware and the nfs server code to accommodate the resource allocation and prioritization needs of the nfs clients.
摘要翻译： 公开了一种方法，编程介质和系统，其为包括nfs上的工作负载的一组进程提供端到端QoS。 给出了一组包含WPAR或整个LPAR的工作负载的进程，并给出了类别指定和分配的优先级/限制。 然后将数据传递给服务器，该服务器根据所有当前类及其优先级和/或限制的总和来分配资源。 这需要重新设计nfs客户端代码以使工作负载感知和nfs服务器代码适应nfs客户端的资源分配和优先级排序。
-
公开(公告)号：US20120215922A1
公开(公告)日：2012-08-23
申请号：US13459193
申请日：2012-04-29
IPC分类号： G06F15/173 , G06F17/30
CPC分类号： G06F9/5038 , G06F2209/5021
摘要： A method, programmed medium and system are disclosed which provide for end-to-end QoS for a set of processes that comprise a workload over nfs. A set of processes that comprise a workload such as the processes of a WPAR, or an entire LPAR are given a class designation and assigned priority/limits. The data are then passed to the server which allocates resources based on the sum total of all the current classes and their priorities and/or limits. This requires re-engineering the nfs client code to be workload-aware and the nfs server code to accommodate the resource allocation and prioritization needs of the nfs clients.
摘要翻译： 公开了一种方法，编程介质和系统，其为包括nfs上的工作负载的一组进程提供端到端QoS。 给出了一组包含WPAR或整个LPAR的工作负载的进程，并给出了类别指定和分配的优先级/限制。 然后将数据传递给服务器，该服务器根据所有当前类及其优先级和/或限制的总和来分配资源。 这需要重新设计nfs客户端代码以使工作负载感知和nfs服务器代码适应nfs客户端的资源分配和优先级排序。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.045 秒)
