Abstract: A request to perform a program operation at a memory device is received. An entry of a device block record stored at the memory device is determined to be removed based on parameters associated with the program operation and a firmware block record that corresponds to the device block record. The firmware block record tracks the entries of the device block record. The entries of the device block record are associated with blocks of the memory device and identify start voltages that are applied to wordlines of the blocks to program memory cells associated with the wordlines. A command is submitted to the memory device to remove the entry associated with a particular block from the device block record and to make a space available at the device block record for a new entry associated with a new block that is to be written in view of the program operation.

Abstract: A storage system includes a plurality of solid-state storage devices and a storage controller operatively coupled to the plurality of solid-state storage devices, the storage controller including a processing device, the processing device to receive, from a first solid-state storage device of the plurality of solid-state storage devices, an indication that data stored at the first solid-state storage device is affected by read disturb. In response to receiving the indication, the processing device is further to identify a second solid-state storage device of the plurality of solid-state storage devices for the relocation of the data and transmit, to the first solid-state storage device, a command comprising information associated with the relocation of the data from the first solid-state storage device to the second solid-state storage device, wherein the command causes the first solid-state storage device to relocate the data to the second solid-state storage device.

Abstract: Methods, systems, and computer-readable media for record-by-record live migration using segmentation are disclosed. Migration of a data set comprises, for a record in a segment being migrated, storing a first status indicating that the record is offline in a source data store. An instance of the record is stored in the destination data store, and a second status is stored to indicate that the record is online in the destination. The record is deleted from the source after the second status is stored. During the migration, a read request for the record is received and determined to be associated with the segment being migrated. A response to the read request is generated that comprises an authoritative instance of the record. The instance of the record in the destination is determined to represent the authoritative instance based (at least in part) on the first status and the second status.

Abstract: A method including invoking, via an application, a call of a command line utility; providing, via the application, an identifier in the call of the command line utility, where the identifier comprises an operating system controlled memory location; storing output from the command line utility in operating system shared memory at the operating system controlled memory location identified by the identifier; and retrieving, by the application, the command line utility output from the operating system shared memory at the operating system controlled memory location identified by the identifier.

Abstract: Scaling-in of a geographically diverse data storage system is disclosed. Data chunks stored in storage devices of different zones can be convolved to conserve memory. The zone storage system can be a geographically diverse storage system. Removing a zone from the geographically diverse data storage system can risk data loss without adequate replication of data from the zone to be removed. The zone to be removed can be placed in a ‘read-only’ state. Data chunks form the zone to be removed can be duplicated at other zones of the geographically diverse data storage system. A data chunk comprising convolved representations of data is duplicated to a zone in a manner that results in loss of geographical diversity, a corresponding chunk can be duplicated at another zone to restore geographical diversity. Validation of data can be performed prior to removal of a zone in a scaling-in event.

Abstract: An amount of valid data for each data block of multiple data blocks stored at a first memory is determined. An operation to write valid data of a particular data block from the first memory to a second memory is performed based on the amount of valid data for each data block. A determination is made that a threshold condition associated with when valid data of the data blocks was written to the first memory has been satisfied. In response to determining that the threshold condition has been satisfied, the operation to write valid data of the data blocks from the first memory to the second memory is performed based on when the valid data was written to the first memory.

Abstract: Files can be segmented into distinct groups and allocated storage units such as blocks. Files associated with parent and child files can be segmented into separate groups, for instance. Further, a group associated with parent files can be extended to include additional blocks reserved for subsequent update. Additionally, metadata can be merged across groups to provide a unified view of the distinct groups.

Abstract: A method for utilizing a decentralized agreement protocol for data access operations in a dispersed storage network (DSN) including a legacy storage unit pool and one or more non-legacy storage unit pools. In response to obtaining a DSN address associated with a data access request, a DSN computing device(s) generates ranked scoring information for the legacy storage unit pool and the non-legacy storage unit pool, the ranked scoring information based at least in part on the DSN address, a first location weight associated with the legacy storage unit pool, and a second location weight associated with the non-legacy storage unit pool. In an embodiment, the first location weight decreases over time (e.g., as a generation of legacy storage units is retired). Based on the ranked scoring information, at least one of the legacy storage unit pool or the non-legacy storage unit pool is selected for processing the data access request.

