Abstract: During compilation, a table mapping relative virtual address of a memory-allocating instruction of a native language program to a user type of the instance is created. During execution of the program, a module injected into the process intercepts calls to memory allocating functions and records the virtual address of the instruction calling the memory allocating function and the virtual address of the instance created. When a snapshot of the process heap is requested, the user type of the corresponding compile time instruction is assigned to the created instance. User type and heap information can he used to compute sizes of memory allocations and to aggregate user type instance counts and sizes. Using the static debugging information, a reference graph that displays the nesting of objects in live instances can be computed and displayed.

Abstract: A code sequence made up multiple instructions and specifying an offset from a base address is identified in an object file. The offset from the base address corresponds to an offset location in a memory configured for storing an address of a variable or data. The identified code sequence is configured to perform a memory reference function or a memory address computation function. It is determined that the offset location is within a specified distance of the base address and that a replacement of the identified code sequence with a replacement code sequence will not alter program semantics. The identified code sequence in the object file is replaced with the replacement code sequence that includes a no-operation (NOP) instruction or having fewer instructions than the identified code sequence. Linked executable code is generated based on the object file and the linked executable code is emitted.

Abstract: A method of managing storage devices including storage resources that are virtualized and integrated into corresponding intermediate volumes, wherein the intermediate volumes are virtualized and integrated into individual logical volumes. The method comprises acquiring storage resource requirements presented to the logical volumes where the requirements comprise redundancy, obtaining storage resources available from respective intermediate volumes, selecting intermediate volumes to satisfy the storage resource requirements based on the requirements and available storage resources, where a minimum number of the intermediate volumes is determined based on the required redundancy, and storing user data in selected intermediate volumes based on the required redundancy.

Abstract: According to one embodiment, an information processor includes: a controller, a volatile storage module, a non-volatile storage module, and a reader. The volatile storage module is configured to be allocated with a storage area which can be accessed by the controller. The non-volatile storage module is configured to save data stored in the storage area of the volatile storage module at transition to a power-off state. The reader is configured to read, if a state just prior to the transition to the power-off state is to be recovered, the data stored in the non-volatile storage module by each page, and to load the read data to the storage area in the volatile storage module. The page is configured by a plurality of memory cells.

Abstract: A main data storage system has a main storage control and data storage, and a user interface, the main storage control in communication with a local storage control of a local data storage system with local data storage. In response to a request to increase data storage from the user interface, the main control determines whether the main data storage is out of space. If so, the main control sends a command to the local control to create data space in local data storage. The local control creates the data space and associates the data space with the main control; and, in response to the local control creating data space in the local data storage and notifying the main control, the main control updates its metadata with respect to the data space, creating the impression that all the data is stored in the main data storage.

Abstract: A change in workload characteristics detected at one tier of a multi-tiered cache is communicated to another tier of the multi-tiered cache. Multiple caching elements exist at different tiers, and at least one tier includes a cache element that is dynamically resizable. The communicated change in workload characteristics causes the receiving tier to adjust at least one aspect of cache performance in the multi-tiered cache. In one aspect, at least one dynamically resizable element in the multi-tiered cache is resized responsive to the change in workload characteristics.

Abstract: Access to various types of resources is controlled efficiently, thereby enhancing the throughput. A storage system includes: a disk device for providing a volume for storing data to a host system; a channel adapter for writing data from the host system to the disk device via a cache memory; a disk adapter for transferring data to and from the disk device; and at least one processor package including a plurality of processors for controlling the channel adapter and the disk adapter; wherein any one of the processor packages includes a processor for incorporatively transferring related types of ownership based on specific control information for managing the plurality of types of ownership for each of the plurality of types of resources.

Abstract: A storage system includes a secondary data store for backing up the primary data store, a deleted data store for retention of deleted data, and a data management application for managing the backing up of stored and deleted data of the primary data store. The deleted data store may be either separate from the secondary data store or implemented within the secondary data store. The data management application may automatically free up space for backup of data newly added to or deleted from the primary data store, by selectively removing data from the deleted data store, based application of appropriate criteria.

Abstract: A storage tiered that satisfies desired performance is configured by recognizing the type and capacity of storage media of a storage apparatus, which are held by a user, and using the storage media.

