Abstract: Provided are a computer program product, system, and method for invalidating track format information for tracks in cache. Demoted tracks demoted from the cache are indicated in a demoted track list. Track format information is saved for the demoted tracks. The track format information indicates a layout of data in the demoted tracks, wherein the track format information for the demoted tracks is used when the demoted tracks are staged back into the cache. An operation is initiated to invalidate a metadata track of the metadata tracks in the storage. Demoted tracks indicated in the demoted track list having metadata in the metadata track to invalidate are removed. The track format information for the demoted tracks having metadata in the metadata track to invalidate is removed.

Abstract: A storage system according to an aspect of the present invention includes one or more storage devices for storing write data to which a write request from a host computer is directed, and a storage controller that provides one or more volumes to the host computer. Further, the storage system manages the time when a write request is last received from the host computer for each partition within the volume. Then, the storage controller performs a deduplication process upon detecting the partition not receiving a write request for a predetermined time or more from the time when the write request is last received.

Abstract: A mechanism is provided in a data processing system comprising at least one processor and at least one memory, the at least one memory comprising instructions which are executed by the at least one processor and configure the processor to implement a file system consistency check utility on an erasure coded object storage architecture. Responsive to the file system consistency check utility determining a directory entry does not exist for a given file inode, the mechanism determines whether the given file is part of an erasure code schema of an object storage architecture. Responsive to the file system consistency check utility determining the given file/fragment is part of the erasure code schema, the mechanism determines a container (parent directory) for the given erasure code fragment, wherein the given fragment is a given error code fragment of an object, based on other erasure code fragments corresponding to the object and their placement schematics in the erasure code schema.

Abstract: The present disclosure generally relates to prefetching data from one or more CPUs prior to the data being requested by a host device. The prefetched data is prefetched from memory and stored in cache. If a host device requests data that is not already in cache, then a determination is made regarding whether the data is scheduled to be written into cache. If the data is not in cache and is not scheduled to be written into cache, then the data is retrieved from memory and delivered to the host device. If the data is scheduled to be written into cache, or is currently being written into cache, then the request to retrieve the data is delayed or scheduled to retrieve the data once the data is in cache. If the data is already in cache, the data is delivered to the host device.

Abstract: Technologies for an operating system identifying SSD and CSSD devices based on a corresponding descriptor, and for optimizing operating system functionalities with respect to the SSD/CSSD device. Optimizations include disabling non-SSD/CSSD functionalities, such as HDD defragmentation, and by enabling SSD/CSSD specific functionalities, such as write optimization storage functionalities.

Abstract: Operating a data storage system comprising a plurality of disk drives and a storage controller connected to the disk drives. A first subset and a second subset of the plurality of disk drives are operated as short stroked disk drives and non-short stroked disk drives, respectively. Priority storage spaces are defined including a high priority storage space, a moderate priority storage space, and a low priority storage space. Data is received including associated access rates for each portion of the data. One of the priority storage spaces is identified to store a portion of the data, based on the access rates for each portion of the data. Data accessed most frequently is stored in the high priority storage space, data accessed least frequently is stored in the low priority storage space, and the remaining data is stored in the moderate priority storage space.

Abstract: Systems and methods for actively securing data storage devices utilize the technique of storage virtualization. In embodiments, would-be cyberattackers are presented with many possible “ports” or “channels” by which to communicate over a network with a data storage device. Unknown to the attacker, at any given time, only one of these ports or channels is the “correct,” or “active,” port; all of the other ports are dummies that do not permit communication with the storage device. The active port is dynamically, randomly, and/or continually reconfigured, seriously impeding the ability of the attacker to access the data storage device through the active port.

Abstract: A method, computer program product, and a computer system, to store information related to changed data in response to a transaction with a first database of the on-line system requested during a planned period and data in the first database changed by the transaction. In response to a planned event a back-up system with a second database is switched to set up a new connection and a new transaction with the second database, wherein the second database is backup of the first database. The on-line system prevents setting up a new connection to the on-line system and prevents conducting a new transaction with the first database, sends information related to the changed data from the on-line system to the back-up system, and switches to the back-up system for a new connection and for a new transaction. The on-line system synchronizes data between the first database and the second database.

