Abstract: Systems and methods for verifying a firewall for a cloud provider. The method includes receiving by a timelord module configured with access to a plurality of HTTP attacks that incorporate random tokens, an updated policy ok signal that was generated by an external element. The timelord module responds by (a) loading a first HTTP attack with a first expected response that is either forbidden or accepted, the first HTTP attack including the random tokens in a form of a header key value parameter; (b) sending the first HTTP attack to the firewall; (c) comparing a response from the firewall to the first HTTP attack with the first expected response; and (d) incrementing the first HTTP attack and repeating (a)-(c) until the plurality of HTTP attacks has been sent; and deleting the random tokens after the plurality of HTTP attacks have been sent.

Abstract: Embodiments are directed to in-place erasure code transcoding for distributed file systems. A file system may be divided into a first partition associated with a first erasure code and a second partition second partition is associated with a second erasure code. If the second partition has sufficient storage space to store protection groups further actions may be performed, including: determining block stores in the first partition associated with the protection groups; transcoding contents of the block stores into other block stores based on the second erasure code; storing the other block stores in the second partition; deleting the block stores from the first partition; shifting another portion of the storage space from the first partition to the second partition such that the shifted other portion increases a size of the second partition to provide sufficient storage space for other protection groups; or the like.

Abstract: A system, method, and machine-readable storage medium for restoring a data object for a specified active time period are provided. In some embodiments, the method includes receiving, by a storage device from a client, a request specifying an active time period for a data object to remain stored on an accessible tier. The method also includes determining, by the storage device, that the active time period has elapsed. The method further includes responsive to a determination that the active time period has elapsed, sending, by the storage device, a request to a server storing the data object to move the data object from the accessible tier to an archive tier. Data objects that are stored on the accessible tier are accessible by the client, and data objects that are stored on the archive tier are inaccessible by the client.

Abstract: A flash device includes user storage space for storing user data and over provisioning space for garbage collection within the flash device. The flash device receives an operation instruction, and then performs an operation on user data stored in the user storage space based on the operation instruction. Further, the flash device identifies a changed size of user data after performing the operation. Based on the changed size of data, a target adjustment parameter is identified. Further, the flash device adjusts the capacity of the over provisioning space according to the target adjustment parameter.

Abstract: Techniques are described herein that are capable of dynamically re-allocating computing resources while maintaining network connection(s). Applications of users are run in a computing unit. Computing resources are allocated among the applications based at least in part on dynamic demands of the applications for the computing resources and resource limits associated with the respective customers. In a first example, the computing resources are dynamically re-allocated among the applications, as a result of changing the resource limit of at least one customer, while maintaining at least one network connection between a client device of each customer and at least one respective application. In a second example, the computing resources are dynamically re-allocated among the applications, as a result of changing the resource limit of at least one customer, while maintaining at least one network connection between an interface and a client device of each customer.

Abstract: A method for managing a memory associated with PCIe SSD including: generating memory pools of equal size from a predefined size of contiguous physical memory, each of the memory pools manages a memory request of different size and is associated with a respective predefined size of memory request; dividing each of the memory pools into first set of memory pages, each having a size equal to maximum size among the predefined size of the memory request associated with the respective memory pool; dividing each of the first set of memory pages into second set of memory pages, each having a size equal to the predefined size of the memory request associated with respective memory pool; and managing the contiguous physical memory by allocating a memory page from the second set of memory pages fora memory request corresponding to the size of the second set of memory pages.

Abstract: A data storage device includes a memory device and a controller coupled to the memory device. The memory device includes at least a first super device and a second super device. Each of the super devices includes a plurality of active zones and a threshold value for a number of cold zones. The controller classifies zones as either a cold zone or hot zone depending the number of resets to the zone. If the number of resets to the zone is greater than a threshold reset value, then the zone is classified as a hot zone, otherwise the zone is classified as a cold zone. The controller is configured to determine that the number of cold zones is greater than the threshold value for a super device and move data from at least one cold zone from the super device to a zone of another super device.