Abstract: A storage apparatus includes a storage drive which writes and reads out a block of data with respect to a storage medium loaded on the storage apparatus, a processor which executes access control on a plurality of volumes assigned to the storage medium and a memory which stores a piece of management information that includes a piece of information indicating a usage frequency of each of the volumes. The processor executes a procedure including: determining a reallocation target volume from among a plurality of volumes assigned to the storage medium based on the management information, and moving the data of the reallocation target volume to a reallocation destination storage medium which is different from the storage medium.

Abstract: An intermediate symbol buffer (ISB) configuration and method is provided such that the ISB memory comprises 15 portions, one for each HSDPA spreading code. Symbols associated with a spreading code are written to the memory portion associated with the same spreading code. When a covariance calculation is performed to obtain a more accurate channel estimate, only the symbols associated with spreading codes determined to be needed for the covariance calculation are written to the ISB by a buffer block and red from the ISB by a correlation core. The symbols associated with spreading codes that are not necessary for a covariance calculation may be masked from being written or read from the ISB. In some embodiments each memory portion is an individual memory block. In other embodiments a plurality of memory blocks may contain a plurality of memory portions, one memory partition designated, at least temporarily, for each spreading code.

Abstract: Conventionally, the fees for using services of a storage system was calculated based on the status of use or access performance of storage areas and not based on migration of data. The present invention provides a storage system in which multiple tiers composed of storage areas of various memory devices are assigned in page units and the assigned tiers are changed based on access frequency, wherein stored costs are calculated based on status of use of the storage areas constituting the tiers, and migration costs are calculated and charged based on the amount of migration of data among tiers and the I/O access counts after migration, according to which appropriate charging of cost for using the storage system is enabled.

Abstract: A plurality of functions to configure a unit of a storage volume is maintained, wherein each of the plurality of functions, in response to being applied to the unit of the storage volume, configures the unit of the storage volume differently. Statistics are computed on growth rate of data and access characteristics of the data stored in the unit of the storage volume. A determination is made as to which of the plurality of functions to apply to the unit of the storage volume, based on the computed statistics.

Abstract: In a method for reclaiming space occupied by an expired variable record in a non-volatile record storage, a reclaim state data that includes a state of a reclaim operation is maintained. In addition, the state of the reclaim operation is marked to indicate a progress of the reclaim operation at a plurality of stages of the reclaim operation. The reclaim operation is implemented by sliding, one section at a time, the data in a first direction along the plurality of sections and by sliding, one section at a time, the variable records, excluding the expired variable record, in a second direction along the plurality of sections, to thereby remove the expired variable record.

Abstract: A memory allocation message for each primary memory allocation in a primary memory made by a primary processor is received at a hardware memory management module, including an indication of whether a finalizer routine is associated with each primary memory allocation. A representation of each primary memory allocation is allocated within a second memory in response to each memory allocation message, including the indication of whether there is the associated finalizer routine. A determination is made, based upon the allocated representations of each primary memory allocation within the second memory, to free a primary memory allocation in the primary memory. A call object finalizer message is sent to the primary processor instructing the primary processor to call the finalizer routine associated with the primary memory allocation in the primary memory in response to determining that the primary memory allocation has the associated finalizer routine.

Abstract: Multiple storage systems have capability to provide thin provisioning volumes to host computers and capability to transfer (import/export) management information regarding thin provisioning between storage systems. Moreover, at least one of the storage systems posses capability to provide storage area of other storage system as own storage area virtually via connection to the other storage system (i.e. external storage). Target storage system achieves efficient migration and unifying storage resource pool by importing or referring the management information obtained from source storage system and by utilizing the source storage system as external storage. One implementation involves method and process for migration of thin provisioning volumes using chunks having same length between source storage system and destination storage system.

Abstract: An embodiment of a data-processing-system for storing and modifying data-objects in a computing device, wherein a data-object is modified by direct insertion or removal of data within the data-object's storage-space. Data-objects may be of fixed, or variable-lengths. Data-objects may be nested. The length, name, data-type, value, and composition of a data-object may be modified. Other embodiments are described and shown.