Abstract: The invention provides a hot plug method and device for a byte-addressable persistent memory, which includes hot-add and hot-remove; wherein the hot-add includes physical add and logical add, and the hot-remove includes logical remove and physical remove; the physical add is used for converting the memory from an uncharged raw media into a manageable block of an operating system; the logical add is used for converting the memory from the manageable block of the operating system into a memory device which capable of mapping a virtual address; the logical remove is used for converting the memory device which capable of mapping the virtual address into the manageable block of the operating system; and the physical remove is used for converting the memory from the manageable block of the operating system into the uncharged raw media.

Abstract: A data storage system includes: a plurality of data storage devices for storing a plurality of objects of a key-value pair; and a virtual storage layer that applies different data reliability schemes including a data replication scheme and an erasure coding scheme based on a size of an object of the plurality of objects. The plurality of objects includes a first object having a first size and a second object having a second size that is larger than the first size. The virtual storage layer classifies the first object as a small object, applies the data replication scheme, and stores the small object across one or more of the plurality of data storage devices. The virtual storage layer classifies the second object as a huge object, splits the huge object into one or more chunks of a same size, applies the erasure encoding scheme, and distributedly stores the one or more chunks across the plurality of data storage devices.

Abstract: According to one embodiment, a memory system comprises a non-volatile semiconductor memory, a memory and a controller. The memory stores a management table including a plurality of parameters for managing the non-volatile semiconductor memory. The controller is configured to control the operation of the non-volatile semiconductor memory based on a first value of the parameters contained in the management table. The controller obtains a second value corresponding to the parameters from an operation log of the non-volatile semiconductor memory, compares the second value of the parameters with the first value, calculates the difference between the second value of the parameters and the first value when they are different from each other, calculates a correction value for correcting the first value when the difference is greater than a third value, and updates the first value of the management table based on the correction value.

Abstract: Systems and methods for actively securing data storage devices utilize the technique of storage virtualization. In embodiments, would-be cyberattackers are presented with many possible “ports” or “channels” by which to communicate over a network with a data storage device. Unknown to the attacker, at any given time, only one of these ports or channels is the “correct,” or “active,” port; all of the other ports are dummies that do not permit communication with the storage device. The active port is dynamically, randomly, and/or continually reconfigured, seriously impeding the ability of the attacker to access the data storage device through the active port.

Abstract: Disclosed herein are systems, methods, and processes to perform replication between heterogeneous storage systems. Information associated with a backup stream is recorded during a backup operation by a source server and includes instructions. The instructions include an include instruction to include existing data and a write instruction to write new data during a replication operation. A request to perform the replication operation is received. In response to the request, the information is sent to a target server as part of performing the replication operation.

Abstract: Embodiments of the present disclosure relate to methods and apparatuses for data copy. A method comprises receiving, from a client module in a first processing unit, a read request for reading data from a first storage region. The method further comprises, in response to determining from the read request that the data is to be copied, obtaining, from a cache, a first bitmap associated with the first storage region, the first bitmap indicating if the first storage region is filled with zero. The method further comprises, in response to determining from the first bitmap that the first storage region is filled with zero, sending, to the client module, an indication that the data is zero.

Abstract: A method includes storing data and metadata related to the data in logical words in a non-volatile memory. For each logical word stored in the non-volatile memory, a corresponding error-correction code is generated. Each physical word stored contains a logical word and the corresponding error-correction code. The metadata may contain atomicity information. The non-volatile memory may be a flash memory. Each physical word may contain a parity bit based on the logical word and the corresponding error-correction code stored in the physical word. The logical words may be encoded into physical words including the corresponding error correction code using an encoding table. The data and the metadata may be split into logical words.

Abstract: A program optimization system is provided with a CNC simulator configured to sequentially read out a machining program and perform a machining simulation, a machining program storage unit configured to successively transfer the machining program to the CNC simulator, and a transfer speed control unit configured to control a transfer speed to be a predetermined lower limit value. The CNC simulator optimize the machining program when a state of buffering deficiency in which the machining program to be read out is insufficient is detected in a cutting section and create optimized machining program free from a buffering deficiency.