Abstract: The described technology is generally directed towards data movement from data storage clusters. A data movement job can be split into data movement tasks, and the data movement tasks can be distributed among multiple nodes of a data storage cluster. In order to distribute the tasks, a data store that identifies the tasks can be split into multiple segments, and different groups of nodes can be assigned affinities to process tasks identified in the different segments. Furthermore, the nodes of each group of nodes can be assigned different start positions within their storage segment, to reduce the likelihood of contention between nodes in connection with claiming a same task. Some of the tasks can be generated in an already claimed state, which also reduces contention and allows for more efficient operation.

Abstract: The present technology includes a controller and a memory system including the same. The controller includes a descriptor manager configured to generate descriptors including logical addresses and physical addresses respectively mapped to the logical addresses, a map cache configured to store the descriptors in a linear structure and a binary tree structure, and a map search engine configured to search for a descriptor corresponding to a logical address received from an external device among the descriptors stored in the map cache by performing a linear search method, a binary search method, or both, according to a status of the map cache.

Abstract: A method includes receiving data objects, determining a predicted lifespan of each data object, and instantiating multiple shard files. Each shard file has an associated predicted lifespan range. The method also includes writing each data object into a corresponding shard file having the associated predicted lifespan range that includes the predicted lifespan of the respective data object and storing the shard files in a distributed system. The method also includes determining whether any stored shard files satisfy a compaction criteria based on a number of deleted data objects in each corresponding stored shard file. For each stored shard file satisfying the compaction criteria, the method also includes compacting the stored shard file by rewriting the remaining data objects of the stored shard file into a new shard file.

Abstract: A circular buffer architecture includes a memory coupled to a producer circuit and a consumer circuit. The memory is configured to store objects. The memory can include memory banks. The number of the memory banks is less than a number of the objects. The circular buffer can include hardware locks configured to reserve selected ones of the memory banks for use by the producer circuit or the consumer circuit. The circular buffer can include a buffer controller coupled to the memory and configured to track a plurality of positions. The positions can include a consumer bank position, a consumer object position, a producer bank position, and a producer object position. The buffer controller is configured to allocate selected ones of the objects from the memory banks to the producer circuit and to the consumer circuit according to the tracked positions and using the hardware locks.

Abstract: A data storage device and method for detecting malware on a data storage device. The device includes a non-volatile storage medium configured to store at least one file system control block and user data block(s) to store user data. The file system control block comprises at least one reference data structure. The data storage device further comprises a buffer to temporarily store user data. The data storage device further comprises a controller to scan each write command in the user data to be transferred for protocol commands or malicious data. The controller also stops the data transfer of user data from the buffer to the non-volatile storage medium if at least one of protocol commands or malicious data is detected in at least one write command.

Abstract: The present disclosure relates to utilizing a buffer management system to efficiently manage and deallocate memory buffers utilized by multiple processing roles on computer hardware devices. For example, the buffer management system utilizes distributed decentralized memory buffer monitoring in connection with augmented buffer pointers to deallocate memory buffers accurately and efficiently. In this manner, the buffer management system provides an efficient approach for multiple processing roles to consume source data stored in a memory buffer and to deallocate the buffer only after all roles have finished using it.

Abstract: In a memory system in an embodiment, in a case of normal operation, a control unit returns a write completion response upon completion of reception of write data from a host, and writes the write data into nonvolatile memory in a multiple values. In a case of unordinary power-off, changeover to operation using a backup battery is conducted and the control unit writes dirty data that is not completed in writing into the nonvolatile memory, into the nonvolatile memory with two values. When next boot, the control unit reads the dirty data from the nonvolatile memory into the volatile memory, and thereafter writes the dirty data into the nonvolatile memory in a multiple values.

Abstract: In a storage system, processing related to data replication includes associating first control information with a logical volume and a snapshot and second control information with data on a pool volume. Data of the logical volume and the snapshot is managed by associating the first control information with the second control information. A time series of the logical volume and one or more snapshots is managed using generation information associated with the first control information, for each piece of data on the pool volume. Generation information indicating a generation in which the data is created is managed in association with the second control information. Invalidation of the first and second control information asynchronously with a processing of data related to the logical volume and the snapshot is executed. Whether the invalidation is possible is determined by referring to the generation information associated with the first and second control information.

