Patent classifications
G06F3/0664
DYNAMIC FAIL-SAFE REDUNDANCY IN AGGREGATED AND VIRTUALIZED SOLID STATE DRIVES
A solid state drive having a drive aggregator and a plurality of component solid state drive, including a first component solid state drive and a second component solid state drive. The drive aggregator has at least one host interface, and a plurality of drive interfaces connected to the plurality of component solid state drives. The drive aggregator is configured to generate, in the second solid state drive, a copy of a dataset that is stored in the first component solid state drive. In response to a failure of the first component solid state drive, the drive aggregator is configured to substitute a function of the first component solid state drive with respect to the dataset with a corresponding function of the second component solid state drive, based on the copy of the dataset generated in the second component solid state drive.
METHOD AND SYSTEMS FOR STORING DATA IN A STORAGE POOL USING MEMORY SEMANTICS WITH APPLICATIONS INTERACTING WITH EMULATED BLOCK DEVICES
A method for storing data, comprising receiving, by a file system (FS) client executing on an offload component, a first request from a translation module, wherein the translation module translated a second request that was to be performed on an emulated block device into the first request, wherein the first request is specified using file semantics, wherein the first request is associated with data, wherein the offload component is located in a hardware layer of a client application node, and wherein the translation module is located on the offload component, and processing the first request by the FS client and a memory hypervisor module, wherein the FS client and the memory hypervisor module are executing in a modified client FS container on the offload component, wherein processing the first request results in at least a portion of the data being stored in a location in a storage pool.
Data storage interface for protocol-agnostic storage services
- Sachin Suresh Bhat ,
- Lionel Bitoun ,
- LiJing Chen ,
- Jaikit Dungarshi Savla ,
- Daniel Wu ,
- Jaden Wright ,
- Adam Tessier ,
- Sourabh Shrivastav ,
- Rutvik Gopalkrishna Hora ,
- Manjunath Tumkur Maheshchandra ,
- Ramanathan Padinjarel Somanathan ,
- Manoj Kumar Dhanger ,
- Nitin Saini ,
- Jeet Nishit Mehta ,
- Ruonan Zhang ,
- Harshaneel Harshal Gokhale ,
- Ravneet Singh Sidhu
A data storage interface provides access to data storage clusters that may not otherwise be accessible to data accessors. The data storage interface can serve as a point of access for data accessors to access stored data via a consistent data access protocol, even when a data storage cluster on which requested data is stored may use a different protocol. The data storage interface can also provide access across network boundaries, such as those between different private cloud computing systems (e.g., virtual private clouds or “VPCs”).
METHODS AND SYSTEMS PARALLEL RAID REBUILD IN A DISTRIBUTED STORAGE SYSTEM
A method for rebuilding data, comprising: obtaining, from a metadata node, a source file data layout for a source file and a target file data layout for a target file, wherein the source file is associated with a degraded mapped RAID group and the target file is associated with a new mapped RAID group; generating, by the client application node, a plurality of input/output (I/O) requests to read a portion of the data associated with the source file using the source file data layout; obtaining, in response to the plurality of I/O requests, the portion of the data associated with the source file; rebuilding a second portion of the data associated with source file using the portion of the data; and initiating, storage of at least the second portion of the data associated with the source file in the storage pool using the target file data layout.
AUTOMATIC RECOVERY OF LOCKING FILESYSTEM SHARED BETWEEN VIRTUAL TAPE LIBRARY NODES
A virtual tape library system includes multiple copies of a LockFS that are mounted on all nodes. One of the LockFSs is designated as the active copy. A primary node manages recovery when a secondary node signals loss of connectivity with the active copy by posting a sync request file to at least one of the LockFSs. The primary node posts status request files to the LockFSs and the secondary nodes respond by writing status to the status request files. A LockFS that is reachable by all nodes is selected as the new active LockFS. Switchover is accomplished by the primary node posting a disable request file to the selected LockFS and waiting for all secondary nodes to acknowledge by writing to the disable request file. The primary node then posts an activate request file to the selected LockFS and waits for all secondary nodes to acknowledge by writing to the activate request file.
CONTROLLED INPUT/OUTPUT IN PROGRESS STATE DURING TESTCASE PROCESSING
A transient input/output in progress state is established during processing of an input/output testcase by a test infrastructure in a computing environment. The method includes obtaining the input/output testcase for an object having one or more pages, and processing the input/output testcase by the test infrastructure. Processing the input/output testcase by the test infrastructure includes, for a page of the object, generating a delay in the processing of the input/output testcase for the page of the object. The delay opens a transient input/output in progress state during which one or more concurrent test operations are to reference the page of the object.
SITE RESILIENCY ON STRETCHED CLUSTERS
A method for dynamic fault tolerance in a stretched storage cluster is provided. Embodiments include determining that data of a storage object is unavailable on a first site in a multi-site storage cluster comprising: the first site; a second site; and a witness node. Embodiments include modifying a voting arrangement for the storage object so that votes from the second site can achieve a quorum without any votes from the first site or the witness node. Embodiments include determining that the witness node is unavailable. Embodiments include, after determining that the witness node is unavailable, allowing data to be read from or written to one or more entities of the second site based on the quorum being achieved.
Reducing data using a plurality of compression operations in a virtual tape library
Embodiments are provided for reducing data using a plurality of compression operations in a computing storage environment. A speed of data writing to a virtual tape device and an availability of one or more processor devices for the virtual tape device may be monitored. One or more requests may be received for writing data to the virtual tape device. Data to be written to the virtual tape device, corresponding to a selected number of the one or more requests for writing the data, may be compressed according to both the speed of data writing to the virtual tape device and the availability of one or more processor devices for the virtual tape device. The compressed data may be stored in the virtual tape device in record units. Non-compressed data may be compressed in the virtual tape device at a subsequent period of time (e.g., future time period).
STORAGE SYSTEM, STORAGE NODE VIRTUAL MACHINE RESTORE METHOD, AND RECORDING MEDIUM
A storage system in which a cluster is configured by a plurality of storage nodes is configured to include: a management server configured to store a template including an OS of a storage node, a process program that configures a process, and an installer; a maintenance node VM configured to collect configuration information required for configuring a restore-target storage node from within the storage system; a maintenance node, a management server, and a hypervisor configured to create a VM for a new storage node on the basis of the template and the configuration information; and a cluster controller configured to create a process in the new storage node using the installer and restore the process to a state corresponding to the process of the restore-target storage node.
UPDATING STORED CONTENT IN AN ARCHITECTURE UTILIZING A MIDDLE MAP BETWEEN LOGICAL AND PHYSICAL BLOCK ADDRESSES
A method for updating block addresses is provided. The method includes overwriting content of a first data block referenced by a first logical block address (LBA) with updated content. Prior to overwriting, the content of the first data block is stored in a first physical block corresponding to a first physical block address (PBA), a logical map maps the first LBA to a first middle block address (MBA), and a middle map maps the first MBA to the first PBA. After overwriting, the updated content of the first data block is stored in a second physical block corresponding to a second PBA and, in response to the overwriting, the middle map is updated to map the first MBA to the second PBA instead of the first PBA.