Abstract: A method and apparatus physically partitions clean and dirty cache lines into separate memory partitions, such as one or more banks, so that during low power operation, a cache memory controller reduces power consumption of the cache memory containing the clean only data. The cache memory controller controls refresh operation so that data refresh does not occur for clean data only banks or the refresh rate is reduced for clean data only banks. Partitions that store dirty data can also store clean data, however other partitions are designated for storing only clean data so that the partitions can have their refresh rate reduced or refresh stopped for periods of time. When multiple DRAM dies or packages are employed, the partition can occur on a die or package level as opposed to a bank level within a die.

Abstract: Systems, methods, and machine-readable media are disclosed for collecting, maintaining, and retrieving use and limit data for connected resources, as well as determining an optimal location for creating a new volume (or volumes) on a storage platform and placing the volume at the determined location. A resource tracker collects resource use and/or limits data and stores it in a database. A volume placement service receives a volume deployment specification having constraints for creating a new volume. The volume placement service retrieves the data from the database. The volume placement service identifies an optimal location for the volume based at least in part on given constraints from the specification and the resource usage data. The system places the requested volume at the determined location.

Abstract: Rotating disk drives can be partitioned into performance partitions (PPs) each including slices having similar performance in accordance with an allowable difference or tolerance for any of data throughput, bandwidth and data transfer rate. Each subdrive can correspond to slices of the rotating disk drives included in a single PP. Each PP can have a performance level denoting a relative performance ranking of PPs. Each PP tier can include PPs across multiple rotating disk drives have the same performance level. Resiliency sets (RSs) can be configured from the PP tiers where each RS can include slices of subdrives from only one of the PP tiers. Physical ubers or units (PUs) can be allocated from the RSs. Each PU can denote a mapped RAID group configured from slices of different subdrives of one RS. Spare slices can be reserved in each RS or a lowest performance PP tier.

Abstract: Storage can be allocated to workspaces in a ZFS-based environment. Workspaces can be associated with a workspace weightage. When a workspace is deployed on a client computing device, its workspace weightage can be used to determine an initial quota for a dataset to be created in a zpool for the workspace. The initial quota can be used to determine the size of the dataset. The workspace weightage may also be used to determine an expansion quota and a contraction quota that can be used to calculate the size of an expansion or contraction respectively. The use of workspace weightages and their associated quotas can ensure that the zpool is fairly shared by the various datasets that may be created therein for workspaces deployed on the client computing device.

Abstract: A method for maintaining coherence for memory storage devices comprising a plurality of controllers in a side-by-side configuration. The method includes generating, by a first controller of the plurality of controllers, a first plurality of requests to access a first plurality of memory ranges; receiving, by the first controller from a second controller of the plurality of controllers, a second plurality of requests to access a second plurality of memory ranges; and serializing, by the first controller, the first plurality of requests and the second plurality of requests to generate a serialized request.

Abstract: A system comprises a plurality of computing devices that are communicatively coupled via a network and have a file system distributed among them, and comprises one or more file system request buffers residing on one or more of the plurality of computing devices. File system choking management circuitry that resides on one or more of the plurality of computing devices is operable to separately control: a first rate at which a first type of file system requests (e.g., one of data requests, data read requests, data write requests, metadata requests, metadata read requests, and metadata write requests) are fetched from the one or more buffers, and a second rate at which a second type of file system requests (e.g., another of data requests, data read requests, data write requests, metadata requests, metadata read requests, and metadata write requests) are fetched from the one or more buffers.

Abstract: A method, non-transitory computer readable medium, and device that assists with reducing memory fragmentation in solid state devices includes identifying an allocation area within an address range to write data from a cache. Next, the identified allocation area is determined for including previously stored data. The previously stored data is read from the identified allocation area when it is determined that the identified allocation area comprises previously stored data. Next, both the write data from the cache and the read previously stored data are written back into the identified allocation area sequentially through the address range.

Abstract: The disclosure provides a blockchain random number generating system and blockchain random number generating method. The blockchain random number generating system includes a smart contract. A second electronic device generates a second random number and a second hash value corresponding to the second random number, and transmits the second hash value to a first block of the smart contract. A first electronic device generates a first random number and a first hash value corresponding to the first random number, and transmits the first hash value to a second block of the smart contract. A fifth block of the smart contract receives a real-time transaction index, and generates a random seed according to the real-time transaction index, the first random number and the second random number and calculates a result of the smart contract in the fifth block according to the random seed.

Abstract: Volume migration among a set of storage systems synchronously replicating a dataset for a volume, where volume migration includes: initiating a transfer of the volume in dependence upon determining that a performance metric for accessing the volume stored on a first storage system would improve if transferred to a second storage system; and during the transfer of the volume: determining status information for the transfer; intercepting an I/O operation directed to the volume; and directing, in dependence upon the status information, the I/O operation to either the first storage system or the second storage system.

Abstract: Technologies for providing shared memory for accelerator sleds includes an accelerator sled to receive, with a memory controller, a memory access request from an accelerator device to access a region of memory. The request is to identify the region of memory with a logical address. Additionally, the accelerator sled is to determine from a map of logical addresses and associated physical address, the physical address associated with the region of memory. In addition, the accelerator sled is to route the memory access request to a memory device associated with the determined physical address.

