Abstract: A processor of an aspect includes a decode unit to decode an aperture access instruction, and an execution unit coupled with the decode unit. The execution unit, in response to the aperture access instruction, is to read a host physical memory address, which is to be associated with an aperture that is to be in system memory, from an access protected structure, and access data within the aperture at a host physical memory address that is not to be obtained through address translation. Other processors are also disclosed, as are methods, systems, and machine-readable medium storing aperture access instructions.

Abstract: This application relates to load balancing for a number of partitions of a network-based storage service. Each partition includes a number of server devices and/or network devices located in a data center and configured to provide access to storage resources hosted within the data center. User accounts are assigned to a particular partition such that requests related to a particular user account are routed to that partition. Periodically, a load balancing algorithm is executed to re-assign user accounts to different partitions to rebalance resource consumption across the different partitions. The load balancing algorithm can balance resource consumption for any number of resource types by generating a vector of resource utilization parameters for each user account, sorting the plurality of user accounts into clusters based on the vectors, and mapping at least some user accounts to different partitions.

Abstract: The present disclosure generally relates to methods of operating storage devices. The storage device is comprised of a controller, a random access memory (RAM) unit, and a NVM unit, wherein the NVM unit is comprised of a plurality of zones. The RAM unit comprises a first logical to physical address table and the NVM unit comprises a second logical to physical address table. The zones are partitioned into sections, and each partitioned section aligns with a change log table. Data is written to each zone sequentially, and only one partitioned section is updated at a time for each zone. Each time a zone is erased or written to in the NVM unit, the first logical to physical address table is updated and the second logical to physical address table is periodically updated to match the first logical to physical address table.

Abstract: A storage device is disclosed. The storage device may include storage for data. A host interface logic may receive a dataset and a logical address from a host. A stream assignment logic may assign a stream identifier (ID) to a compressed dataset based on a compression characteristic of the compressed dataset. The stream ID may be one of at least two stream IDs; the compressed dataset may be determined based on the dataset. A logical-to-physical translation layer may map the logical address to a physical address in the storage. A controller may store the compressed dataset at the physical address using the stream ID.

Abstract: A method of initializing a data storage system (DSS) is provided. The method includes (a) in response to the DSS booting, reading data from a first plurality of disks marked as part of a raw mirror which mirrors configuration data of the DSS between the first plurality of disks; (b) comparing sequence numbers from the read data read and selecting data from a disk of the first plurality having a latest sequence number; (c) obtaining configuration data of the DSS from the selected data; (d) using the configuration data to construct a topology of the DSS which includes information describing a relationship between a second plurality of disks of the DSS, RAID groups of the DSS, and logical disks presented to users, the second plurality of disks being larger than and including the first plurality of disks; and (e) initializing the RAID groups and the logical disks described by the topology based on the information of the topology.

Abstract: A method, computer program product, and computing system for receiving one or more IO requests at a cache system for storing content in a storage array. A maximum number of concurrent backend IO requests may be associated with the storage array based upon, at least in part, a change in size of the storage array. The one or more TO requests may be flushed to the storage array via one or more backend IO requests from the cache system based upon, at least in part, the maximum number of concurrent backend IO requests associated with the storage array.

Abstract: Generally described, one or more aspects of the present application relate to a public snapshot service for creating and managing block-level snapshots on a cloud provider network. Storage locations for each block that comprise the snapshot can be enumerated on a snapshot manifest. Identification of storage location for a requested snapshot block can be improved using a manifest index.

Abstract: Example storage systems, file system interfaces, and methods provide cache commit timing management for aggregated writes. A system includes a data cache configured to aggregate data requests in buffer segments. A cache manager determines a delay threshold for each buffer based on usage values of the data cache. The cache manager monitors a commit time value, determines when the commit time value satisfies the delay threshold, and moves aggregate data elements from the buffer to persistent storage.

Abstract: A tool for adjusting available physical tape storage capacities. The tool determines an initial capacity size for one or more tapes, wherein the initial capacity size is a maximum physical storage capacity provided by the one or more tapes. The tool assigns the one or more tapes to a logical cluster based, at least in part, on the initial capacity size for the one or more tapes. The tool determines an initial storage capacity for the one or more tapes, wherein the initial storage capacity is a starting logical storage capacity that is less than the maximum physical storage capacity provided by the one or more tapes. The tool determines an incremental growth threshold for the one or more tapes. Responsive to a determination that the incremental growth threshold is exceeded, the tool increments a logical storage capacity of the one or more tapes by an incremental growth assignment.

Abstract: The disclosed embodiments provide a method, apparatus, and system for selecting, based on feedback from previous garbage collections, a portion of a referenced memory area for garbage collection within a time window. During the execution of a software program, the system selects a given portion of a referenced memory area on which garbage collection can be completed within the given time window and attempts to complete garbage collection on at least the given portion of the referenced memory area before the end of the given time window. Next, the system selects, based on the results of the garbage collection performed during the given time window, a subsequent portion of the referenced memory area on which garbage collection can be completed within the subsequent time window and attempts to complete garbage collection on at least the subsequent portion of the referenced memory area before the end of the subsequent time window.