Abstract: One embodiment of the present invention provides a system for facilitating dynamic load-based merging. During operation, the system identifies incremental data in memory of a first computing device. The incremental data comprises update to reference data in a storage device in a second computing device. If the size of the incremental data becomes greater than a threshold, the system selects a first server group from a plurality of server groups. The second computing device belongs to this first server group. The system then migrates data access requests from the first server group to other server groups in the plurality of server groups and merges the incremental data from the memory of the first computing device to the storage device in the second computing device. The merging includes batch sequential disk writes to the storage device of the second computing device.

Abstract: There is disclosed herein techniques for managing data storage. In one exemplary embodiment, the techniques comprise generating one or more sets of storage devices. Each set is configured to be mutually exclusive with respect to other sets of the one or more sets such that storage devices within the same set provide the basis for the formation of a RAID (Redundant Arrays of Independent Disks) stripe. The techniques further comprise forming a RAID stripe from respective storage extents associated with different storage devices of the same set. The techniques further comprise mapping a storage object to the RAID stripe. The techniques further comprise servicing host I/O (Input/Output) operations directed to the storage object by using the RAID stripe mapped thereto.

Abstract: In one embodiment, a storage system receives a number of input/output (IO) request transactions at the storage system having multiple storage devices. For each of the plurality of IO request transactions, the system determines a number of child IO requests required to complete the IO request transaction. The system tags the IO request transaction and/or the associated child IO requests with a tag identifier. For each of the child requests that is a write IO request, the system determines an optimal write IO request size, segments the write IO request into a number of sub-IO write requests, each having an optimal request size, and interleaves sub-IO write requests with read IO requests for servicing to avoid impact in performance to read IO requests for a mixed IO workload.

Abstract: Disclosed are a method, a terminal, a device, and a computer readable storage medium for improving the performance of a virtual machine. The method includes determining whether a failure of a disk of a host having a virtual disk file stored therein occurs if a virtual machine sends a read request or a write request to the virtual disk file; sending the read or write request to a storage device which is associated with the host and has the virtual disk file stored therein if the failure occurs, so that the storage device is able to feed back data; detecting whether the disk of the host is recovered if the data fed back from the write request is received; and writing the data fed back from the write request into the disk of the host if the disk of the host is recovered.

Abstract: A data storage device includes a media cache and a main data store optimized for sequential reads and organized into bands. When the data storage device receives a read request from a host computing system, the requested data may be fragmented across the media cache and the main data store, causing constrained read throughput. Band rewrite operations to improve read throughput are selected based on a hit tracking list including a hit counter associated with each band on the main data store. The hit counter tracks the number of times a host computing system has requested data in logical block addresses corresponding to the various bands. The data storage device may select bands for band rewrite operations based on the number of hits in the associated hit tracking counters.

Abstract: A data management and storage (DMS) cluster of peer DMS nodes manages migration of an application between a primary compute infrastructure and a secondary compute infrastructure. The secondary compute infrastructure may be a failover environment for the primary compute infrastructure. Primary snapshots of virtual machines of the application in the primary compute infrastructure are generated, and provided to the secondary compute infrastructure. During a failover, the primary snapshots are deployed in the secondary compute infrastructure as virtual machines. Secondary snapshots of the virtual machines are generated, where the secondary snapshots are incremental snapshots of the primary snapshots. In failback, the secondary snapshots are provided to the primary compute infrastructure, where they are combined with the primary snapshots into construct a current state of the application, and the application is deployed in the current state by deploying virtual machines on the primary compute infrastructure.

Abstract: Systems, computer program products, and methods are described herein for a system to enable contactless access to a transaction terminal using a process data network. The present invention is configured to electronically receive from a transfer terminal, an indication that a user is accessing the transaction terminal using a user device; retrieve, from the user device, a unique identifier associated with the user device; compare the unique identifier with a block chain of authentication information associated with the user to determine whether the unique identifier meets a condition associated with the block chain authentication information; receive an indication that the unique identifier meets the condition of the block chain thereby validating user identity; and allow the user to access the transaction terminal based on at least receiving the indication that the unique identifier meets the condition of the block chain.

Abstract: One embodiment is related to a method for promoting or demoting data objects in a multi-tier storage system, comprising: creating one or more chunks to store data objects therein at a first tier of the multi-tier storage system, wherein data objects stored in each chunk are associated with a same lifecycle policy and an approximately same creation time; and moving one of the one or more chunks to a second tier in its entirety based on the lifecycle policy associated with the data objects stored in the moved chunk.