Abstract: Provided are a computer program product, system, and method for determining tracks to release in a source volume being copied to a target volume. A consistency group is formed of tracks in the source volume to copy to the target volume. A volume table providing information on the tracks allocated to the source volume is copied to a volume table copy in a memory providing a state of the tracks in the source volume as of a consistency group time. A determination is made of tracks in the source volume to release for tracks that are indicated in the volume table copy as available to release excluding tracks in the source volume that are written after the consistency group time. Space allocated to the determined tracks is released.

Abstract: A storage controller, includes: at least one memory storing a set of instructions; and at least one processor configured to execute the set of instructions to: perform cache processing of storing, in a cache storage, data stored in a physical disk; specify a set of data that are adjacent to each other in a logical disk and are not adjacent to each other in the physical disk, among data stored in the cache storage, and set a group including the specified set of data; determine, at an opportunity in which all cached data among data belonging to the group become target data of deletion from the cache storage, a range in the physical disk in which the target data are stored in such a way that all data belonging to the group are continuously arranged in the physical disk; and write the target data into the determined range.

Abstract: A method for more intelligently managing storage space in journal volumes is disclosed herein. In one embodiment, such a method includes maintaining, on a primary storage system, a change recording data structure that documents updated storage elements of a primary volume on the primary storage system. The method further determines in which extents of the primary volume the updated storage elements reside. These extents are recorded in an extent-based data structure. The method transmits the extent-based data structure from the primary storage system to a secondary storage system that is in an asynchronous mirroring relationship with the primary storage system. The extent-based data structure is then read at the secondary storage system. The method frees, from a journal volume on the secondary storage system, extents that are not recorded in the extent-based data structure. A corresponding system and computer program product are also disclosed herein.

Abstract: An apparatus is configured to identify a storage volume to be added to a consistency group for replication from a source storage system (“source”) to a target storage system (“target”), to generate a snapshot of the storage volume, to create a dummy volume on the target, to copy the snapshot to the dummy volume, and to add the storage volume to the consistency group. In conjunction with replication of the consistency group from the source to the target, a determination is made for each of a plurality of data pages of the storage volume whether or not the data page already exists in the target as part of the dummy volume. For at least one data page that already exists in the target as part of the dummy volume, a reference count is incremented in the target for that data page instead of copying that data page from the source.

Abstract: A host device discovers one or more first protocol endpoints presented by a storage system for a first logical storage device utilizing a first access protocol, and discovers one or more second protocol endpoints presented by the storage system for a second logical storage device utilizing a second access protocol. Responsive to determining that the first and second logical storage devices have a same device identity, the host device temporarily masks the one or more second protocol endpoints in a multi-path layer of the host device from one or more applications executing on the host device. In conjunction with a switchover from the first logical storage device to the second logical storage device, the host device ends the temporary masking in the multi-path layer and enables access of the one or more applications to the second logical storage device via the one or more second protocol endpoints.

Abstract: Systems, apparatuses, and methods related to host-based bit string conversion are described. A conversion component may be deployed on a host computing system and configured to perform operations on bit strings to selectively convert the bit string between various numeric formats, such as floating-point and/or universal number (e.g., posit) formats. The conversion component may comprise a processing device that may be coupled to one or more memory resources. The memory resource of the conversion component may be configured to receive a bit string having a first format. The processing device of the conversion component coupled to the memory resource may be configured to format or convert the bit string to a second format.

Abstract: A method for adaptive content balancing for Web clients includes monitoring content processing performance in different client computing devices communicatively coupled over a network to a content server, measuring the content processing performance for each of the different devices and storing the measured performance for each of the different devices in connection with different resource groupings of the requested content type. Thereafter, a request for content is received in the content server from one of the devices, and the stored performance is retrieved. As such, the retrieved metrics of the computing device are matched to the retrieved metrics of one of a multiplicity of groupings of one or more different resources associated with the requested content and the resources of the one of the multiplicity of the groupings is included in the requested content. Finally, the requested content is transmitted to the one of the client computing devices.

Abstract: A method and technique for allocation and balancing of storage resources includes monitoring, for each of a plurality of storage controllers, an input/output (I/O) latency value based on an I/O latency associated with each storage volume controlled by a respective storage controller. An I/O latency value threshold is determined. Responsive to a change to the I/O latency value exceeding a threshold, storage volume distribution among the storage controllers is rebalanced.