Abstract: Embodiments of the present invention provide a method, system and computer program product for dynamic main memory reconfiguration in virtual memory management. In an embodiment of the invention, a method for dynamic main memory reconfiguration in virtual memory management can include receiving a memory access directive in a host computer, determining a low free space condition in a memory allocation to satisfy the memory access directive, augmenting the memory allocation with a mapping to additional memory in the host computer in lieu of page swapping in response to the low free space condition, and satisfying the memory access directive. Additionally, the method can include determining an excess free space condition in the memory allocation and removing from the memory allocation a selection of allocated memory in the host computer.

Abstract: Provided is a method of using a dynamic chunk allocation function to efficiently carry out data volume migration. A storage apparatus according to the present invention includes first and second storage units and divides a storage extent in the second storage unit into chunks to add the chunks to a chunk pool to dynamically allocate the chunks in the chunk pool to a newly created logical data volume (see FIG. 3).

Abstract: A storage system in an embodiment of this invention comprises a virtual volume to which real storage areas are allocated depending on data amount to be stored therein and which stores a plurality of mainframe data managed in units of tracks, each of the plurality of mainframe data including control information and one or more records storing user data, and a controller The virtual volume is managed by a first real storage area storing the records in the plurality of mainframe data and a second real storage area storing the control information in the plurality of mainframe data. The controller determines not to allocate the first real storage area to the virtual volume in a case that user data in the records in the plurality of mainframe data are initial values. The control information in the plurality of mainframe data is stored in the second real storage area allocated to the virtual volume.

Abstract: This disclosure relates to storing a secure application directory within a contactless smart card. The contactless smart card include secure memory area for storing software applications and may include a default application directory for listing the software applications stored within the contactless smart card to an external card reader. A second application directory is stored with an access key and a listing of a second set of software applications within the same contactless smart card. The second application directory includes improved application directory entries, where each application directory entry includes an application identifier, a starting memory block byte value, and a size byte value for each of the second set of software applications.

Abstract: Described are an apparatus, system, and method for improving read endurance for a non-volatile memory (NVM). The method comprises: determining a read count corresponding to a block of NVM; identifying whether the block of NVM is a partially programmed block (PPB); comparing the read count with a first threshold when it is identified that the block is a PPB; and when identified otherwise, comparing the read count with a second threshold, wherein the first threshold is smaller than the second threshold. The method further comprises: identifying a block that is a PPB; determining a first word line corresponding to un-programmed page of the PPB; and sending the first word line to the NVM, wherein the NVM to apply: a first read voltage level to word lines corresponding to the un-programmed pages of the PPB, and a second read voltage level to word lines corresponding to programmed pages of the PPB.

Abstract: A device, comprising a single-ported first memory slice accessible only to a plurality of clients and including a plurality of blocks configured for storing information on behalf of the plurality of clients. The device further comprises a dual-ported second memory slice having a plurality of blocks for storing links and accessible to the plurality of clients and to a list manager that maintains a data structure for allocating memory blocks from the first memory slice and the second memory slice to the plurality of clients. In response to a client request, the list manager allocates a block of the first memory slice and a block of the second memory slice to the client, and stores a link for a next available memory block at the second memory slice.

Abstract: Dynamic provisioning of available space in a data storage system without having to configure partitions at system startup is presented. A system table may be maintained with entries corresponding to provisions within the available physical capacity of a data storage system. A volume table may be maintained that includes entries corresponding to territories within a logical data storage volume. When a data write operation is requested, a determination may be made as to whether physical space has been allocated for the territory in the volume that is to be written. If physical space has not yet been allocated, the necessary physical space may be allocated for the territory within the logical volume that is to receive the written data and the requested write operation may be performed. Metadata can be written to disk as to simplify recover from system crashes and unclean shutdowns.

Abstract: In one embodiment, a storage system for storage management in a tiered storage environment comprises a plurality of storage volumes in a pool which are divided into a plurality of tiers having different tier levels, the tiers being organized according to a tier configuration rule, the plurality of storage volumes provided by a plurality of physical storage devices in the storage system; and a controller controlling the plurality of physical storage devices, the controller including a processor and a memory. The controller changes tier configurations of the tiers of storage volumes when the tier configuration rule is changed, the tier configurations including the tier levels. The controller allocates the pool to a plurality of virtual volumes based on a change of tier levels against the physical storage devices which occurs when the pool does not meet the tier configuration rule that was in effect.