Abstract: An in-memory cache for a computer system having a first storage and a second storage where the first storage is a cache for the second storage, tracks priority levels of block attributes stored therein. If a data item is cached in the first storage, the block attribute corresponding to the data item is stored in the in-memory cache as a high priority block attribute. If a data item evicted from the first storage, the block attribute corresponding to the data item is stored in the in-memory cache as a low priority block attribute. When the cache becomes full, the low priority block attributes are evicted before the high priority block attributes.

Abstract: Described embodiments provide systems and methods for streaming a virtual disk. A first virtual hard disk (VHDX) file can be converted into a read-only VHDX file on a hypervisor. A second VHDX file can be created as a snapshot of the read-only VHDX file on the hypervisor. Partition globally unique identifiers (GUIDs) of the second VHDX file can be updated to be different from those of the read-only VHDX file. A provisioning services server executing on the hypervisor can stream the second VHDX file as a virtual disk over a virtual network established by the hypervisor, by booting the second VHDX file over the virtual network.

Abstract: Systems and methods are directed to managing access to a shared memory. A request received at a memory controller, for access to the shared memory from a client of one or more clients configured to access the shared memory, is placed in at least one queue in the memory controller. A series of one or more timeout values is assigned to the request, based, at least in part on a priority associated with the client which generated the request. The priority may be fixed or based on a Quality-of-Service (QoS) class of the client. A timer is incremented while the request remains in the first queue. As the timer traverses each one of the one or more timeout values in the series, a criticality level of the request is incremented. A request with a higher criticality level may be prioritized for servicing over a request with a lower criticality level.

Abstract: Provided herein are biological information pattern (BIP) arrays and related methods for reading out information stored in a biological medium. In this manner, encoded digital information in biomolecular medium can be used as a high data density storage medium that may be read-out and accessed in a label-free manner.

Abstract: A method and system for binding and verifying between a storage device and hosts are provided. The method includes: sharing system parameters in advance with the hosts by the storage device, where the hosts are to be bound to the storage device; using a programmable read-only memory as the storage device, dividing the programmable read-only memory into m regions, completing the binding between each region and one corresponding host to be bound using the pre-shared system parameters, where m is a positive integer; verifying an identity of a bound host in accordance with the pre-shared system parameters through a zero-knowledge proof method by the storage device; if the verification is successful, starting the storage device and serving the bound host; if the verification is unsuccessful, terminating the starting of the storage device and refusing to serve the bound host.

Abstract: Provided are a computer program product, system, and method for considering a frequency of access to groups of tracks and density of the groups to select groups of tracks to destage. One of a plurality of densities for one of a plurality of groups of tracks is incremented in response to determining at least one of that the group is not ready to destage and that one of the tracks in the group in the cache transitions to being ready to destage. A determination is made of a group frequency indicating a frequency at which tracks in the group are modified. At least one of the density and the group frequency is used for each of the groups to determine whether to destage the group. The tracks in the group in the cache are destaged to the storage in response to determining to destage the group.

Abstract: Example distributed storage systems, replication managers, and methods provide replication configurations for data transfers to multiple heterogeneous data stores. A first object data store includes multiple storage buckets for replication to different data stores. Different target storage systems have different system configurations that are different than the native system configuration. For each storage bucket and corresponding target storage system, a native replication operation is translated to a target replication operation compatible with the target system configuration and the target replication operation is used to replicate the selected storage bucket to the corresponding target storage system.

Abstract: A distributed computing environment is provided with a system and method for supporting rare copy-on-write data access. The system operates a data structure in a read only pattern suitable for serving a plurality of read requests with reduced overhead. The system, upon receiving a write request, creates a copy of data to execute the write request. The system defers writing the mutated data back to the read-only data structure. The system thus allows for multiple mutations to be made to the copy of the data using a read/write access pattern. After a number of read-only requests are received, the mutated data is written back to the read-only data structure. A monitor counts read and write requests in order to reduce overall read/write overhead and enhance performance of the distributed data grid.

Abstract: A data storage apparatus includes a nonvolatile memory device including a plurality of dies configured as a plurality of super blocks and a plurality of flush buffer blocks, an open super block manager configured to manage an index of an allocated open super block and a location into which data is to be written in the allocated open super block, an open flush buffer block manager configured to manage indexes of allocated open flush buffer blocks and locations into which data is to be written in the allocated open flush buffer blocks, and a processor configured to identify a first die in which a normal write operation is being performed and a second die next to the first die using the open super block manager, and select open flush buffer block included in dies other than the first die and the second die using the open flush buffer block manager.

Abstract: Embodiments of the present disclosure relate to a method for I/O data transmission in a Hyper-Converged Storage System (HCSS). The HCSS comprises at least one storage node having at least one device constructed with virtualization technology and a storage I/O processing module for accessing persistent storage resource of the HCSS. According to the method, an I/O request of a first type is received from the device by a System Disk front-end driver (SFD), wherein the I/O request of the first type is an I/O request to a system disk of the device. The I/O request of the first type and its corresponding response of a first type are transferred by the SFD between the device and the storage I/O processing module via a first shared memory, wherein the first shared memory is created by allocating a first memory region of the HCSS as the first shared memory.