Abstract: A storage system determines a change in storage system geometry that affects at least one previously formed resiliency group of storage system resources. The storage system forms at least one resiliency group of storage system resources in accordance with rules that emphasize stability of formation of resiliency groups. The storage system accesses data stripes across storage system resources of resiliency groups.

Abstract: The present disclosure provides a method and apparatus for writing data in an append mode, a device and a storage medium. The present disclosure relates to the field of cloud storage technology, and can be applied to a cloud platform. The method includes: acquiring to-be-written data, and writing the to-be-written data into a magnetic disk; writing first index information of the to-be-written data in a memory; storing, in response to determining that the number of pieces of second index information is greater than a first preset threshold, the second index information into storage hardware, the second index information including the first index information; and writing first identifier information corresponding to the second index information in the memory.

Abstract: A system can identify a group of time-series telemetry data that represents performance metrics of computing devices, wherein the group of time-series telemetry data is represented according to a first number of dimensions. The system can compress the group of time-series telemetry data, wherein the compressed group of time-series telemetry data is represented according to a second number of dimensions that is less than the first number of dimensions, wherein the compressed group of time-series telemetry data is homomorphic. The system can perform a data science operation on the compressed group of time-series telemetry data to produce a first result, wherein the first result is within a predetermined threshold value of a second result of performing the data science operation on the group of time-series telemetry data.

Abstract: Described are techniques for managing data locations of derived storage objects. The techniques include accessing a primary metadata tree providing a lookup path using a virtual address to locate data for a primary object in physical storage pointed to by a leaf node of the primary metadata tree and providing a sub-tree from a leaf node of the primary metadata tree associated with the primary object, the sub-tree providing lookup paths using virtual addresses for derived objects. Wherein a derived object is a view of the primary object at a specific point in time, with copy leaf nodes of the sub-tree pointing to stored data of the derived objects. The techniques further include maintaining an ancestry graph associated with the sub-tree with the ancestry graph linking derived object identifiers to provide an ancestral chain lookup to identify derived object identifiers of the closest stored physical data of a derived object.

Abstract: In a particular embodiment, a virtual namespace identifier is mapped to one or more volumes stored among a pool of storage resources, wherein at least a first storage system and a second storage system are utilized to provide the storage resources. The virtual namespace identifier is migrated among the pool of storage resources to virtualize a data path for the one or more volumes.

Abstract: Examples described herein relate to migrating a virtualized execution environment from a first platform to a second platform while retaining use of namespace identifiers and permitting issuance of storage transactions by the virtualized execution environment. The first platform can include a first central processing unit or a first network interface. The second platform can include a central processing unit that is different that the first central processing unit and a network interface that is the same or different than the first network interface. The second platform can retain access permissions and target media format independent of one or more identifiers associated with the migrated virtualized execution environment at the second platform. Unperformed storage transactions can be migrated to the second platform for execution.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to reduce read-modify-write cycles for non-aligned writes. An example apparatus includes a memory that includes a plurality of memory banks, an interface configured to be coupled to a central processing unit, the interface to obtain a write operation from the central processing unit, wherein the write operation is to write a subset of the plurality of memory banks, and bank processing logic coupled to the interface and to the memory, the bank processing logic to determine the subset of the plurality of memory banks to write based on the write operation, and determine whether to cause a read operation to be performed in response to the write operation based on whether a number of addresses in the subset of the plurality of memory banks to write satisfies a threshold.

Abstract: A method comprising receiving a plurality of signatures representing one or more proprietary files from a vendor generated without disclosure of the proprietary files, each signature corresponding to a segment of a proprietary file. The method further comprising and validating each of the plurality of the signatures, to ensure that the signatures are the proprietary code of the vendor. The method further comprises adding the plurality of the signatures to a global database, the global database used to compare the proprietary data of the vendor to other technology data and taking various action based on the results of the comparison.

Abstract: An object compression system of a storage service may provide a user-friendly and cost-efficient solution to manage stored objects for users of the storage service. The object compression system may automatically monitor individual objects in an object-based storage system of the storage service. Based on one or more characteristics and additional features of the objects, the object compression system may generate respective determinations whether to compress the individual objects. Responsive to determinations to compress the objects, the object compression system may determine compression algorithms for individual objects. The object compression system may compress the objects according to respective compression algorithms to create compressed files. The object compression system may store the compressed files in a tier different from the objects and delete the objects from the storage service.