Abstract: In a virtual computer system controlling a disk volume and a virtual server which is connected to the disk volume, to which the area of the disk volume is allocated as a virtual disk and which executes a process using the allocated virtual disk, the virtual computer system erases information stored in the virtual disk allocated to the virtual server to be deleted correspondingly with the deletion of the virtual server. An administrative server may be provided to select a server system which is low in load from among plural server systems controlling virtual servers as a server system for erasing information stored in the virtual disk allocated to the virtual server to be deleted.

Abstract: Systems and methods for identifying objects generated during program execution are provided. In one embodiment, the method comprises examining one or more data structures that include information about allocation of memory space to one or more objects; determining address space allocated to at least one of said objects based on examining said data structure; populating a reverse object map based on the examining of the one or more data structures and the determining of the address space allocated to said objects, such that one or more addresses in memory are associated with an object instantiated during program execution; and determining identity of a target object accessed during program execution in association with a respective address, in response to evaluating the respective address against the reverse object map to find the target object.

Abstract: A computing system includes a number of memory modules and temperature sensors. Each temperature sensor measures a temperature of a memory module. In such a computing system a garbage collector during garbage collection, determines whether a temperature measurement of a temperature sensor indicates that a memory module is overheated and, if a temperature measurement of a temperature sensor indicates a memory module is overheated, the garbage collector reallocates one or more active memory regions on the overheated memory module to a non-overheated memory module. Reallocating the active memory regions includes copying contents of the active memory regions from the overheated memory module to the non-overheated memory module.

Abstract: A set of storage devices may interoperate to share a pool of storage space, such as in a Redundant Array of Inexpensive Disks (RAID) scheme. However, the details of the representation of the pool and the allocation of capacity to the pool may enable advantages and/or impose limitations on the storage set. Presented herein are techniques for generating a representing a pooled partition on one or more storage devices featuring a pool configuration representing the pool as a set of spaces manifested by the pool; a set of storage devices sharing the pool; and a set of extents that map physical areas of the storage devices to logical areas of the spaces. The flexibility of these pooling techniques may enable such features as flexible capacity allocation, delayed binding, thin provisioning, and the participation of a storage device in two or more distinct pools shared with different sets of storage devices.

Abstract: A method and apparatus for performing a function based on an executable code in response to receiving a request including function parameters are described. The executable code may be validated when loaded in a memory according to a signature statically signed over the executable code. A data location in the memory for storing the function parameters may be determined according location settings included inside the executable code. A target code location for storing a copy of the executable code may be determined based on the location parameters and the determined data location. A function is performed by executing the executable code from the target code location referencing the stored function parameters.

Abstract: Methods and structure for improved buffer management in a storage controller. A plurality of processes in the controller each transmits buffer management requests to buffer management control logic. A plurality of reserved portions and a remaining non-reserved portion are defined in a shared pool memory managed by the buffer management control logic. Each reserved portion is defined as a corresponding minimum amount of memory of the shared pool. Each reserved portion is associated with a private pool identifier. Each allocation request from a client process supplies a private pool identifier for the associated buffer to be allocated. The buffer is allocated from the reserved portion if there sufficient available space in the reserved portion identified by the supplied private pool identifier. Otherwise, the buffer is allocated if sufficient memory is available in the non-reserved portion. Otherwise the request is queued for later re-processing.

Abstract: A method for creating a buffer of a special class for accessing a specified memory space. The method includes the steps of: creating, by a processor of the computer system, a buffer of a special class, the buffer including a memory space that the processor is not permitted to access; and creating, by the processor, an accessible buffer of the class in access-permitted memory space by slicing off a portion of a created buffer of the class in response to a designation of the access-permitted memory space and size, where the processor includes: the special class for the buffer for accessing a memory space specified by an absolute address; and a function to create the class by slicing off the portion of the memory space specified by the class.

Abstract: Memory management techniques that permit an executing process to store content in memory and later retrieve that content from the memory, but that also permit a memory manager to discard that content to address memory pressure. A process executing on a computing device may notify a memory manager of the computing device that first memory space allocated to the process contains first content that is available for discard. If the memory manager detects the computing device is experiencing memory pressure, the memory manager may address the memory pressure by selecting memory space available for discard and discarding the content of the memory space. Before a process reuses content made available for discard, the process may notify the memory manager of the intent to reuse and, in response, receive empty memory and an indication that the content was discarded or receive an indication that the content is still available for use.

