Abstract: A method is used in managing cache systems of storage systems. Information is gathered from a storage system to determine an estimated amount of time required to flush data of a nonvolatile cache of the storage system to storage devices. The data cached in the nonvolatile cache is associated with a set of logical objects configured to cache the data in the nonvolatile cache. Based on the information gathered from the storage system, the estimated amount of time required to flush the data of the nonvolatile cache is determined.

Abstract: Apparatus, method and systems are provided such as those that can include a processor module, an interface device disposed above or below the processor module, the interface device including a plurality of routing elements, at least one memory device disposed above or below the interface device and including a plurality of memory arrays, the plurality of memory arrays coupled to the interface device using a plurality of interconnects provided in vias provided in at least one of the memory device and the interface device. In addition, the interface device communicatively can couple the plurality of memory arrays to the processor module using the plurality of routing elements and the interconnects.

Abstract: Systems and methods are disclosed for reducing bandwidth during the transmission of data between first and second devices over a network. One method includes: receiving a first data request from the first device; generating a first request identifier associated with the first data request; transmitting to the first device a response to the first data request and the first request identifier associated with the first data request; receiving, from the first device, a partial second data request, the partial second data request including the first request identifier associated with the first data request, and a differential between the first data request and the second data request; and constructing, at the second device, a full second data request, based on a comparison between the first data request, fetched using the first request identifier, and the received differential between the first data request and the second data request.

Abstract: Provided are a computer implemented method, computer program product, and system for creating a consistency group. For each source volume that has an instant virtual copy relationship with a target volume, an indicator for the source volume is set to true in a Fast Incremental with Freeze (FIF) map. The consistency group for each source volume whose indicator is set to true in the FIF map and each associated target volume is created by: performing a quick Instant Virtual Copy (IVC) freeze command to freeze each source volume whose indicator is set to true in the FIF map and performing a consistency group created command to thaw each source volume whose indicator is set to true in the FIF map.

Abstract: A method, non-transitory computer readable medium and device for seamless storage import includes importing file system structure entries stored in one or more storage devices. A request for an operation on one of the entries in the one or more storage devices is obtained during the importing. An import status of the requested one of the entries is determined. The obtained request is processed based on the determined import status of the requested one of the entries without interrupting the importing. The requested one of the entries is updated with the storage management computing device based on the processing. An aggregation of the imported entries with the updating of the requested one of the entries is stored.

Abstract: Embodiments of the present invention provide a wear-leveling method, a storage device, and an information system, where a storage region is divided into a plurality of storage sub-regions of the same size. The method includes: recording the accumulated number of write operations of each storage sub-region; and when the accumulated number of write operations of any one storage sub-region of the plurality of storage sub-regions reaches a predetermined remapping rate, mapping a logical address of the storage sub-region to a remapping physical address. With the wear-leveling method, the storage device, and the information system in the embodiments of the present invention, a logical address of a local data block on which too many write operations are performed may be evenly mapped to an overall physical storage region, thereby avoiding that local data is too hot and prolonging a service life of a storage medium.

Abstract: Computer-implemented systems and associated operating methods implement a fast join for databases which is adapted for usage with flash storage. A system comprises a processor that performs a join of two tables stored in a storage in pages processed in a column orientation wherein column values for all rows on a page are co-located in mini-pages within the page. The processor reduces input/output operations of the join by accessing only join columns and mini-pages containing join results.

Abstract: Responsive to selecting a particular queue from among at least two queues to place an incoming event into within a particular entry from among multiple entries ordered upon arrival of the particular queue each comprising a separate collision vector, a memory address for the incoming event is compared with each queued memory address for each queued event in the other entries in the at least one other queue. Responsive to the memory address for the incoming event matching at least one particular queued memory address for at least one particular queued event in the at least one other queue, at least one particular bit is set in a particular collision vector for the particular entry in at least one bit position from among the bits corresponding with at least one row entry position of the at least one particular queued memory address within the other entries.

Abstract: According to one embodiment, a controller for a storage apparatus is disclosed having interfaces connectable to a host system, a first storage apparatus and a second storage apparatus. A data in the first storage apparatus and a data in the second storage apparatus are duplicates. A status table stores the operating state regarding the first storage apparatus and the second storage apparatus, wherein the operating state indicates among writing, reading, or standing by. A monitor monitors the interfaces and set up the operating state into the status table. A buffer memory buffers the data for writing in the first storage apparatus and the second storage apparatus. A command response unit receives the data for writing and write-in request from a host system, and directs the writing of the data to the first storage apparatus and the second storage apparatus while making the buffer memory buffer the received data.

Abstract: Some embodiments are directed to replicating a content unit stored in a first storage environment comprising a first plurality of storage clusters to a second storage environment comprising a second plurality of storage clusters. The first storage environment may employ a replication policy, instituted at a first time, that specifies to which one of the second plurality of storage clusters content units stored in the first storage environment are to be replicated. The creation time of the first content unit may be determined and it may be determined when the creation time is before the time at which the first storage environment instituted the replication policy. If the creation time is not before the first time, one of the second plurality of storage clusters may be selected to which to replicate the first content unit based on the replication policy, and the content unit may be replicated to the selected one of the second plurality of storage clusters.