Abstract: A system for storing multiple petabytes of raw log data from cloud-based source data buckets into internal partitioned data storage in a data lake is provided. The system is configured to: deploy a log partitioner cluster comprising a plurality of log partitioner service instances for storing the raw log data in a partitioned manner; associate one or more of the source data buckets to each of a plurality of deployed log partitioner service instances by providing associated configuration metadata from a configuration service; fetch, via the log partitioner cluster, raw log data from associated source data buckets based on the associated configuration metadata, wherein the associated configuration metadata provides instructions for use by a log partitioner service instance to onboard raw log data; and place fetched raw log data, via the log partitioner cluster, in the internal partitioned log storage in accordance with the associated configuration metadata.

Abstract: An illustrative method includes receiving a request to create a storage volume; identifying, based on the request and on a configuration file propagated among a plurality of storage nodes in a cluster, status indicators of the storage nodes; identifying, based on the request, a size of the storage volume; identifying, based on the request, a replication factor representing a number of storage nodes that are to be replicated within a cluster for the storage volume; identifying, based on one or more characteristics associated with the storage volume, a traffic priority for the storage volume, the traffic priority representing a hierarchy that determines and prioritizes which traffic is allocated to available hardware and network resources in a particular order; creating, based on the status indicators, the size, the replication factor, and the traffic priority, the storage volume on one or more of the plurality of storage nodes.

Abstract: System, method, and circuitry for generating content for a programmable computing device based on user-selected memory regions. Contiguous regions that share memory access attributes are merged, interleaved contiguous regions that share at least one nested attribute are defined into combined regions, and remaining regions are defined as separate independent regions. A memory protection unit (MPU) region size closest to a size of each defined region is identified. If the start address of each region aligns with the address structure of the MPU region size, then those regions are assigned to MPU regions having the MPU region size; otherwise, another MPU size that aligns with the size of the regions is selected and those regions are assigned to MPU regions having that size. Content is generated to configure settings of MPU regions of the programmable computing device for the merged contiguous regions, the combined region, and the independent regions.

Abstract: A read-disturb-based logical storage read temperature information maintenance system includes a global read temperature identification subsystem coupled to storage device(s). Each storage device identifies, from a physical block in that storage device, current read disturb information associated with a row provided by the physical block in that storage device, and maps the current read disturb information to logical storage element(s) included in a logical-to-physical storage element mapping for that storage device along with previous read disturb information that was previously mapped to those logical storage element(s) included in the logical-to-physical storage element mapping for that storage device.

Abstract: A read-disturb-based read temperature adjustment system includes a read temperature adjustment subsystem that is coupled to the storage device. The read temperature adjustment subsystem identifies data that is stored in a block in the storage device and that is associated with a read temperature that is based on read disturb information associated with the block, determines a read temperature adjustment level for the data based on one or more data characteristics of the data and, based on the read temperature adjustment level, transmits a read temperature adjustment instruction to the storage device that causes the storage device to adjust the read temperature associated with the data.

Abstract: A method for recovering files from a filesystem stored across sparse files in a cloud environment is described. According to the method, a data management system may receive a request to read the files. The data management system may identify one or more target address ranges corresponding to the files indicated via the request. The data management system may read index information for the sparse files in the cloud environment. The index information may indicate respective address ranges for data blocks within the sparse files. The data management system may identify one or more data blocks within one or more sparse files as corresponding to address ranges that overlap with the one or more target address ranges based on the index information. The data management system may transmit, to the cloud environment, one or more read requests for the identified one or more data blocks.

Abstract: A first type memory and a second type memory may be identified in a computing system. The second type memory is slower than the first type memory while having a greater storage capacity compared to the first type memory. An application process executing in the computing system may be identified. A region of the first type memory may be provided as a cache of the second type memory for the application process.

Abstract: Adjusting storage capacity in a computing system that includes a computing device configured to send access requests to a storage device characterized by a first storage capacity, including: reducing data; determining, in dependence upon an amount of storage capacity saved by reducing the data, an updated storage capacity for the storage device; and exporting an updated storage capacity to the computing device.