Abstract: A system and related method of operation for migrating the memory of a virtual machine from one NUMA node to another. Once the VM is migrated to a new node, migration of memory pages is performed while giving priority to the most utilized pages, so that access to these pages becomes local as soon as possible. Various heuristics are described to enable different implementations for different situations or scenarios.

Abstract: Exemplary embodiments of the invention provide a solution to deploy a virtual hard disk (VHD) to virtual device with maximizing capacity efficiency and data access performance by making the allocation unit size of virtual device the same as that of the VHD. In one embodiment, a method of deploying a VHD file to a storage apparatus comprises checking a block size of the VHD file received by the storage apparatus based on a header of the VHD file; creating a virtual volume to provide a page size which is same size as the block size of the VHD file; and performing one of (A) copying contents of the VHD file to the created virtual volume by allocating one page of the created virtual volume for each block of the VHD file; or (B) formatting the created virtual volume with a virtual volume file system, and copying the VHD file to the formatted virtual volume.

Abstract: A memory access method for parallel computing, which is applied in the case that n (n?2) parallel threads invoke the same original execution module, comprises the following steps: S1) determining the number k of mirror execution modules needed to be created based on the number n of threads, wherein n?1?k?1; S2) determining the mapping policy F between the n threads and the execution modules including the original execution module and the k mirror execution modules; S3) creating k mirror execution modules, and allocating the individual private memory pool; S4) executing the n parallel threads, and making each thread invoke the execution module according to the mapping policy F, wherein each execution module only accesses its private memory pool; S5) deleting the created mirror execution modules after finishing the thread operation, and releasing the resources.

Abstract: The disclosure includes an apparatus comprising a memory configured to store a free list comprising a plurality of nodes, wherein at least one of the plurality of nodes is configured to store a plurality of node addresses, and wherein each of the plurality of node addresses corresponds to one node in the plurality of nodes. The disclosure further includes a method of memory management comprising using a free list comprising a plurality of nodes and storing a plurality of node addresses in at least one of the plurality of nodes, and wherein each of the plurality of node addresses corresponds to one node in the plurality of nodes.

Abstract: A write control unit executes, for example, asynchronously a process of writing data to a first volume and a process of generating a code corresponding to the written data with respect to each partial area in the first volume and registering the generated codes in a code storing unit. The replication control unit replicates data of a replication target area in the first volume to a second volume, and determines partial areas of the replication target area, in which partial areas identical data is stored, based on the codes registered in the code storing unit and allocates the same physical storage area to partial areas of the second volume, which partial areas correspond to the determined partial areas.

Abstract: A method for managing an image memory in an embedded device is provided. A node is obtained from a linked list of the image memory. It is judged whether valid data is present in a memory block corresponding to the node. When no valid data is present, it is judged whether valid data is present in a memory block corresponding to a previous node of the node. When valid data is present in the previous node, it is further judged whether the valid data is movable. When the valid data is movable, memory block information described in the two nodes is exchanged, and the valid data previously stored in the memory block corresponding to the previous node is moved to the memory block corresponding to the node.

Abstract: A data compression method includes; generating compressed data from raw data having a normal size, defining a super page for a memory having a super size greater than the normal size, selecting a compressed data set from among the compressed data having a compression ratio less than a reference compression ratio ranging between 0.5 and 1.0, and storing the compressed data set in the memory using the super page.

Abstract: Storage segments in a storage volume coupled to a cache memory are released and re-allocated. A processor receives notice to release a segment allocated to the storage volume. A release pending status is assigned to the segment while preparing the segment for release. The storage volume is enabled to re-claim the segment while the segment includes the release pending status.

Abstract: A solid state storage system includes a flash memory area and a memory controller. The flash memory area includes memory blocks and replacement blocks configured to replace bad blocks occurring within the memory blocks. The memory controller is configured to perform a logical-to-physical address mapping on logical blocks including the replacement blocks, and select the replacement blocks using logical addresses of the logical blocks corresponding to the bad blocks.