Abstract: A memory allocation device on an originating node requests an allocation of memory from a remote node. In response, the memory allocation device on the remote node returns a global system address that can be used to access the remote allocation from the originating node. Concurrent with the memory allocation device assigning (associating) a local (to its node) physical address to be used to access the remote allocation, the remote node allocates local physical memory to fulfill the remote allocation request. In this manner, the remote node has already completed the overhead operations associated with the remote allocation requested by the time the remote allocation is accessed by the originating node.

Abstract: Methods, systems, and devices for using page line filler data are described. In some examples, a memory system may store data within a write buffer of the memory system. The memory system may initiate an operation to transfer the write buffer data to a memory device, for example, due to a command to perform a memory management operation (e.g., cache synchronization, context switching, or the like) from a host system. In some examples, a quantity of write buffer data may fail to satisfy a data size threshold. Thus, the memory system may aggregate the data in the write buffer with valid data from a block of the memory device associated with garbage collection. The memory system may aggregate the write buffer data with the garbage collection data until the aggregated data satisfies the data size threshold. The memory system may then write the aggregated data to the memory device.

Abstract: A method of operating a storage system is disclosed. The method includes determining a storage cluster among storage arrays of the storage system. Each storage array includes at least two controllers and at least one storage shelf. The at least two controllers are configured to function as both a primary controller for a first storage array and a secondary controller for a second storage array.

Abstract: Method and apparatus implementing smart store operations with conditional ownership requests. One aspect includes a method implemented in a multi-core processor, the method comprises: receiving a conditional read for ownership (CondRFO) from a requester in response to an execution of an instruction to modify a target cache line (CL) with a new value, the CondRFO identifying the target CL and the new value; determining from a local cache a local CL corresponding to the target CL; determining a local value from the local CL; comparing the local value with the new value; setting a coherency state of the local CL to (S)hared when the local value is same as the new value; setting the coherency state of the local CL to (I)nvalid when the local value is different than the new value; and sending a response and a copy of the local CL to the requester. Other embodiments include an apparatus configured to perform the actions of the methods.

Abstract: A remote data replication method and a storage system, where a production array sends a data replication request to a disaster recovery array. The data replication request includes an identifier of a source object and a data block corresponding to the source object. The data block is stored in physical space of a hard disk of the production array. The disaster recovery array receives the data replication request. The disaster recovery array creates a target object when the disaster recovery array does not include an object having a same identifier as the source object. An identifier of the target object is the same as the identifier of the source object, the disaster recovery array writes the data block into the physical space.

Abstract: A storage device includes NVM package and a controller connected to the NVM package through a channel and controlling operation of the NVM package. The NVM package includes an interface chip, first NVM devices connected to the interface chip through a first internal channel and second NVM devices connected to the interface chip through a second internal channel. The interface chip selects the first internal channel in response to an operation request received from the controller and connects the first internal channel to the channel. The interface chip also determines whether retraining is necessary in relation to the second internal channel and transmits a retraining request to the controller when retraining is necessary.

Abstract: Techniques are used for identifying allocated blocks in a storage system. The techniques may be used to provide, among other things, retrieval of a value associated with a most recent reinitialization of the storage system. For a tier of user data storage in the storage system, a page of storage with the value and a marker indicating that the page marks an end of storage that has been allocated for the tier of user data storage may be identified. Storage may be allocated from a page immediately preceding the identified page.

Abstract: A system and method for repartitioning data in a distributed network. The method may include executing, by one or more processors, a first pass of a data set from a plurality of first sources to a plurality of first sinks, each first sink collecting data from one or more of the first sources, and executing, by the one or more processors, a second pass of the data set from a plurality of second sources to a plurality of second sinks, each one of the plurality of first sinks corresponding to one of the plurality of second sources, and each second sink collecting data from one or more of the second sources. Executing the first and second passes causes the data set to be repartitioned such that one or more second sinks collect data that originated from two or more of the first sources.

Abstract: System and method for performance control in a cloud computing environment uses dependency hierarchy between software entities executing in the cloud computing environment and operational status of each of the software entities executing in the cloud computing environment. Using the dependency hierarchy between the software entities and the operational status of each of the software entities, a scaling operation is performed to the virtual computing instances such that a service-level objective (SLO) of the cloud computing environment satisfies a predetermined threshold.

Abstract: Data storage management may include configuring a stretched volume in a metro cluster configuration using a first volume and a second volume both configured as a same logical volume, L1; receiving I/O operations at the metro cluster configuration directed to L1, wherein the I/O operations include a write operations that are received at a first system of the metro cluster configuration and that write first data to the first volume; viewing values of a metric regarding data replication performed for the first volume to replicate data between systems of the metro cluster configuration for writes directed to the first volume; responsive to said viewing, determining whether the first metric values denote a problem has occurred in the metro cluster configuration at a first point in time; and responsive to determining that the problem has occurred at the first point in time, performing one or more corrective actions.