Abstract: An archiving apparatus that realizes high-speed seek processes and the like by setting a logical object table for each container file with a predetermined size, and closing the container file under a predetermined condition is provided. A data processing section that executes control of access to a recording medium generates a logical object table for managing a container file including logical objects which are recorded data units, and records the logical object table on a memory. In a case where a prescribed condition is satisfied, for example, the container file size has become equal to or larger than a prescribed end reference value, and so on, while a process on the container file is being executed, the logical object table is read out from the memory, and recorded on the recording medium, and the container file is closed.

Abstract: A method and apparatus for controlling startup of a hard disk drive system, and a storage device. The hard disk drive system includes two or more hard disk drives. The method for controlling startup of a hard disk drive system includes: latching the initialization states of all the hard disk drives after all hard disk drives are powered on; dividing all hard disk drives into two or more hard drive groups, each hard drive group includes more than one hard disk drive; sequentially perform link initialization negotiation on each hard drive group by using a port protocol; and in an OOB negotiation process of the link initialization negotiation, by setting the state of an SCSI application layer power state machine, control a motor of each hard disk drive in the hard drive group to enter a spinning state.

Abstract: Techniques for extending a storage system having a first pool involve adding, in response to a request, second storage devices, wherein the first pool is generated using first storage devices and based on a first standard. The first pool includes first stripes created using the first standard, and the number of the second storage devices equals a first stripe width associated with the first standard. Such techniques further involve creating a second pool using the second storage devices and based on a second standard, wherein a second stripe width associated with the second standard equals the first stripe width. Such techniques further involve creating second stripes in the second pool using the second storage devices and based on the second standard. Such techniques further involve storing data of at least one of the first stripes to a corresponding stripe of the second stripes according to a data shuffle rule.

Abstract: The processor system includes a processor coupled to a memory having a plurality of memory banks and a region configurable as a heap region. At least one memory bank is allocated to the heap region dependent on a predetermined memory size required for execution of at least one cryptographic operation. At least one further memory bank is allocated to the heap region. The processor system may switch between first and second operating states. The first operating state has a lower power consumption than the second operating state. The processor system switches between a first and second operating mode by setting at least one memory bank and at least one further memory bank to an active state. The processor system switches between the second and first operating mode by setting at least one memory bank to a retention state and the at least one further memory bank to a power-down state.

Abstract: A method for dynamically assigning memory bandwidth to multiple processor units, which are connected via a data connection to a shared memory unit. In an initialization phase, each of the multiple processor units are assigned an initial value of a usable memory bandwidth, and a permissible range for a mean usage of the memory bandwidth is determined. Subsequently, the assigned memory bandwidths are checked repeatedly and adjusted if needed, a present value of a mean usage of the memory bandwidth by the multiple processor units being determined, and, if this present value is outside the permissible range, the values of the usable memory bandwidth are adjusted for at least a part of the multiple processor units.

Abstract: Storage volumes are pre-provisioned in the operating system of a storage system before they are required to be assigned to an emulation on the storage system. Details of the previously created storage volumes are stored in a management database. If a storage volume is required, the process that needs the storage volume obtains details about a pre-provisioned storage volume from the management database, and instructs the storage system operating system to add the storage volume to a storage group for the process. By pre-provisioning storage volumes in the operating system, it is possible to greatly reduce the amount of time it takes to add storage volumes to processes. The number of storage volumes to be pre-created can be determined based on a regression between the previous storage volume usage and time, and a deterministically obtained value of a number of filesystems that will be created in an upcoming time interval.

Abstract: A SD Card including, in one implementation, a memory array, a controller coupled to the memory array, and a bus for transferring data between the memory array and a host device in communication with the SD Card. The controller is configured to perform background maintenance operations on the memory array during execution of a read command received from the host device.

Abstract: A method for execution by a storage unit in a dispersed storage network (DSN) includes selecting a storage zone of a memory device of the storage unit based on zone allocation parameters, and designating the selected storage zone as open for writes. A data slice is received via a network for storage. The data slice is written sequentially at a memory location of the one of storage zone based on determining that the storage zone is designated as open for writes. A pointer corresponding to the data slice that indicates the storage zone and the memory location is generated. A read request is received via the network from a requesting entity that indicates the data slice. The data slice is retrieved from the memory device based on the pointer, and is transmitted to the requesting entity.