Abstract: Provided is a storage system and a data management method of a storage system enabling system-wide data deduplication. The storage system has a plurality of storage apparatuses in which one or a plurality of logical volumes are provided. Based on data information of data obtained through the generation of a request to write to a logical volume in the storage system, one storage apparatus among the plurality of storage apparatuses calculates, for a plurality of combinations of storage apparatus and logical volume in the storage system, a data capacity when duplicate data is removed for each of the storage apparatuses, calculates the total of the calculated data capacities as the total capacity of the whole storage system, and performs optimal arrangement arithmetic processing to output information indicating a combination with the smallest total capacity among the plurality of combinations.

Abstract: A system or method for identifying anomalies indicating misconfiguration or software bugs in a data storage network that may include capturing data storage network latency metrics, identifying periods of high latency in the captured latency metrics, applying a statistical deviation operation to the latency metrics in the periods of identified high latency, and identifying outliers in the statistically deviated latency metrics. The method further includes calculating a median of the identified outliers, normalizing the median of the identified outliers, and scoring the normalized median values of the identified outliers.

Abstract: A wireless locator that facilitates determining a location of a nearby wireless asset including an antenna array with multiple antennas, at least one wireless transceiver that receives a location signal from the nearby wireless asset and that takes multiple samples from the location signal including a set of samples for each antenna, and a processor that compresses the samples to generate location information associated with the nearby wireless asset. The wireless locator may be part of a wireless location system including multiple wireless locators distributed in the area and a central processing system. Various compression methods are disclosed, including averaging of the samples, bit reduction of the samples, converting the samples to corresponding phase values, and combining corresponding samples of multiple sample supplemental sets. Combinations of the various compression methods are also disclosed.

Abstract: Embodiments of the inventive concept improve performance, energy efficiency, and capacity of storage solutions, for example, by reducing the data movement between the CPU and the storage device and increasing the available capacity of the underlying storage devices via in-storage support for data compaction. Embodiments include a storage apparatus and method for autonomous in-storage space compaction initiated by a host-side command and according to metadata specified by a host. A space compact engine can function as an independent module or logic section within a storage device, which can migrate data within the storage device, thereby freeing up capacity and making preexisting data more compact. The space compact engine can cause self compact operations, self compact and trim operations, move and compact operations, and/or merge and compact operations. The space compact engine can notify the host of the completion of the operations.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating a video stream preview. One of the methods includes receiving, from a user device, a request for a video stream preview. A payload of data is transmitted from a session system to the user device over a network. A first measure of network transmission quality is determined based on a result of transmitting the payload to the user device over the network from the session system. A second measure of network transmission quality is determined for data transmitted over the network from a session host to the session system. A video stream preview is generated from an example video stream obtained from the user device by degrading the quality of the example video stream according to the first measure of network transmission quality and the second measure of network transmission quality. The video stream preview is displayed on the user device.

Abstract: Inconsistency in data stored in a plurality of servers that perform replication is prevented. A capacity management unit provides in advance a temporary area for dynamic control of a total capacity, manages a use status of the temporary area of each of a master server and a slave server with a capacity management table, and determines whether a data write request for requesting writing of data is executable or not based on the use status of the temporary area of the master server and the use status of the temporary area of the slave server in the capacity management table of the data requested to be written by the data write request. A data processing unit causes both of the master server and the slave server to execute the data write request when the capacity management unit determines that the data write request is executable, and prevents both of the master server and the slave server from executing the data write request when the data write request is determined to be inexecutable.

Abstract: An embodiment of a semiconductor apparatus for use with a persistent storage media may include technology to detect a power interruption event, and track an amount of off-time for a persistent storage media after the detected power interruption event. Other embodiments are disclosed and claimed.

Abstract: Methods and systems are provided for modifying configuration of a storage system using artificial intelligence. An exemplary method comprises storing an initial configuration of the storage system as configuration parameters, collecting health information and parameter information related to the storage system over a period of time, analyzing the collected health information using machine learning by comparing the health and the parameter information to a set of goals of the storage system, and in response to determining that the storage system is not operating in accordance with the set of goals, identifying a problem with the storage system using artificial intelligence by analyzing the health information and generating parameter changes that correct the problem, updating the configuration parameters with the parameter changes and applying the parameter changes to the storage system to correct the problem and restore performance of the storage system.

Abstract: A computer-implemented method according to one embodiment includes identifying a request to migrate data associated with a volume from a source storage pool having a first rank extent size to a destination storage pool having a second rank extent size smaller than the first rank extent size, creating a correspondence between logical volume extents of the volume and physical offset locations within rank extents of the source storage pool, and migrating data from one or more ranks of the source storage pool to one or more ranks of the destination storage pool, utilizing the correspondence between the logical volume extents of the volume and the physical offset locations within the rank extents of the source storage pool.