Abstract: There are disclosed herein techniques for use in acquiring data storage metrics. The techniques comprise monitoring an I/O operation relating to data storage. The techniques also comprise producing a metric value in connection with the I/O operation. The techniques also comprise determining a current metric value associated with a memory location in an operating system kernel. The techniques also comprise performing a computation to generate a new metric value. The computation is based on the metric value and the current metric value. The techniques further comprise storing the new metric value in the memory location in the operating system kernel.

Abstract: A method of operating a storage device including at least one nonvolatile storage and a storage controller configured to control the nonvolatile storage. A first type of request, original data and a first request information associated with the original data are received, in the storage controller, from an external host device, a compression operation to compress the original data to generate compressed data is performed in the storage controller, in response to the first type of request, and a write operation to write the compressed data in a data storage area of the nonvolatile storage is performed in the storage controller. The data storage area of the nonvolatile storage may store the first request information associated with the original data. The external host may manage mapping information in the form of a mapping table associated with compression/decompression at the storage device.

Abstract: A distributed file system includes metadata servers and data servers. The metadata server includes a selecting unit to select a data server from the data servers, a chunk allocation requesting unit to request that the selected data server perform chunk allocation, a chunk list managing unit to insert a list of chunks transmitted from the data server into a chunk list pool and determine an arrangement method of the chunk list pool, and a chunk fetching unit to fetch available chunk information from the chunk list pool. The data server includes a receiving unit to receive request for chunk allocation from the metadata server, a chunk allocating unit to allocate chunks in response to the request for chunk allocation and write a list of chunks based on information about the allocated chunk, and a transmitting unit to transmit the list of chunks to the metadata server.

Abstract: A system and method for provisioning a volume and repartitioning a provisioned volume based at least in part on a workload. A request to provision a volume of a specified size is received, a first set of partition options is determined based at least in part on the specified size, and second set of partition options is determined based at least in part on one or more performance characteristics. A volume partitioning is determined based at least in part on an intersection of a number of partitions between the first set of partition options and the second set of partition options, and further based at least in part on a set of optimization criteria. Based at least in part on tracked usage of the volume or a repartition request, a determination is made to repartition the volume such that the partitioning scheme fulfills a set of optimization criteria.

Abstract: A user can set or modify operational parameters of a data volume stored on a network-accessible storage device in a data center. For example, the user may be provided access to a data volume and may request a modification to the operational parameters of the data volume. Instead of modifying the existing data volume, the data center can provision a new data volume and migrate data stored on the existing data volume to the new data volume. While the data migration takes place, the existing data volume may block input/output (I/O) requests and the new data volume may handle such requests instead. Once the data migration is complete, the data center may deallocate the data blocks of the existing data volume such that the data blocks can be reused by other data volumes.

Abstract: A method begins by a dispersed storage (DS) processing module generating a set of messages regarding a set of encoded data slices. For a first message of the set of messages, the method continues with the DS processing module determining a first message priority based on system-level message processing information and message processing status of a first storage node. For a second message of the set of messages, the method continues with the DS processing module determining a second message priority based on the system-level message processing information and message processing status of a second storage node. The method continues with the DS processing module sending the first message of the set of messages to the first storage node in accordance with the first message priority and sending the second message of the set of messages to the second storage node in accordance with the second message priority.

Abstract: A storage system and data control method capable of extending the service lifes of storage devices of the same type and with different properties and reducing operation management cost are proposed. The storage system includes: a first storage device; a second storage device with a smaller upper limit number of writes and a larger storage capacity per unit area than those of the first storage device; and a processor that allocates storage areas from the first storage device and the second storage device to a virtual volume to be provided to a host, wherein the processor relocates data which is stored in a storage area with higher write frequency from the host than a predetermined write threshold, from among the storage areas allocated from the second storage device to the virtual volume, from the storage area of the second storage device to a storage area of the first storage device.

Abstract: A data storage service may operate one or more storage servers configured to maintain logical volumes on behalf of customers of the remote data storage service. The logical volumes may have various dimensions. The various dimensions may be used to generate an average volume. The average volume may then be used to execute a simulation of an amount of remaining storage capacity of the data storage service.