Abstract: A log generated over a time period of garbage collection cycles of a microservice is reviewed. The log includes garbage collection events and pause times for each event. A determination is made that a threshold number of consecutive garbage collection events has been reached where each consecutive event had a pause time exceeding a threshold pause time. Upon the determination, a change is made to a configuration file associated with the microservice to reduce the pause times for a next time period. Once the microservice enters an idle state, a command is generated to restart the microservice for the change in the configuration file to take effect.

Abstract: An approach is described to provide a method, a computer program product, and a computer system to implement hole punching. The described approach provides an automated way to free up space without requiring manual intervention by a DBA to manually reorganize database objects to free up space.

Abstract: Integrated circuits that perform offset-based memory management using offset values for allocated, de-allocated, and free memory portions. An example method includes receiving a first request for allocating a first portion of a memory module coupled to an integrated circuit, and determining a first address space for allocating the first portion of the memory module based on one or more offset values.

Abstract: The present invention facilitates efficient and effective utilization of unified virtual addresses across multiple components. In one embodiment, the presented new approach or solution uses Operating System (OS) allocation on the central processing unit (CPU) combined with graphics processing unit (GPU) driver mappings to provide a unified virtual address (VA) across both GPU and CPU. The new approach helps ensure that a GPU VA pointer does not collide with a CPU pointer provided by OS CPU allocation (e.g., like one returned by “malloc” C runtime API, etc.).

Abstract: An apparatus comprises a processing device configured to classify an input/output pattern of a given storage object that is stored utilizing a first type of storage resources associated with a first storage tier in the clustered storage system, and to identify, for the classified input/output pattern, a performance difference between utilizing first and second types of storage resources associated with first and second storage tiers in the clustered storage system. The processing device is further configured to determine, based at least in part on the identified performance difference, whether to move the given storage object from the first type of storage resources associated with the first storage tier to the second type of storage resources associated with the second storage tier in the clustered storage system and to move, responsive to the determination, the given storage object to the second type of storage resources associated with the second storage tier.

Abstract: According to one embodiment, a controller constructs a plurality of block groups. The plurality of block groups include at least a first block group configured using a first type block group and a second block group configured using a second block group. The first type block group includes a plurality of non-defective blocks obtained by selecting one or more non-defective blocks in an equal number from each of a plurality of dies or each of a plurality of planes. The second type block group includes a plurality of non-defective blocks. The number of non-defective blocks included in the second type block group is equal to the number of non-defective blocks included in the first type block.

Abstract: A method is used in managing storage space in storage systems. Storage space reserved by a storage object from a set of storage tiers is evaluated. A data storage system includes the first and second storage tiers configured such that performance characteristics associated with the first storage tier is different from the second storage tier. Based on the evaluation, storage space available and consumed in each storage tier of the set of storage tiers is determined.

Abstract: According to some embodiments, a system, method and non-transitory, computer readable medium are provided comprising a memory storing processor-executable program code; and a processing unit to cause the system to: receive a range of persistent volume disk size values from a cloud service provider; receive a value for an upper bound of a number of persistent volume disks attachable to a virtual machine per the cloud service; determine a number of persistent volume disks based on the upper bound, wherein the number is at least two; generate a plurality of configurations of the determined number of persistent volume disks, wherein a configuration is provided for each persistent volume disk size value, and each configuration divides the persistent volume disk size value between two or more persistent volume disks; and aggregate the generated plurality of configurations in a decision table. Numerous other aspects are provided.

Abstract: Systems and methods for quality of service management are provided. According to one embodiment, a non-transitory computer-readable medium comprises instructions that when executed by the processing resource cause the processing resource to collect, from a plurality of volumes on a per-volume basis, one or more real-time performance metrics for one or more compute processes executing on the one or more computer systems, generate an inertial parameter for one or more volumes in the plurality of volumes, and generate an instruction that cause a processor to use the real-time performance metrics and the inertial parameter to determine whether to transfer responsibility for a compute process on a first storage server node to a second storage server node.

Abstract: Methods, apparatus, and processor-readable storage media for determining storage system configuration recommendations based on vertical sectors and size parameters using machine learning techniques are provided herein.