Abstract: A data storage device comprises a non-volatile semiconductor memory device and a solid-state drive controller communicatively coupled to the non-volatile semiconductor memory device. The non-volatile semiconductor memory device can store data in memory blocks. The solid-state drive controller can, periodically, retrieve counts from a counter table, select a predetermined number of memory blocks corresponding to the lowest counts, and determine an integrity of the stored data in each of the predetermined number of memory blocks. Each count can correspond to a difference between a count limit and a number of read operations performed on one of the memory blocks.

Abstract: Some embodiments of the present invention provide systems and methods for live data migration with automatic redirection that overcome some or all of the downfalls of typical approaches. According to some embodiments, any client applications or devices accessing the migrated data may stay live and any new requests may be automatically redirected to the destination server to which the data was migrated. This may be accomplished, for example, using a combination of Server Message Block (SMB), Service Witness Protocol (SWP), and Distributed File System Referral Protocol (DFS).

Abstract: The method, computer program product and computer system of the present invention may include a computing device that replicates data from a first data storage site, which may have a plurality of data storage tiers, to one or more second data storage sites. The computing device may identify a portion of the data on a first tier of the first data storage site to be inactive and move the inactive data to a second tier of the first data storage site. The computing device may compute a number of slices to slice the inactive data into and a location to store the slices of inactive data using an information dispersal algorithm. The computing device may send the computed number of slices and storage location for the inactive data to the one or more second data storage sites to apply to the data replicated from the first data storage site.

Abstract: Provided is a system and method for increasing file transmission speed of a server, and a method for replicating a data object over a plurality of nodes. The system includes a server communicatively coupled to a plurality of nodes. The server may detect a plurality of nodes. The server may determine that a data object stored by the server is to be replicated to the plurality of nodes. The server may divide the data object into a plurality of data pieces. The server may send a different data piece to each node of the plurality of nodes. Each node may receive the different data piece from the server. Each node may send a copy of the received data piece to all other nodes. Each node may receive copies of all other data pieces from the other nodes. Each node may replicate a full copy of the data object.

Abstract: A highly accurate data migration pattern is decided on the bases of usages of a plurality of kinds of resources and by taking influence of execution of data migration on each resource into consideration. In a distributed storage system, a monitor acquires a per-period usage of each of the plurality of kinds of the resources per data, a performance simulator estimates a per-period usage of each resource on a migration destination node when the data is migrated by using the acquired per-data resource usage and calculates an estimate of a latency from the estimated usage of each resource and an optimizer decides a migration pattern of the data on the basis of the estimate of the latency.

Abstract: In accordance with one aspect of the present description, in response to a detection by a storage controller, of an operation by a host relating to migration of input/output operations from one host to another, a cache server of a storage controller, transmits to a target cache client of the target host, a cache map of the source cache of the source host wherein the cache map identifies locations of a portion of the storage cached in the source cache. In response, the cache client of the target host, may populate the target cache of the target host with data from the locations of the portion of the storage, as identified by the cache map transmitted by the cache server, which may reduce cache warming time. Other features or advantages may be realized in addition to or instead of those described herein, depending upon the particular application.

Abstract: Methods, systems, and computer-readable media for live migration for highly available data stores are disclosed. Migration of a data set from a first data store to a second data store is initiated and comprises a backfill of records to the second data store. During a window of time before the migration is complete, a read request for a first record is received. A response representing an authoritative version of the first record is generated using a copy of the first record in the first data store and a copy of the first record in the second data store. A write request for a second record is received during the window of time. A lock is acquired for the second record, and the write request is performed using a copy of the second record in the first data store and a copy of the second record in the second data store.

Abstract: Systems and methods are provided to implement a metadata record migration system that schedules the migrations of metadata records that are frequently mutated. In embodiments, the scheduler collects timing data of jobs that modify the metadata records, including the timing of various mutation operations within the jobs. In embodiments, when it is determined that a metadata record is to be migrated to a different storage location, the scheduler determines a time to migrate the metadata record. The migration time may lie within a migration window, selected based on an expected migration time needed for the metadata record and the collected time data in order to reduce a probability that record mutations will occur during the migration. In embodiments, the jobs may be snapshot jobs that modify a snapshot record, and the migration may be performed as a result of a cell partitioning operation occurring within the snapshotting system.