Abstract: A method and apparatus for performing file-level restoration from a block-based backup file stored on a sequential storage device is described. In one embodiment, a method of processing a backup file to perform file-level restoration from a sequential storage device comprises generating extent information, wherein the extent information pertains to at least one file system object associated with a backup file, wherein the backup file is to be stored on a sequential storage device, wherein the backup file is block-based and processing a backup catalog, wherein the backup catalog indicates locations of various portions of the extent information and is used to restore a file system object.

Abstract: When a request is made to retrieve a guest physical page from memory and a page fault occurs, a guest virtual page address that corresponds to the guest physical page is identified along with addresses for guest virtual pages that are near the guest virtual page in the virtual address space. Each identified guest virtual page address is translated into a corresponding guest physical page address and the corresponding guest physical pages are loaded into memory.

Abstract: A system and method of controlling a flash memory device such as a NAND memory device may involve receiving a command to execute an operation. A Ready/Busy contact of the memory device may be pulsed low in response to determining that execution of the operation has completed.

Abstract: One embodiment of the invention provides a method and apparatus for decompressing a compressed data set using a processing device having a plurality of processing units and a tangible, non-transitory shared memory. The compressed data set comprises a plurality of compressed data segments, in which each compressed data segment corresponds to a predetermined size of uncompressed data. The method includes loading the compressed data set into the shared memory so that each compressed data segment is stored into a respective memory region of the shared memory. The respective memory region has a size equal to the predetermined size of the corresponding uncompressed data segment. The method further includes decompressing the compressed data segments with the processing units; and storing each decompressed data segment back to its respective memory region within the shared memory.

Abstract: The present disclosure discloses a method, a system and a server of removing a distributed caching object. In one embodiment, the method receives a removal request, where the removal request includes an identifier of an object. The method may further apply consistent Hashing to the identifier of the object to obtain a Hash result value of the identifier, locates a corresponding cache server based on the Hash result value and renders the corresponding cache server to be a present cache server. In some embodiments, the method determines whether the present cache server is in an active status and has an active period greater than an expiration period associated with the object. Additionally, in response to determining that the present cache server is in an active status and has an active period greater than the expiration period associated with the object, the method removes the object from the present cache server.

Abstract: Responsive to selecting a particular queue from among at least two queues to place an incoming event into within a particular entry from among multiple entries ordered upon arrival of the particular queue each comprising a separate collision vector, a memory address for the incoming event is compared with each queued memory address for each queued event in the other entries in the at least one other queue. Responsive to the memory address for the incoming event matching at least one particular queued memory address for at least one particular queued event in the at least one other queue, at least one particular bit is set in a particular collision vector for the particular entry in at least one bit position from among the bits corresponding with at least one row entry position of the at least one particular queued memory address within the other entries.

Abstract: A method is used in enhancing memory buffering by using secondary storage. A buffer cache pool is supplemented with a secondary storage. A portion of a volatile memory of a data storage system is reserved as the buffer cache pool. The buffer cache pool includes a set of buffer cache objects for storing file system data and metadata. The secondary storage includes a set of data blocks. A first buffer cache object of the set of buffer cache objects is aged out by copying contents of the buffer cache object to a data block of the secondary storage. Contents of the first buffer cache object are retrieved from the secondary storage by copying contents of the data block of the secondary storage to a second buffer cache object of the set of buffer cache objects of the buffer cache pool.

Abstract: Described herein is a system and method for maintaining cache coherency. The system and method may maintain coherency for a cache memory that is coupled to a plurality of primary storage devices. The system and method may write data to the cache memory and associate the data with a cache generation identification (ID). A different cache generation ID may be associated with each new set of data that is written to the cache memory. The cache generation ID may be written to the primary storage devices. A backup restore operation may be performed on one of the primary storage devices and a backup restore notification may be received. In response to the notification, the system and method may compare the cache generation ID with the generation ID stored on the restored primary storage device and invalidate data stored on the cache memory for the restored primary storage device.

Abstract: The disclosure is directed to a weakly-ordered processing system and method for enforcing strongly-ordered memory access requests in a weakly-ordered processing system. The processing system includes a plurality of memory devices and a plurality of processors. Each of the processors are configured to generate memory access requests to one or more of the memory devices, with each of the memory access requests having an attribute that can be asserted to indicate a strongly-ordered request. The processing system further includes a bus interconnect configured to interface the processors to the memory devices, the bus interconnect being further configured to enforce ordering constraints on the memory access requests based on the attributes.

Abstract: Responsive to selecting a particular queue from among at least two queues to place an incoming event into within a particular entry from among multiple entries ordered upon arrival of the particular queue each comprising a separate collision vector, a memory address for the incoming event is compared with each queued memory address for each queued event in the other entries in the at least one other queue. Responsive to the memory address for the incoming event matching at least one particular queued memory address for at least one particular queued event in the at least one other queue, at least one particular bit is set in a particular collision vector for the particular entry in at least one bit position from among the bits corresponding with at least one row entry position of the at least one particular queued memory address within the other entries.