Abstract: The present invention aims to improve the performance of accessing flash memory used as a storage medium in a storage device. In the storage device in accordance with the present invention, a storage controller, before accessing the flash memory, queries a flash controller as to whether the flash memory is accessible.

Abstract: Provided are a computer program product, system, and method for preemptively allocating extents to a data set in a storage system. A data set is comprised of a plurality of extents configured in at least one volume in the storage system. A first extent is allocated to the data set in a first volume to extend the data set. A determination is made as to whether a second extent can be allocated to the data set in the first volume in response to the allocating of the first extent. The second extent in a second volume is allocated for the data set in response to determining that the second extent cannot be allocated to the data set in the first volume.

Abstract: For forming an initial bitmap from deduplicated data on virtual volumes, discrete blocks are sorted according to frequency of occurrence to form a revised bitmap to first include a plurality of most common discrete blocks. A physical volume map is created from the revised bitmap. An initial virtual volume of the virtual volumes contained on a corresponding original physical volume is reviewed to determine whether moving the initial virtual volume to a different physical volume reduces the total number of data blocks in the physical volume map. The initial virtual volume is deleted from its corresponding original physical volume and added to the different original physical volume to create a revised physical volume map including revised physical volumes. The revised physical volume is written to the target set of physical media using the revised physical volume map.

Abstract: Described herein is a system and method for retaining deduplication of data blocks of a resulting storage object (e.g., a flexible volume) from a split operation of a clone of a base storage object. The clone may comprise data blocks that are shared with at least one data block of the base storage object and at least one data block that is not shared with at least one data block of the base storage object. The data blocks of the clone that are shared with the base storage object may be indicated to receive a write allocation that may comprise assigning a new pointer to a indicated data block. Each data block may comprise a plurality of pointers comprising a virtual address pointer and a physical address pointer. As such, data blocks of the clone comprising the same virtual address pointer may be assigned a single physical address pointer. Thus, a new physical address pointer is assigned or allocated once to a given virtual address pointer of data blocks of a clone.

Abstract: A semiconductor storage device having an improved write performance is disclosed. The semiconductor storage device includes a plurality of memory devices, with each memory device associated with a logical address space comprising contiguous logical addresses. A controller of the semiconductor storage device is configured to allocate a plurality of meta data groups for each memory device, with each meta data group assigned a set of logical addresses of the logical address space. The controller may also configured to assign a first logical address of a logical address space to a first meta data group and a second logical address of the logical address space, contiguous to the first logical address, to a second meta data group, where the second meta data group is different than the first meta data group.

Abstract: The present invention comprises a virtual volume 50, which is a virtual storage area comprising multiple virtual page groups, a pool 60, which is a storage area comprising multiple pool page groups having different access performance, and a controller 13, which comprises a corresponding relationship between the virtual page and the pool page, and accesses the pool page corresponding to the virtual page based on accesses to the virtual page from other apparatuses, and the controller 13, based on an access load trend with respect to each virtual page in each time slot, executes processing for deciding an ideal pool page allocation destination for each virtual page in each time slot, and reallocating a virtual page to the ideal pool page at a time, which is prior to a start time, so that the ideal pool page can be allocated to each virtual page by the start time of each time slot.

Abstract: A computing device employs a cooperative memory management technique to dynamically balance memory resources between host and guest systems running therein. According to this cooperative memory management technique, memory that is allocated to the guest system is dynamically adjusted up and down according to a fairness policy that takes into account various factors including the relative amount of readily freeable memory resources in the host and guest systems and the relative amount of memory allocated to hidden applications in the host and guest systems.

Abstract: Exemplary embodiments provide improvement of deduplication efficiency for hierarchical storage systems. In one embodiment, a storage system comprises a storage controller; and a plurality of first volumes and a plurality of external volumes which are configured to be mounted to external devices. The storage controller controls to store related data which are derived from one of the plurality of first volumes in a first external volume of the plurality of external volumes. In another embodiment, the storage controller receives object data from a server and allocates the object data to the plurality of pool volumes. The plurality of pool volumes include a plurality of external volumes which are configured to be mounted to external devices. The storage controller controls to store the object data to the plurality of pool volumes based on object allocation information received from a backup server.