Abstract: A computing system implemented method is disclosed for reassigning ownership of a data object between computing nodes. A first computing node having control of a data object transmits a hand-off message indicating control of the data object is being transferred to a second computing node. The first computing node queues requests received at the first computing node relating to the data item. A third computing node that interacts with the data object receives the hand-off message and, in response, delays transmitting requests relating to the data object. When the second computing node receives the hand-off message, it transmits a message claiming control of the data object. In response to the message claiming control, the first computing node and the third computing node transmit their queued requests relating to the data item to the second computing node.

Abstract: An enterprise management system is described for efficient operating system migration, preserving applications, data, and settings. A staging area, such as an empty folder, is created on a client device. A base layer for the new operating system and application layers for applications that will be installed on the computing device are downloaded to the staging area. After the base layer and application layers are downloaded, the layers are merged onto the computing device to instantly install the operating system and the applications. User settings, data, and other applications can be migrated to corresponding locations in the new operating system from the old operating system.

Abstract: Disclosed in some examples are systems, methods, NAND memory devices, and machine readable mediums for intelligent SLC cache migration processes that move data written to SLC cache to MLC storage based upon a set of rules that are evaluated using the state of the NAND device. In some examples, the SLC cache migration process may utilize a number of NAND operational parameters to determine when to move the data written to SLC cache to MLC, how much data to move from SLC to MLC, and the parameters for moving the data.

Abstract: Embodiments of the present application provide operation retry methods and apparatuses. One exemplary method includes: detecting whether an operation of a job fails; if there is an operation failure, collecting statistics on a progress of the job; calculating a retry interval according to the progress of the job; and re-executing the operation after waiting for the retry interval. When an operation of a job fails, the retry interval can be adaptively calculated according to the progress of the job. This can help increase the length of the retry interval, especially for a long job. The job can thereby be retried dynamically, to cope with longer service interruption. Embodiments of the present application can help avoid waste of resource waste caused by job failure and job re-execution, and reduce the retry costs while ensuring the success rate of the job.

Abstract: The present disclosure provided a method, apparatus, and system for caching data. In an embodiment of the present disclosure, the method for caching data comprises: recording, within a recording period for recording access count information of the data, access count information on respective data, wherein the recording period includes a plurality of recording timeslots, wherein the recording of the access count information within a single recording timeslot is restricted, while the access count information within the plurality of recording timeslots is aggregated; and promoting, in response to expiration of the recording period, the respective data into a cache area based on the access count information.

Abstract: The first to third storage apparatuses each comprise an SVOL1, SVOL2 and PVOL. Even when the write command designates any of the PVOL, SVOL1 and SVOL2, at least one of the first to third storage apparatuses writes write target data according to the write command to the PVOL and then writes the write target data in parallel to the SVOL1 and SVOL2. Even if a read command designates any of the PVOL, SVOL1 and SVOL2, at least one of the first to third storage apparatuses reads read target data according to the read command from the PVOL.

Abstract: A migration agent, which is part of a distributed storage network, identifies one or more data objects stored as sets of encoded data slices in a first storage pool, and determines, for each of those data objects, whether to migrate corresponding sets of encoded data slices from the first storage pool to another storage pool. For at least one of the data objects, the migration agent determines to migrate a set of encoded data slices, and issues a set of MoveSlice requests to storage units included in the first storage pool, from which the data slices will be migrated. In response to the MoveSlice requests, the migration agent receives MoveSlice responses from the storage units in the first storage pool. If a threshold number of favorable MoveSlice responses is received, the migration agent facilitates deletion of the migrated encoded data slices from the first storage pool.

Abstract: A virtual tape engine migrates a virtual tape volume between filesystems. A source virtual tape volume is copied into the virtual tape engine, and a target virtual tape volume is generated. Data associated with the source virtual tape volume may be modified to generate the target virtual tape volume. For example, compression or encryption state may be modified. Migration may be triggered automatically in accordance with a migration policy. The source virtual tape volume remains accessible during migration.

Abstract: A first memory stores a translation table indicating a first correspondence between a logical address and a physical address at first timing. A second memory stores a difference table that is configured to record, in each of entries, a correspondence between a logical address range and a physical address range, the correspondence representing a difference between the first correspondence and a second correspondence. The second correspondence is between the logical address and the physical address at second timing. In non-volatilizing data in a first logical address range to a first physical address range, in a case where the entries includes a first entry containing a correspondence between a second logical address range and a second physical address range, the controller updates the first entry. The first logical address range follows the second logical address range, and the first physical address range follows the second physical address range.

