-
公开(公告)号：US20130067188A1
公开(公告)日：2013-03-14
申请号：US13230827
申请日：2011-09-12
申请人： Karan Mehra , Rajeev Nagar , Shiv Rajpal , Darren Moss , Andrea D'Amato , Alan Warwick , Vyacheslav Kuznetsov
发明人： Karan Mehra , Rajeev Nagar , Shiv Rajpal , Darren Moss , Andrea D'Amato , Alan Warwick , Vyacheslav Kuznetsov
IPC分类号： G06F12/00
CPC分类号： G06F3/0605 , G06F3/0632 , G06F3/0689 , G06F9/4411
摘要： The representation of storage devices on computers (e.g., as logical volumes) may be complicated by the pooling of multiple storage devices in order to apply redundancy plans such as mirroring and checksumming. Presented herein is a storage device driver configured to operate as a storage device interface generating representations of the storage regions of the storage devices; to claim those regions as a storage controller; and to expose pooled storage regions as logical disks. Additionally, the storage device driver may support the inclusion of storage devices in a cluster, comprising nodes that may be appointed as managers of the storage pool configuration; as managers of the storage devices; as owners having exclusive read/write access to the storage pool or cluster resources; and as cluster resource writers having excusive write access to a cluster resource. The nodes of the cluster may interoperate to share the storage devices while avoiding write conflicts.
摘要翻译： 存储设备在计算机上的表示（例如，作为逻辑卷）可能通过汇集多个存储设备而变得复杂，以便应用诸如镜像和校验和之类的冗余计划。 这里呈现的是存储设备驱动器，其被配置为作为产生存储设备的存储区域的表示的存储设备接口来操作; 要求这些地区作为存储控制器; 并将池化的存储区域公开为逻辑磁盘。 此外，存储设备驱动程序可以支持在群集中包括存储设备，包括可被指定为存储池配置的管理者的节点; 作为存储设备的管理者; 作为具有对存储池或集群资源的独占读/写访问权限的所有者; 以及作为群集资源编写者具有对集群资源的可读写入访问权限。 集群的节点可以互操作以共享存储设备，同时避免写入冲突。
-
公开(公告)号：US08886910B2
公开(公告)日：2014-11-11
申请号：US13230827
申请日：2011-09-12
申请人： Karan Mehra , Rajeev Nagar , Shiv Rajpal , Darren Moss , Andrea D'Amato , Alan Warwick , Vyacheslav Kuznetsov
发明人： Karan Mehra , Rajeev Nagar , Shiv Rajpal , Darren Moss , Andrea D'Amato , Alan Warwick , Vyacheslav Kuznetsov
CPC分类号： G06F3/0605 , G06F3/0632 , G06F3/0689 , G06F9/4411
摘要： The representation of storage devices on computers (e.g., as logical volumes) may be complicated by the pooling of multiple storage devices in order to apply redundancy plans such as mirroring and checksumming. Presented herein is a storage device driver configured to operate as a storage device interface generating representations of the storage regions of the storage devices; to claim those regions as a storage controller; and to expose pooled storage regions as logical disks. Additionally, the storage device driver may support the inclusion of storage devices in a cluster, comprising nodes that may be appointed as managers of the storage pool configuration; as managers of the storage devices; as owners having exclusive read/write access to the storage pool or cluster resources; and as cluster resource writers having exclusive write access to a cluster resource. The nodes of the cluster may interoperate to share the storage devices while avoiding write conflicts.
摘要翻译： 存储设备在计算机上的表示（例如，作为逻辑卷）可能通过汇集多个存储设备而变得复杂，以便应用诸如镜像和校验和之类的冗余计划。 这里呈现的是存储设备驱动器，其被配置为作为产生存储设备的存储区域的表示的存储设备接口来操作; 要求这些地区作为存储控制器; 并将合并的存储区域公开为逻辑磁盘。 此外，存储设备驱动程序可以支持在群集中包括存储设备，包括可被指定为存储池配置的管理者的节点; 作为存储设备的管理者; 作为具有对存储池或集群资源的独占读/写访问权限的所有者; 以及具有对集群资源的独占写访问权限的集群资源编写者。 集群的节点可以互操作以共享存储设备，同时避免写入冲突。
-
公开(公告)号：US20130067174A1
公开(公告)日：2013-03-14
申请号：US13229736
申请日：2011-09-11
申请人： Darren Moss , Karan Mehra , Rajeev Nagar , Surendra Verma , Shiv Rajpal
发明人： Darren Moss , Karan Mehra , Rajeev Nagar , Surendra Verma , Shiv Rajpal
IPC分类号： G06F12/00
CPC分类号： G06F11/1076 , G06F3/0613 , G06F3/0646 , G06F11/1471
摘要： The storage of data sets in a storage set (e.g., data sets written to hard disk drives comprising a RAID array) may diminish the performance of the storage set through non-sequential writes, particularly if the storage devices promptly write data sets that are followed by sequentially following data sets. Additionally, storage sets may exhibit inconsistencies due to non-atomic writes of data sets and verifiers (e.g., checksums) and an intervening failure, such as an occurrence of the RAID write hole. Instead, data sets and verifiers may first be written to a stored on the nonvolatile media of a storage device before being committed to the storage set. Such writes may be sequentially written to the journal, irrespective of the locations of the data sets in the storage set; and recovery of a failure may simply involve re-committing the consistent records in the journal to correct incomplete writes to the storage set.
摘要翻译： 将数据集存储在存储集中（例如，写入包含RAID阵列的硬盘驱动器的数据集）可能会通过非顺序写入来降低存储集的性能，特别是如果存储设备及时写入遵循的数据集 通过顺序跟随数据集。 此外，由于数据集和验证器（例如，校验和）的非原子写入以及诸如RAID写入孔的发生的中间故障，存储器组可能表现出不一致。 相反，在提交到存储集之前，数据集和验证器可以首先被写入到存储设备的非易失性介质上。 这样的写入可以顺序地写入日志，而不管存储集中的数据集的位置如何; 并且恢复故障可能只是简单地涉及在日志中重新提交一致的记录来纠正对存储集的不完整写入。
-
公开(公告)号：US09229809B2
公开(公告)日：2016-01-05
申请号：US13229736
申请日：2011-09-11
申请人： Darren Moss , Karan Mehra , Rajeev Nagar , Surendra Verma , Shiv Rajpal
发明人： Darren Moss , Karan Mehra , Rajeev Nagar , Surendra Verma , Shiv Rajpal
CPC分类号： G06F11/1076 , G06F3/0613 , G06F3/0646 , G06F11/1471
摘要： The storage of data sets in a storage set (e.g., data sets written to hard disk drives comprising a RAID array) may diminish the performance of the storage set through non-sequential writes, particularly if the storage devices promptly write data sets that are followed by sequentially following data sets. Additionally, storage sets may exhibit inconsistencies due to non-atomic writes of data sets and verifiers (e.g., checksums) and an intervening failure, such as an occurrence of the RAID write hole. Instead, data sets and verifiers may first be written to a stored on the nonvolatile media of a storage device before being committed to the storage set. Such writes may be sequentially written to the journal, irrespective of the locations of the data sets in the storage set; and recovery of a failure may simply involve re-committing the consistent records in the journal to correct incomplete writes to the storage set.
摘要翻译： 将数据集存储在存储集中（例如，写入包含RAID阵列的硬盘驱动器的数据集）可能会通过非顺序写入来降低存储集的性能，特别是如果存储设备及时写入遵循的数据集 通过顺序跟随数据集。 此外，由于数据集和验证器（例如，校验和）的非原子写入以及诸如RAID写入孔的发生的中间故障，存储器组可能表现出不一致。 相反，在提交到存储集之前，数据集和验证器可以首先被写入到存储设备的非易失性介质上。 这样的写入可以顺序地写入日志，而不管存储集中的数据集的位置如何; 并且恢复故障可能只是简单地涉及在日志中重新提交一致的记录来纠正对存储集的不完整写入。
-
公开(公告)号：US20120110281A1
公开(公告)日：2012-05-03
申请号：US12938383
申请日：2010-11-03
IPC分类号： G06F12/00
CPC分类号： G06F3/062 , G06F3/0643 , G06F3/0664 , G06F3/067 , G06F9/45558 , G06F12/0866 , G06F21/62 , G06F2009/45579
摘要： Aspects of the subject matter described herein relate to virtualization and offload reads and writes. In aspects, an offload read allows a requestor to obtain a token that represents data while an offload write allows the requestor to request that the data (or a part thereof) represented by a token be logically written. Offload reads and writes may be used to perform various actions for virtual environments.
摘要翻译： 本文描述的主题的方面涉及虚拟化和卸载读取和写入。 在一方面，卸载读取允许请求者获得表示数据的令牌，而卸载写允许请求者请求由令牌表示的数据（或其一部分）被逻辑地写入。 卸载读取和写入可用于对虚拟环境执行各种操作。
-
公开(公告)号：US09092149B2
公开(公告)日：2015-07-28
申请号：US12938383
申请日：2010-11-03
CPC分类号： G06F3/062 , G06F3/0643 , G06F3/0664 , G06F3/067 , G06F9/45558 , G06F12/0866 , G06F21/62 , G06F2009/45579
摘要： Aspects of the subject matter described herein relate to virtualization and offload reads and writes. In aspects, an offload read allows a requestor to obtain a token that represents data while an offload write allows the requestor to request that the data (or a part thereof) represented by a token be logically written. Offload reads and writes may be used to perform various actions for virtual environments.
摘要翻译： 本文描述的主题的方面涉及虚拟化和卸载读取和写入。 在一方面，卸载读取允许请求者获得表示数据的令牌，而卸载写允许请求者请求由令牌表示的数据（或其一部分）被逻辑地写入。 卸载读取和写入可用于对虚拟环境执行各种操作。
-
公开(公告)号：US20120079583A1
公开(公告)日：2012-03-29
申请号：US12888433
申请日：2010-09-23
申请人： Neal R. Christiansen , Rajeev Nagar , Dustin L. Green , Vladimir Sadovsky , Malcolm James Smith , Karan Mehra
发明人： Neal R. Christiansen , Rajeev Nagar , Dustin L. Green , Vladimir Sadovsky , Malcolm James Smith , Karan Mehra
IPC分类号： H04L9/32
CPC分类号： G06F3/0683 , G06F3/061 , G06F3/0617 , G06F3/065
摘要： Aspects of the subject matter described herein relate to offload reads and writes. In aspects, a requestor that seeks to transfer data sends a request for a representation of the data. In response, the requestor receives one or more tokens that represent the data. The requestor may then provide one or more of these tokens to a component with a request to write data represented by the one or more tokens. In some exemplary applications, the component may use the one or more tokens to identify the data and may then read the data or logically write the data without additional interaction with the requestor. Tokens may be invalidated by request or based on other factors.
摘要翻译： 本文描述的主题的方面涉及卸载读取和写入。 在方面，寻求传输数据的请求者发送对数据表示的请求。 作为响应，请求者接收表示数据的一个或多个令牌。 然后，请求者可以向组件提供写入由一个或多个令牌表示的数据的请求的一个或多个令牌。 在一些示例性应用中，组件可以使用一个或多个令牌来识别数据，然后可以读取数据或逻辑地写入数据，而无需与请求者的额外交互。 令牌可能被请求或基于其他因素无效。
-
公开(公告)号：US08793463B2
公开(公告)日：2014-07-29
申请号：US13230505
申请日：2011-09-12
申请人： Darren Moss , Karan Mehra , Emanuel Paleologu
发明人： Darren Moss , Karan Mehra , Emanuel Paleologu
CPC分类号： G06F3/0644 , G06F3/0608 , G06F3/0631 , G06F3/0665 , G06F3/0689 , G06F12/0223 , G06F12/023 , G06F12/0646
摘要： A storage device set may allocate capacity for spaces (e.g., logical volumes) according to an allocation strategy, e.g., allocating capacity from the storage device having the greatest available capacity, or maximizing the distribution of allocated capacity across the storage devices. However, such allocation strategies may be inefficient (e.g., limiting the capability of the storage device set to satisfy subsequent requests with constraints such as a minimum distribution of capacity across several storage devices). The techniques presented herein achieve efficient allocation by first allocating capacity on storage devices having ample available capacity using a round-robin technique, and if such storage devices do not satisfy the capacity request, allocating capacity on storage devices having limited available capacity. Additionally, the techniques presented herein facilitate thin provisioning through capacity reservations, wherein storage devices withhold unallocated storage for particular spaces that may be utilized as a reserve if unreserved capacity is exhausted.
摘要翻译： 存储设备组可以根据分配策略来分配空间（例如，逻辑卷）的容量，例如从具有最大可用容量的存储设备分配容量，或者跨越存储设备最大化分配的容量的分配。 然而，这种分配策略可能是低效的（例如，限制存储设备集合的能力以满足具有约束的后续请求，例如跨几个存储设备的容量的最小分布）。 本文提出的技术通过使用循环技术首先分配具有足够可用容量的存储设备的容量来实现有效的分配，并且如果这样的存储设备不满足容量请求，则在具有有限可用容量的存储设备上分配容量。 此外，本文中提供的技术有助于通过容量预留进行精简配置，其中存储设备对于特定空间进行保留，这些空间可用作储备，如果未预留的容量被耗尽。
-
公开(公告)号：US20130067187A1
公开(公告)日：2013-03-14
申请号：US13230505
申请日：2011-09-12
申请人： Darren Moss , Karan Mehra , Emanuel Paleologu
发明人： Darren Moss , Karan Mehra , Emanuel Paleologu
IPC分类号： G06F12/00
CPC分类号： G06F3/0644 , G06F3/0608 , G06F3/0631 , G06F3/0665 , G06F3/0689 , G06F12/0223 , G06F12/023 , G06F12/0646
摘要： A storage device set may allocate capacity for spaces (e.g., logical volumes) according to an allocation strategy, e.g., allocating capacity from the storage device having the greatest available capacity, or maximizing the distribution of allocated capacity across the storage devices. However, such allocation strategies may be inefficient (e.g., limiting the capability of the storage device set to satisfy subsequent requests with constraints such as a minimum distribution of capacity across several storage devices). The techniques presented herein achieve efficient allocation by first allocating capacity on storage devices having ample available capacity using a round-robin technique, and if such storage devices do not satisfy the capacity request, allocating capacity on storage devices having limited available capacity. Additionally, the techniques presented herein facilitate thin provisioning through capacity reservations, wherein storage devices withhold unallocated storage for particular spaces that may be utilized as a reserve if unreserved capacity is exhausted.
摘要翻译： 存储设备组可以根据分配策略来分配空间（例如，逻辑卷）的容量，例如从具有最大可用容量的存储设备分配容量，或者跨越存储设备最大化分配的容量的分配。 然而，这种分配策略可能是低效的（例如，限制存储设备集合的能力以满足具有约束的后续请求，例如跨几个存储设备的容量的最小分布）。 本文提出的技术通过使用循环技术首先分配具有足够可用容量的存储设备的容量来实现有效的分配，并且如果这样的存储设备不满足容量请求，则在具有有限可用容量的存储设备上分配容量。 此外，本文中提供的技术有助于通过容量预留进行精简配置，其中存储设备对于特定空间进行保留，这些空间可用作储备，如果未预留的容量被耗尽。
-
公开(公告)号：US20130067179A1
公开(公告)日：2013-03-14
申请号：US13229871
申请日：2011-09-12
申请人： Emanuel Paleologu , Karan Mehra , Darren Moss
发明人： Emanuel Paleologu , Karan Mehra , Darren Moss
CPC分类号： G06F11/1076 , G06F11/2064 , G06F2211/1009 , G06F2211/1035 , G06F2211/104 , G06F2211/1061
摘要： A storage set (e.g., an array of hard disk drives) may experience a failure, such as a loss of power, a software crash, or a disconnection of a storage device, while writes to the storage set are in progress. Recover from the failure may involve scanning the storage set to detect and correct inconsistencies (e.g., comparing mirrors of a data set or testing checksums). However, lacking information about the locations of pending writes to the storage set during the failure, this “cleaning” process may involve scanning the entire storage set, resulting in protracted recovery processes. Presented herein are techniques for tracking writes to the storage set by apportioning the storage set into regions of a region size (e.g., one gigabyte), and storing on the nonvolatile storage medium descriptors of “dirty” regions comprising in-progress writes. The post-failure recovery process may then be limited to the regions identified as dirty.
摘要翻译： 存储组（例如，硬盘驱动器阵列）在对存储组的写入正在进行中可能经历诸如功率损失，软件崩溃或存储设备的断开之类的故障。 从故障恢复可能涉及扫描存储集以检测和纠正不一致（例如，比较数据集的镜像或测试校验和）。 但是，缺少关于在故障期间暂存写入存储集的位置的信息，此清理过程可能涉及扫描整个存储集，导致持续的恢复过程。 这里提出的是通过将存储集合分配到区域大小（例如，一千兆字节）的区域来跟踪对存储集的写入的技术，以及在非易失性存储介质上存储包括正在进行的写入的脏区域的描述符。 然后，故障后恢复过程可以限于被识别为脏的区域。
-
-
-
-
-
-
-
-
-
搜索结果
64 条记录 (耗时 0.031 秒)
