-
11.发明申请METHOD AND SYSTEM FOR PROVIDING DYNAMIC CONTEXT ASSIST FOR A COMMAND LINE INTERFACE 失效用于为命令行界面提供动态语境辅助的方法和系统公开(公告)号：US20090172541A1
公开(公告)日：2009-07-02
申请号：US11968554
申请日：2008-01-02
申请人： Mario F. Acedo , Ezequiel Cervantes , Paula A. Jennas, II , Jason L. Peipelman , Matthew J. Ward
发明人： Mario F. Acedo , Ezequiel Cervantes , Paula A. Jennas, II , Jason L. Peipelman , Matthew J. Ward
IPC分类号： G06F3/048
CPC分类号： G06F3/048 , G06F9/453 , G06F9/45512
摘要： A method, system, and computer program product for providing dynamic context assistance to a user of a system, such as a storage system. One or more current command line interface (CLI) entries that are entered in a CLI of the system are received and a current state of the system is determined. Dynamic context assistance is then generated for one or more current CLI entries based on entered values of the one or more CLI entries. In this regard, the dynamic context assistance can be generated and displayed in a text or graphical form when one or more dynamic context assist keys are entered in the CLI in conjunction with the current CLI entry.
摘要翻译： 一种用于向诸如存储系统的系统的用户提供动态上下文帮助的方法，系统和计算机程序产品。 接收在系统的CLI中输入的一个或多个当前命令行界面（CLI）条目，并确定系统的当前状态。 然后基于一个或多个CLI条目的输入值，为一个或多个当前CLI条目生成动态上下文帮助。 在这方面，当在CLI中结合当前CLI条目输入一个或多个动态上下文辅助键时，可以以文本或图形形式生成并显示动态上下文辅助。
-
公开(公告)号：US20120239893A1
公开(公告)日：2012-09-20
申请号：US13483865
申请日：2012-05-30
IPC分类号： G06F12/16
CPC分类号： G06F17/30215 , G06F11/2064 , G06F2201/84
摘要： A method for dynamic consistency group formation, in one embodiment, includes creating a snapshot of first data stored on a source storage system with respect to data content and data structure, copying the snapshot to a target storage system, detecting one or more write operations affecting data on the source storage system while copying the first data, detecting one or more collisions affecting the first data on the source storage system, wherein a collision occurs whenever the write operations affect the first data prior to the first data being written, setting a consistency group interval which represents an interval duration between successive snapshot create-and-copy events, and altering the consistency group interval to minimize collisions affecting data on at least one of the storage systems. Other methods for dynamic consistency group formation are also described.
摘要翻译： 在一个实施例中，用于动态一致性组形成的方法包括：针对数据内容和数据结构创建存储在源存储系统上的第一数据的快照，将快照复制到目标存储系统，检测影响到的一个或多个写操作 源数据存储系统上的数据，同时复制第一数据，检测影响源存储系统上的第一数据的一个或多个冲突，其中每当写入操作影响第一数据被写入之前的第一数据时，发生冲突， 组间隔，其表示连续快照创建和复制事件之间的间隔持续时间，以及改变一致性组间隔，以最小化影响至少一个存储系统上的数据的冲突。 还描述了用于动态一致性组形成的其他方法。
-
13.发明授权Determining whether to extend a drain time to copy data blocks from a first storage to a second storage 有权确定是否扩展排水时间以将数据块从第一存储复制到第二存储公开(公告)号：US08838920B2
公开(公告)日：2014-09-16
申请号：US12948652
申请日：2010-11-17
申请人： Theodore T. Harris, Jr. , Paul A. Jennas, II , Jason L. Peipelman , Joshua M. Rhoades , Matthew J. Ward
发明人： Theodore T. Harris, Jr. , Paul A. Jennas, II , Jason L. Peipelman , Joshua M. Rhoades , Matthew J. Ward
CPC分类号： G06F3/065 , G06F3/0611 , G06F3/0619 , G06F3/067 , G06F11/2064 , G06F11/2071 , G06F11/3409 , G06F11/3485
摘要： Provided are a computer program product, system, and method for determining whether to extend a drain time to copy data blocks from a first storage to a second storage. A data structure is generated indicating data blocks in the first storage to copy to the second storage. A drain operation is initiated to copy the data blocks indicated in the first storage to the second storage for a drain time period. Write requests to the data blocks indicated in the data structure are queued during the drain time period, wherein the queued write requests are not completed while queued. Metric information based on the writes that occur to data blocks in the first storage are gathered during the drain time period; and in response to expiration of the drain time period, a determination is made from the gathered metric information of whether to continue the drain operation or terminate the drain operation.
摘要翻译： 提供了一种用于确定是否扩展排水时间以将数据块从第一存储复制到第二存储的计算机程序产品，系统和方法。 产生指示第一存储器中的数据块以复制到第二存储器的数据结构。 启动漏极操作以将第一存储器中指示的数据块复制到第二存储器以用于排出时间段。 在数据结构中指示的数据块的写入请求在排出时间期间排队，其中排队的写入请求在排队时未完成。 在排水期间收集基于在第一存储器中的数据块发生的写入的度量信息; 并且响应于排出时间段的到期，从收集的度量信息中确定是继续排水操作还是终止排水操作。
-
公开(公告)号：US08554737B2
公开(公告)日：2013-10-08
申请号：US12892808
申请日：2010-09-28
IPC分类号： G06F17/00
CPC分类号： G06F17/30215 , G06F11/2064 , G06F2201/84
摘要： In one embodiment, a system, includes logic for creating a snapshot of first data stored on a source storage system, wherein the snapshot is a logical copy of the first data stored on the source storage system with respect to data content and data structure; logic for copying the snapshot to a target storage system; logic for copying the first data represented by the snapshot from the source storage system to the target storage system; logic for detecting one or more write operations affecting data on the source storage system; logic for detecting one or more collisions affecting the first data on the source storage system, logic for setting a consistency group interval; and logic for altering the consistency group interval to minimise collisions affecting data on the source storage system. Other systems and computer program products for dynamic consistency group formation are also described.
摘要翻译： 在一个实施例中，系统包括用于创建存储在源存储系统上的第一数据的快照的逻辑，其中快照是相对于数据内容和数据结构存储在源存储系统上的第一数据的逻辑副本; 将快照复制到目标存储系统的逻辑; 用于将由快照表示的第一数据从源存储系统复制到目标存储系统的逻辑; 用于检测影响源存储系统上的数据的一个或多个写入操作的逻辑; 用于检测影响源存储系统上的第一数据的一个或多个冲突的逻辑，用于设置一致性组间隔的逻辑; 以及用于更改一致性组间隔以最小化影响源存储系统上的数据的冲突的逻辑。 还描述了用于动态一致性组形成的其他系统和计算机程序产品。
-
15.发明申请DETERMINING WHETHER TO EXTEND A DRAIN TIME TO COPY DATA BLOCKS FROM A FIRST STORAGE TO A SECOND STORAGE 有权决定是否延长一次排水时间以将数据块从第一次存储复制到第二个存储公开(公告)号：US20120124308A1
公开(公告)日：2012-05-17
申请号：US12948652
申请日：2010-11-17
申请人： Theodore T. Harris, JR. , Paul A. Jennas, II , Jason L. Peipelman , Joshua M. Rhoades , Matthew J. Ward
发明人： Theodore T. Harris, JR. , Paul A. Jennas, II , Jason L. Peipelman , Joshua M. Rhoades , Matthew J. Ward
CPC分类号： G06F3/065 , G06F3/0611 , G06F3/0619 , G06F3/067 , G06F11/2064 , G06F11/2071 , G06F11/3409 , G06F11/3485
摘要： Provided are a computer program product, system, and method for determining whether to extend a drain time to copy data blocks from a first storage to a second storage. A data structure is generated indicating data blocks in the first storage to copy to the second storage. A drain operation is initiated to copy the data blocks indicated in the first storage to the second storage for a drain time period. Write requests to the data blocks indicated in the data structure are queued during the drain time period, wherein the queued write requests are not completed while queued. Metric information based on the writes that occur to data blocks in the first storage are gathered during the drain time period; and in response to expiration of the drain time period, a determination is made from the gathered metric information of whether to continue the drain operation or terminate the drain operation.
摘要翻译： 提供了一种用于确定是否扩展排水时间以将数据块从第一存储复制到第二存储的计算机程序产品，系统和方法。 产生指示第一存储器中的数据块以复制到第二存储器的数据结构。 启动漏极操作以将第一存储器中指示的数据块复制到第二存储器以用于排出时间段。 在数据结构中指示的数据块的写入请求在排出时间期间排队，其中排队的写入请求在排队时未完成。 在排水期间收集基于在第一存储器中的数据块发生的写入的度量信息; 并且响应于排出时间段的到期，从收集的度量信息中确定是继续排水操作还是终止排水操作。
-
16.发明申请METHODS FOR DYNAMIC CONSISTENCY GROUP FORMATION AND SYSTEMS USING THE SAME 失效用于动态一致性组的形成方法和使用该方法的系统公开(公告)号：US20120078848A1
公开(公告)日：2012-03-29
申请号：US12892808
申请日：2010-09-28
IPC分类号： G06F17/30
CPC分类号： G06F17/30215 , G06F11/2064 , G06F2201/84
摘要： A method for dynamic consistency group formation, in one embodiment, includes creating a snapshot of first data stored on a source storage system with respect to data content and data structure, copying the snapshot to a target storage system, detecting one or more write operations affecting data on the source storage system while copying the first data, detecting one or more collisions affecting the first data on the source storage system, wherein a collision occurs whenever the write operations affect the first data prior to the first data being written, setting a consistency group interval which represents an interval duration between successive snapshot create-and-copy events, and altering the consistency group interval to minimize collisions affecting data on at least one of the storage systems. Other methods, systems, and computer program products for dynamic consistency group formation are also described.
摘要翻译： 在一个实施例中，用于动态一致性组形成的方法包括：针对数据内容和数据结构创建存储在源存储系统上的第一数据的快照，将快照复制到目标存储系统，检测影响到的一个或多个写操作 源数据存储系统上的数据，同时复制第一数据，检测影响源存储系统上的第一数据的一个或多个冲突，其中每当写入操作影响第一数据被写入之前的第一数据时，发生冲突， 组间隔，其表示连续快照创建和复制事件之间的间隔持续时间，以及改变一致性组间隔，以最小化影响至少一个存储系统上的数据的冲突。 还描述了用于动态一致性组形成的其他方法，系统和计算机程序产品。
-
17.发明授权Determining whether to extend a drain time to copy data blocks from a first storage to a second storage 有权确定是否扩展排水时间以将数据块从第一存储复制到第二存储公开(公告)号：US08838921B2
公开(公告)日：2014-09-16
申请号：US13474081
申请日：2012-05-17
申请人： Theodore T. Harris, Jr. , Paul A. Jennas, II , Jason L. Peipelman , Joshua M. Rhoades , Matthew J. Ward
发明人： Theodore T. Harris, Jr. , Paul A. Jennas, II , Jason L. Peipelman , Joshua M. Rhoades , Matthew J. Ward
CPC分类号： G06F3/065 , G06F3/0611 , G06F3/0619 , G06F3/067 , G06F11/2064 , G06F11/2071 , G06F11/3409 , G06F11/3485
摘要： Provided are a computer program product, system, and method for determining whether to extend a drain time to copy data blocks from a first storage to a second storage. A data structure indicates data blocks in the first storage to copy to the second storage. A drain operation copies the data blocks indicated in the first storage to the second storage for a drain time period. Write requests to the data blocks indicated in the data structure are queued during the drain time period, wherein the queued write requests are not completed while queued. Metric information based on the writes that occur to data blocks in the first storage are gathered during the drain time period; and in response to expiration of the drain time period, a determination is made from the gathered metric information of whether to continue the drain operation or terminate the drain operation.
摘要翻译： 提供了一种用于确定是否扩展排水时间以将数据块从第一存储复制到第二存储的计算机程序产品，系统和方法。 数据结构指示第一存储器中要复制到第二存储器的数据块。 漏极操作将第一存储器中指示的数据块复制到第二存储器用于排出时间段。 在数据结构中指示的数据块的写入请求在排出时间期间排队，其中排队的写入请求在排队时未完成。 在排水期间收集基于在第一存储器中的数据块发生的写入的度量信息; 并且响应于排出时间段的到期，从收集的度量信息中确定是继续排水操作还是终止排水操作。
-
公开(公告)号：US08683151B2
公开(公告)日：2014-03-25
申请号：US13472919
申请日：2012-05-16
IPC分类号： G06F12/16
CPC分类号： G06F3/0685 , G06F3/0617 , G06F3/065 , G06F11/1446 , G06F2201/84
摘要： In one aspect of the present description, a data preservation function is provided for preserving a set of data on a source storage device at a point in time, and includes identifying as a function of prior update usage, such as input/output usage, of the data to be preserved, a portion of the data which is more likely to be the subject of updates during at least a portion of the data preservation operation as compared to the remaining portion of the data to be preserved, and copies the identified portion of the data to be preserved to a target storage device. In another aspect, the size of the portion of data to be identified is variable. Other features and aspects may be realized, depending upon the particular application.
摘要翻译： 在本说明书的一个方面，提供一种数据保存功能，用于在时间点上保存源存储设备上的一组数据，并且包括根据先前的更新使用（诸如输入/输出使用）的功能来识别 待保存的数据，与保留的数据的剩余部分相比，在数据保存操作的至少一部分期间更有可能成为更新对象的数据的一部分，并将所识别的部分 要保存到目标存储设备的数据。 另一方面，要识别的数据部分的大小是可变的。 可以根据具体应用实现其它特征和方面。
-
19.发明申请DETERMINING WHETHER TO EXTEND A DRAIN TIME TO COPY DATA BLOCKS FROM A FIRST STORAGE TO A SECOND STORAGE 有权决定是否延长一次排水时间以将数据块从第一次存储复制到第二个存储公开(公告)号：US20120254568A1
公开(公告)日：2012-10-04
申请号：US13474081
申请日：2012-05-17
申请人： Theodore T. Harris, JR. , Paul A. Jennas, II , Jason L. Peipelman , Joshua M. Rhoades , Matthew J. Ward
发明人： Theodore T. Harris, JR. , Paul A. Jennas, II , Jason L. Peipelman , Joshua M. Rhoades , Matthew J. Ward
IPC分类号： G06F12/16
CPC分类号： G06F3/065 , G06F3/0611 , G06F3/0619 , G06F3/067 , G06F11/2064 , G06F11/2071 , G06F11/3409 , G06F11/3485
摘要： Provided are a computer program product, system, and method for determining whether to extend a drain time to copy data blocks from a first storage to a second storage. A data structure indicates data blocks in the first storage to copy to the second storage. A drain operation copies the data blocks indicated in the first storage to the second storage for a drain time period. Write requests to the data blocks indicated in the data structure are queued during the drain time period, wherein the queued write requests are not completed while queued. Metric information based on the writes that occur to data blocks in the first storage are gathered during the drain time period; and in response to expiration of the drain time period, a determination is made from the gathered metric information of whether to continue the drain operation or terminate the drain operation.
摘要翻译： 提供了一种用于确定是否扩展排水时间以将数据块从第一存储复制到第二存储的计算机程序产品，系统和方法。 数据结构指示第一存储器中要复制到第二存储器的数据块。 漏极操作将第一存储器中指示的数据块复制到第二存储器用于排出时间段。 在数据结构中指示的数据块的写入请求在排出时间期间排队，其中排队的写入请求在排队时未完成。 在排水期间收集基于在第一存储器中的数据块发生的写入的度量信息; 并且响应于排出时间段的到期，从收集的度量信息中确定是继续排水操作还是终止排水操作。
-
公开(公告)号：US09124423B2
公开(公告)日：2015-09-01
申请号：US12780732
申请日：2010-05-14
CPC分类号： H04L63/0485 , H04L9/065 , H04L9/0827 , H04L9/085 , H04L2209/34
摘要： Provided are a method, system, and article of manufacture for iterative data secret-sharing transformation and reconversion. In one aspect, data secret-sharing transformation and reconversion is provided in which each bit of an input stream of bits of data is split, on a bit by bit basis, into a pair of secret-sharing bits, and the secret-sharing bits of each pair of secret-sharing bits are separated into separate streams of secret-sharing bits. In this manner, one secret-sharing bit of each pair of secret-sharing bits may be placed in one stream of secret-sharing bits and the other secret-sharing bit of each pair may be placed in another stream of secret-sharing bits different from the one stream of secret-sharing bits. Confidentiality of the original input stream may be protected in the event one but not both streams of secret-sharing bits is obtained by unauthorized personnel. In another aspect, for an input stream of N bits, each received bit of the N bits of the input stream of data, may be interatively split, on a bit by bit basis, into a pair of secret-sharing bits, to generate as few as N+1 secret-sharing bits from the input stream of bits N bits. Other features and aspects may be realized, depending upon the particular application.
摘要翻译： 提供了一种用于迭代数据秘密共享转换和重新转换的方法，系统和制造。 在一个方面，提供了数据秘密共享转换和重新转换，其中将数据位的输入流的每个位逐位分割成一对秘密共享位，并且秘密共享位 每对秘密共享比特被分成独立的秘密共享比特流。 以这种方式，每对秘密共享比特的一个秘密共享比特可以被放置在一个秘密共享比特流中，并且每对的另一个秘密共享比特可以被放置在另一个不同的秘密共享比特流中 从一个秘密共享位流。 在未经授权的人员获得秘密共享位的情况下，原始输入流的保密性可能受到保护。 在另一方面，对于N位的输入流，输入数据流的N位的每个接收位可以逐位地分开成一对秘密共享位，以生成为 很少作为N位1个秘密共享位从输入流的位N位。 可以根据具体应用实现其它特征和方面。
-
-
-
-
-
-
-
-
-
搜索结果
48 条记录 (耗时 0.026 秒)