Abstract: Entanglement of pages and threads is disclosed. An indication is received of a stalling event caused by a requested portion of memory being inaccessible. It is determined that the requested portion of memory is an entangled portion of memory that is entangled with a physical node in a plurality of physical nodes. A type of the entangled portion of memory is determined. The stalling event is handled based at least in part on the determined type of the entangled portion of memory.

Abstract: In some examples, a computing device may determine an estimated available capacity at a future time for respective storage nodes of a plurality of storage nodes. The computing device may compare the estimated available capacity of a first one of the storage nodes at the future time with the estimated available capacity of a second one of the storage nodes at the future time. Based at least in part on determining that a difference between the estimated available capacity of the first storage node and the estimated available capacity of the second storage node exceeds a threshold difference, determining an amount of data to move from the first storage node. The computing device may cause data to be moved from the first storage node to cause the difference between the available capacity of the first storage node and the available capacity of the second storage node to be reduced.

Abstract: A data recovery method in a distributed storage system including a NameNode, a plurality of first storage nodes and a plurality of second storage nodes, where each of the first storage nodes includes a data processing apparatus communicatively coupled to the NameNode. The data processing apparatus receives a file block obtaining request carrying an identifier of a target file, determines that a target file block is lost according to the identifier of the target file, obtains, from the NameNode, an identifier of a target storage node on which a recovery dependence data block is located, and obtains the recovery dependence data block according to the identifier of the target storage node and the identifier of the target file to recover the target file block.

Abstract: Memory reclamation is tailored to avoid certain synchronization instructions, speeding concurrent garbage collection while preserving data integrity and availability. Garbage collection reclaims objects no longer in use, or other unused areas of memory. Pointers are partitioned into address portions holding address values and garbage collection portions having a special bit. Marking code writes only the garbage collection portions, setting the special bit as a mark reference, relocation candidate, etc. Mutator threads may concurrently mutate the entire pointer to update the address, but mutation does not cause incorrect reclamations or failure to do other operations such as relocation. Meanwhile, execution speed is increased by avoiding CAS (compare-and-swap instructions or compare-and-set) synchronization instructions in the garbage collector. Non-CAS yet nonetheless atomic writes are used instead. Mutators run in user or kernel address spaces.

Abstract: Embodiments are provided herein for dynamic memory-based communication in a disaggregated computing system. A pool of similar computing elements is configured as a large address space, the large address space segmented by an identifier. Data travel distances are optimized depending on a historical or expected use of a data object by using a grouping and amortization algorithm to relocate the data object within the pool of similar computing elements at a particular address within the large address space according to the historical or expected use.

Abstract: A garbage collection process running on a computing device is configured to track the number of garbage collection cycles that storage fragments, called extents, are persisted in storage without being modified or deleted using a lifetime counter that is implemented using metadata. At each garbage collection cycle, the extents are sorted by lifetime values. Old extents (i.e., those existing at the start of the cycle) are bucketed together by lifetime values during garbage collection into new extents (i.e., those being created during the cycle). Thus, each of the new extents includes data having similar lifetime values. The lifetime value for the new extent equals the lowest lifetime value of the old source extent plus one additional increment on the counter. As extents are organized by garbage collection lifetime, placement on storage media can be optimized according to expected endurance requirements.

Abstract: A Universal Flash Storage (UFS) memory module including an input/output interface, a flash memory and a controller, and a method for operating a UFS memory module are disclosed. The flash memory includes: a write buffer portion; and a normal storage portion having a plurality of logic units. The controller includes: a processor; a first register indicating a maximum size of the write buffer portion; a second register indicating an available size of the write buffer portion; and a third. If the third register indicates the UFS memory module is in a shared buffer mode, the write buffer portion only includes a first shared buffer area. If the third register indicates the UFS memory module is in an advanced mode, the write buffer portion includes at least one dedicated buffer area, each corresponding to one of the plurality of logic units.

Abstract: Digital information is transferred between an application that processes a plurality of on-line transactions executed on the mainframe computer and a file system of an operating system. A programmable processor identifies the data held in memory under control of the application. The programmable processor calls a first routine to associate a portion of the data with a container of the application and calls a second routine to dynamically allocate a file of the file system. The programmable processor opens the file of the file system and calls an input/output routine of the operating system to transfer the data associated with the container to the file of the file system.