Abstract: Techniques to facilitate enhanced addressing of local and network resources from a computing system are provided herein. In one implementation, a method of operating an object-based memory management unit on a computing system to unify addressing of local and network resources includes maintaining a mapping of virtual addresses to local addresses and network addresses, and identifying resource requests that use the virtual addresses. The method further provides handling the resource requests per the mapping, and wherein a given request of the resource requests implicates a network resource, accessing the network resource associated with the given request over at least the network.

Abstract: A method for operating a memory device, in which a first memory region of the memory device can be written with blocks of data that are to be stored, including: storing of the data to be stored at a first target address, storing of the data to be stored at a second target address, the second target address differing from the first target address by a specifiable offset, and the specifiable offset being larger than 20 percent of the first memory region.

Abstract: A device controller and method are provided for performing a plurality of write transactions atomically within a non-volatile data storage device. Each transaction specifies a logical address and the method comprises creating an address translation map for the logical addresses specified by the plurality of write transactions, by referencing an address translation record within the non-volatile data storage device to determine for each logical address a corresponding physical address within the data storage device. Further, if the corresponding physical address indicated in the address translation record already contains valid data, the logical address is remapped to a new physical address in the address translation map. However, at this point the address translation record as stored in the data storage device is not updated. Instead, the plurality of write transactions are performed using the logical address to physical address mapping in the address translation map.

Abstract: According to one embodiment, a memory system receives a write request specifying a first logical address to which first data is to be written, and a length of the first data, from a host. The memory system writes the first data to a nonvolatile memory, and stores a first physical address indicating a physical storage location on the nonvolatile memory to which the first data is written, and the length of the first data, in an entry of a logical-to-physical address translation table corresponding to the first logical address. When the memory system receives a read request specifying the first logical address, the memory system acquires the first physical address and the length from the address translation table, and reads the first data from the nonvolatile memory.

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: The disclosed technology includes ranking entities in real-time to show the relative importance of those entities. The ranking is based on attributes of the entities that vary in real-time. An example of an entity is a process (e.g., an executing computer program) and the associated attributes can include the process' current CPU memory consumption. While the process runs, its CPU and memory consumption vary in real-time.

Abstract: Provided is a linking server that can easily link outputted data with another system. The linking server includes: a communication unit that is capable of communicating between a management server that collects one or more pieces of operating information from one or more image forming apparatus, and an external system that performs processing using the one or more pieces of operating information; a storage unit; an input/output unit that acquires the one or more pieces of operating information that is outputted from the management server, and stores that operating information in the storage unit; and a packaging unit that acquires the one or more pieces of operating information, generates compressed data by performing a compression process and a packaging process, and writes the generated compressed data back into the storage unit; wherein the input/output unit outputs the compressed data to the external system.

Abstract: A hardware monitor may receive information that identifies a requirement for a system. The requirement may be associated with operation of the system during a runtime operation of the system in an intended operating environment. The hardware monitor may program the one or more hardware components to analyze the system based on the requirement. The hardware monitor may receive a signal from the system during the runtime operation of the system in the intended operating environment. The hardware monitor may analyze the signal during the runtime operation of the system based on the requirement. The hardware monitor may determine, during the runtime operation of the system, that the requirement was violated during the runtime operation of the system based on analyzing the signal. The hardware monitor may output information indicating that the requirement was violated.

Abstract: A first storage node generates a plurality of distributedly arranged write data blocks from write data and generates a first redundant data block from the plurality of distributedly arranged write data blocks. One distributedly arranged write data block is arranged in a second data block and the first redundant data block is arranged in a third storage node. A second storage node generates a second redundant data block from the plurality of distributedly arranged write data blocks selected from the distributedly arranged write data block held therein. The second storage node rearranges each of the plurality of selected distributedly arranged write data blocks in a rearrangement destination storage node and arranges the second redundant data block in a storage node other than the rearrangement destination storage node.

Abstract: A bridge device includes: a first interface configured to receive a first set of commands from an application running on a host computer; one or more command processors, each of the one or more command processors being configured to translate the first set of commands and generate a second set of commands based on the first set of commands; a second interface configured to provide the second set of commands to a data storage device; and a computing processor configured to issue an internal command to fetch data from the data storage device and write data to the data storage device in a background mode in an agnostic manner to the host computer while running the application.

Abstract: A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be handled by retrieving first tree data from a first node in a hash tree that represents the file, the first tree data including a first hash tree depth, a first CAS signature, a block size and a file size. Based on the tree data, a second node is selected from a higher level in the hash tree. Second tree data from the second node of the hash tree that represents the file is retrieved, including a second CAS signature. The second CAS signature is determined to match a reserved CAS signature, and in response, an indication that the requested logical location is unallocated within the file is provided.

Abstract: Operating a RAID array with unequal stripes, the RAID array comprising N number of drives, where each RAID stripe includes P number of parity drives and N-P number of data drives, including buffering, by a RAID controller, write operations received from a host, each write operation specifying data to be written to the RAID array; distributing, by the RAID controller, the data to be written amongst N-P write groups, including: dividing the data into chunks of a sub-stripe size, wherein the sub-stripe size is less than a parity stripe size; and assigning the chunks, in round-robin order, to the N-P write groups; calculating parity from the N-P write groups; and writing the N-P write groups and the calculated parity as a first RAID stripe to the RAID array.

Abstract: A storage drive adapter may comprise an adapter board, which may include a first and second carrier module interface to removably engage with a first and a second storage drive carrier module, respectively. The adapter board may further include a dual ported storage drive connector to engage with a complementary storage drive bay interface. The dual ported storage drive connector may include a first port to provide a first signal path from the complementary storage drive bay interface to the first carrier module interface. Similarly, the dual ported storage drive connector may also include a second port to provide a second signal path from the complementary storage drive bay interface to the second carrier module interface.

Abstract: Based on a system configuration change (e.g., of a Decentralized, or Distributed, Agreement Protocol (DAP)) within a dispersed storage network (DSN), a computing device identifies a reallocating encoded data slice (EDS) number that is no more than a pillar width minus a performance threshold. The computing device then directs storage units (SUs) to update system configuration of the DAP (e.g., from a first to a second system configuration) by throttling and controlling the number of SUs permitted to update at a time. For example, the computing device permits no more than the reallocating EDS number of SUs to perform simultaneous (or substantially or approximately simultaneous) update of the system configuration of the DAP. The computing device also directs the SUs to operate based on the first system configuration before the condition(s) is/are met and then to operate based on the second system configuration after the condition (s) is/are met.

Abstract: A disclosed method is performed at a fault-tolerant object-based storage system configured to synthesize parity data in order to protect stored data from loss, the fault-tolerant object storage system including a plurality of storage entities each configured to store data on an object-basis. The method includes determining a first parity value for a first data block set of one or more data block sets, wherein the first data block set comprises one or more respective data blocks, each respective data block associated with a respective storage entity of the plurality of storage entities. The method further includes generating a first compressed parity indicator for the first data block set, corresponding to the first parity value, and storing the first compressed parity indicator in a stripe of parity data in place of the first parity value within a first block set comprising the first data block set.

Abstract: A mechanism for non-disruptive virtual tape libraries configuration. Specifically, the introduction of various additional computer processes permit the configuration of a virtual tape library without requiring the shutdown and re-initialization of the host application on which the virtual tape library resides.

Abstract: A computer system for securing computer files from modification may include a processor; at least a first data storage area operatively coupled to the processor; a non-volatile second data storage area; and a control circuit. The non-volatile second data storage area may be physically separate from the at least a first data storage area. The second data storage area may store files that are executable by the processor, including executable files of an operating system configured to save temporary files on the at least a first data storage area. The control circuit may operatively couple the second data storage area to the processor, and may be operable in at least a first mode in which the control circuit is configured to block commands received from the processor and configured to modify the second data storage area from being communicated to the second data storage area.

Abstract: Various systems and methods for performing a restore operation. For example, one method involves receiving information identifying a set of data objects to restore. The method also involves dividing the set of data objects into first and second subsets of data objects. After the first one of the subsets of data objects is restored from a backup computing system to a source computing system, the method involves determining whether a deduplication operation is performed on the source computing system. The method also involves delaying restoring the second subset until after the deduplication operation is performed on the source computing device.