Abstract: Dynamically adjusting a block size in a data transfer operation is disclosed. An indication that a data transfer operation has commenced is received. A first portion of data is read using a first read block size. A first throughput associated with the first read block size is determined. A second portion of data that is different from the first portion of data is read using a second block size that is different from the first read block size. One of the first and second read block sizes is used to complete the data transfer operation based on a comparison of the first throughput and a throughput of the second read block size. This process can be repeated several times as necessary.

Abstract: Disclosed is a method and apparatus for a storage system comprising at least one mobile random access storage device capable of storing first or second data. At least one docking station is associated with an address wherein the address is identifiable by at least one host computer. A first and second sub-address is associated with the at least one docking station wherein the first and second sub-addresses are identifiable by the at least one host computer. The first sub-address corresponds to a first virtual device adapted for storing the first data on a first virtual media. The second sub-address corresponds to a second virtual device adapted for storing the second data on a second virtual media wherein the second virtual media is a different media type from the first virtual media.

Abstract: A method for performing dynamic configuration includes: freezing a bus between a dynamic configurable cache and a plurality of cores/processors by rejecting a request from any of the cores/processors during a bus freeze period, wherein the dynamic configurable cache is implemented with an on-chip memory; and adjusting a size of a portion of the dynamic configurable cache, wherein the portion of the dynamic configurable cache is capable of caching/storing information for one of the cores/processors. An associated apparatus is also provided. In particular, the apparatus includes the plurality of cores/processors, the dynamic configurable cache, and a dynamic configurable cache controller, and can operate according to the method.

Abstract: According to one embodiment, a memory device includes a nonvolatile memory in which data write or data read is executed in units of a plurality of cells, and a controller configured to control the memory and to manage a memory space of the memory by dividing the memory space into a plurality of partitions.

Abstract: Profile properties in a partition profile are user-configurable through a management entity such as a management console. A partition manager calculates a secondary processing unit entitlement for a logical partition based in part on a secondary processing unit mode property in the partition profile. The secondary processing unit entitlement may be smaller than a primary processing unit entitlement for the logical partition. The partition manager reserves processing units from a secondary shared processor pool equal to the logical partition's secondary entitlement for the logical partition. The primary and secondary processing unit entitlements may be stored in primary and secondary configuration data structures associated with the logical partition. The partition manager may relocate the logical partition to the secondary shared processor pool in response to a predetermined condition.

Abstract: A primary processing unit entitlement is determined for a logical partition. A smaller secondary processing unit entitlement is also determined. A partition manager allocates primary processing units to the logical partition from a primary shared processor pool, and the logical partition is activated. The secondary processing units are reserved for the logical partition from a secondary shared processor pool, and the logical partition can be relocated to the secondary shared processor pool in response to a condition such as a hardware failure. The logical partition can continue to process its workload with the fewer processor resources, and can be restored to the primary processing unit entitlement.

Abstract: A partition manager relocates a logical partition from a primary shared processor pool to a secondary shared processor pool in response to a predetermined condition, such as a hardware failure. The relocated logical partition is allocated a smaller quantity of processing units from the secondary pool than it was allocated from the primary pool. A quantity of processing units reserved for a second logical partition is identified in the secondary shared processor pool, and a portion of those reserved processing units are allocated to the relocated logical partition. The reserved processing units may be redistributed among multiple relocated logical partitions.

Abstract: An approach to power economization in a spoke and hub environment is presented. When a hub receives a data set from a first spoke, the hub writes the data set to a first partition that is associated with the first spoke. After the data transfer is complete, the hub powers down the first partition. If the first spoke sends additional data transfers to the hub while the first partition is powered down, the hub stores the additional data transfers in a second partition. When the first partition is powered up again, the hub moves the data intended for the first partition and that was stored in the second partition. The data is moved from the second partition to the first partition. The hub may monitor the size of the addition data transfers. If the data transfer is large, the hub may power up the first partition, write the data in the first partition, and move to the first partition any data that was intended for the first partition but written to the second partition while the first partition was powered down.

Abstract: Unused storage space within a data storage is utilized to store data while effectively making it appear to the operating system, other programs, and the user that the space is still available or unused. The space used to store the hidden data remains available for use by the operating system, other programs and uses upon a request. File system requests are monitored such that the hidden storage area remains hidden from unauthorized processes as well as to restrict operations within the hidden storage area that are attempted by unauthorized processes.

Abstract: A method of allocating regions of memory including the steps of allocating a corresponding plurality of portions of memory for use by the process and marking regions of memory that are allocated with markers. A start of a region is marked with one of the markers and an end of a region is marked with a further one of the markers, the further one of the markers having a later relative time indication and marking a next allocated region. In response to determining that a region of allocated memory bounded by two of the markers is no longer required by the process, deleting an older of the two markers; and in response to detecting deletion of an oldest one of the markers, deallocating the region of memory up to a new oldest pending marker.

Abstract: A hard disk drive or other disk-based storage device comprises a storage disk, a read/write head configured to read data from and write data to the storage disk, and a controller configured to process data received from and supplied to the read/write head and to control positioning of the read/write head relative to the storage disk. The storage disk is partitioned into at least first and second regions, with the first region having a substantially higher average data transfer rate than the second region and being utilized to store data that is accessed more frequently than data stored in the second region. In one embodiment, the data stored in the first region is not stored in the second region or in any other region of the storage disk, and is randomly distributed across a plurality of sectors of the first region. The first region may comprise one or more outer annular zones of the storage disk and the second region may comprise one or more inner annular zones of the storage disk.

Abstract: A memory device is disclosed, and includes an array of memory cells and a partitioning system configured to address a first portion of the array in a single level cell mode, and a second portion of the array in a multi-level cell mode.

Abstract: Domains can also be used to control access to physical memory space. Data in a physical memory space that has been used by a process sometimes endures after the process stops using the physical memory space (e.g., the process terminates). In addition, a virtual memory manager may allow processes of different applications to access a same memory space. To prevent exposure of sensitive/confidential data, physical memory spaces can be designated for a specific domain or domains when the physical memory spaces are allocated.

Abstract: A fixed data region on a storage medium may be allocated with one of a variety of allocation schemes (e.g., a randomly writable allocation scheme, a non-randomly writeable allocation scheme with a first data isolator spacing, a non-randomly writeable allocation scheme with a second data isolator spacing, and a non-randomly writeable allocation scheme with no dynamic isolators). Dynamic sub-region spacing refers at least to the number of data tracks in a data region of a magnetic disc between dynamic isolators and the number of bits in a data region in flash memory between dynamic isolators. The presently disclosed technology adapts isolators on the storage medium to create dynamic sub-regions based on characteristics of the storage medium, characteristics of the data, and/or expected access patterns of data to be written to the storage medium.

Abstract: Memory bandwidth management. In a two-level memory (2LM) system far memory bandwidth utilization at least a far memory is monitored and the available far memory bandwidth availability is dynamically modified based on monitored far memory bandwidth utilization. The operational state of at least one processing core is dynamically modified in response to modification of available far memory bandwidth.

Abstract: According to one embodiment, a memory system includes a non-volatile semiconductor memory, a block management unit, and a transcription unit. The semiconductor memory includes a plurality of blocks to which data can be written in both the first mode and the second mode. The block management unit manages a block that stores therein no valid data as a free block. When the number of free blocks managed by the block management unit is smaller than or equal to a predetermined threshold value, the transcription unit selects one or more used blocks that stores therein valid data as transcription source blocks and transcribes valid data stored in the transcription source blocks to free blocks in the second mode.

Abstract: A method of configuring system memory may include determining a plurality of memory regions supportable on an input/output adapter. The input/output adapter may include a physical function. A memory region of the plurality of memory regions may be allocated to the physical function when an address of the physical function is unknown. The method may further include determining the address of the physical function and associating the address of the physical function with the memory region.

Abstract: Flash memory drives and related methods are disclosed that operate to keep frequently written data, which results in frequently erased blocks, in SLC flash, and relatively static data in MLC flash. A flash drive according to the present disclosure keeps track of the number of times that data for each logical block address (LBA) has been written to the flash memory, and determines whether to store newly received data associated with a particular LBA in SLC flash or in MLC flash depending on the number of writes that have occurred for that particular LBA. For each logical block sent to the flash drive, a comparison is made of the write count of the associated LBA to a threshold. If the write count is above the threshold, the logical block is written to SLC flash. If the write count is below the threshold, the logical block is written to MLC flash.

Abstract: A method is described to partition the memory of application-specific hardware compiled from a software program. Applying the invention generates multiple small memories that need not be kept coherent and are defined over a specific region of the program. The invention creates application specific hardware which preserves the memory image and addressing model of the original software program. The memories are dynamically initialized and flushed at the entries and exits of the program region they are defined in.

Abstract: A RAID system is provided in which, in the event that a rebuild is to be performed for one of the PDs, a filter driver of the operating system of the computer of the RAID system informs the RAID controller of the RAID system of addresses in the virtual memory that are unused. Unused virtual memory addresses are those which have never been written by the OS as well as those which have been written by the OS and subsequently freed by the OS. The RAID controller translates the unused virtual memory addresses into unused physical addresses. The RAID controller then reconstructs data and parity only for the unused physical addresses in the PD for which the rebuild is being performed. This reduces the amount of data and parity that are rebuilt during a rebuild process and reduces the amount of time that is required to perform the rebuild process. In addition, the RAID system is capable of being configured to prevent or reduce data sprawl.

Abstract: Embodiments of the present invention provide a system, method, and program product for defragmenting files on a hard disk drive. A computer system identifies a plurality of movable blocks on a hard disk drive. The computer system categorizes each of the movable blocks into a category based on the write count of each movable block, wherein the movable blocks categorized into a first category have higher write counts than the movable blocks categorized into a second category. The computer system relocates the movable blocks of the first category to a first group of one or more adjacent tracks, and the computer system relocates the movable blocks of the second category to a second group of one or more adjacent tracks, wherein the first group of one or more adjacent tracks and the second group of one or more adjacent tracks share, at most, one common track.

Abstract: Various methods and systems for securing access to hash-based storage systems are disclosed. One method involves receiving information to be stored in a storage system from a storage system client and then generating a key. The key identifies the information to be stored. The value of the key is dependent upon a secret value, which is associated with the storage system. The key is generated, at least in part, by applying a hash algorithm to the information to be stored. The key can then be returned the key to the storage system client. The storage system client can then use the key to retrieve the stored information.

Abstract: A storage system comprises multiple first storage apparatuses, and a controller which provides a first logical volume corresponding to a storage area of the multiple first storage apparatuses to a host computer. The controller partitions a storage area corresponding to the first logical volume into multiple first physical storage areas, manages the partitioned multiple first physical storage areas as physical storage areas of a storage pool, creates a first virtual volume which is provided to the host computer, and associates, from among the multiple first physical storage areas, a physical storage area in which user data is stored, with the first virtual volume.

Abstract: According to an example, in a method for preventing data loss during reboot, a logical storage resource management device may pre-allocate reserved memory for storing a storage resource mapping table, allocate logical storage resources to a data source device before a system is rebooted, record, in the storage resource mapping table, a physical location of the logical storage resources into which data has been written when the data source device writes the data into the logical storage resources, obtain the physical location of the logical storage resources into which the data has been written from the storage resource mapping table when the system is rebooted, set a state of a physical memory block corresponding to the logical storage resources into which the data has been written as used, and release all logical storage resources after the data source device reads the data.

Abstract: A method and an apparatus to scan a stack for references to a heap used in executing a code via the heap are described. The heap may be allocated with fixed and varied sized slots. Each varied sized slot may be referenced by at most one fixed sized slot. Which slots are live may be identified based on the references in the stack. A fixed slot can be live if referenced by the stack. A fixed or varied slot referenced by a live slot can also be live. Varied sized slots referenced by the stack may be identified as pinned. The heap may be de-fragmented to reclaim fixed sized slots which are not live without moving live fixed sized slots and to reclaim varied sized slots which are neither live nor pinned by moving live varied slots.

Abstract: A computer-implemented method is provided for managing a plurality of data objects including dimensional attributes. The method includes receiving a plurality of data objects including dimensional attributes and assigning each of a plurality of nodes to one or more of a plurality of keyspace positions of a keyspace, wherein the plurality of nodes define partitions of the keyspace. A space filling curve is applied to the dimensional attributes of each of the plurality of data objects to generate a plurality of key values which correspond to the plurality of keyspace positions, and each of the plurality of data objects is transmitted to one or more of the plurality of nodes assigned to a keyspace position corresponding to the key value of the respective data object. A system for managing a plurality of data objects including dimensional attributes is further provided.

Abstract: Embodiments of the present invention provide a system, method, and program product for allocating a block of physical storage space on a write surface of a hard disk drive. A computer system maintains a write count for each block on the hard disk drive. After receiving an allocation request, the computer system identifies one or more candidate blocks of storage space on the hard disk drive that can be selected to fulfill the allocation request. The computer system determines an estimated write count and identifies one or more allocated blocks whose write counts are within a specified number of write operations of the estimated write count. The computer system selects a candidate block based, at least in part, on physical proximity of the candidate block to one or more of the allocated blocks whose write counts are within a specified number of write operations of the estimated write count.

Abstract: The storage control device of this invention allocates the physical storage area in RAID groups to virtual volumes in units of chunks including multiple pages. To the virtual volume 5, in accordance with write accesses from the host 20, the physical storage area in the pool is allocated. A RAID group 6 in the pool includes multiple chunks 7. Each chunk 7 includes multiple pages 8. To the virtual volume 5, the physical storage area is allocated in units of chunks 7. From the allocated chunks 7, the pages 8 required for writing write data are used.

Abstract: A memory system, comprises a nonvolatile memory comprising multiple memory cells, and a memory controller configured to control respective cell levels of the memory cells by assigning a logical address of each memory cell to one of multiple address groups according to a frequency with which the logical address has been accessed, determining a cell level for each address group, and controlling each memory cell to have the cell level of the address group to which its logical address is assigned.

Abstract: A mixed storage device includes a set of storage units, each potentially based on a different storage technology, such as NAND flash drive, NOR flash drive, magnetic hard drive, magneto-optical drives, optical drives, etc. The mixed storage device comprises a host bus connector that is used to connect to a peripheral bus that facilitates communication to a processor of a device (such as a PC) and a controller. The controller manages a NAND flash storage device, a NOR flash storage device, an optical storage device, a hard drive and other storage components plugged into or integrated with the mixed storage device.

Abstract: A storage apparatus includes a first data section, a second data section, and a common data section. The first data section stores first data, the second data section stores second data, and the common data section stores common data. The storage apparatus stores a single copy of the common data. The common data and the first data correspond to a first memory bank. The common data and the second data correspond to a second memory bank.

Abstract: Embodiments of the disclosure provide a system and method for dynamically allocating storage capacity in a user equipment buffer. In various embodiments of the invention, a plurality of transport blocks associated with a process are stored in a plurality of subpartitions of a partition of a buffer in a user equipment device.

Abstract: For a storage apparatus where flash memory disks and hard disks coexist, high-density mounting of flash memory modules is achieved. The storage apparatus includes flash memories and a storage controller. A second storage apparatus including magnetic disks is connected to the storage apparatus. The storage controller can form a storage area using a flash memory or a magnetic disk to create a logical volume. When an input/output request is issued from a host computer, if a storage area is formed with a flash memory, the storage controller directly accesses the flash memory to handle the request. When the storage apparatus defines a storage area formed with a flash memory, the storage apparatus defines the storage area by adding up the capacity of a storage area to be provided for the host computer and a substitute area capacity determined in consideration of restrictions on the number deletions of the flash memory.

Abstract: A system and method for use with garbage collected systems and languages, for enabling an allocated heap memory to be updated (e.g., increased or decreased) at runtime, subject to sufficient availability of physical memory. In accordance with an embodiment, a Java Virtual Machine (JVM) is associated with a management console, which allows a systems administrator to monitor current heap utilization at runtime. The heap is visualized as a contiguous chunk of memory with one or more extension points, e.g., by use of a trailing pointer to a null list. If later, at runtime, the heap size needs to be incremented then the trailing pointer can be set to a new chunk of memory with a size of (new value?old value), so that the cumulative new size is made equal to a new value specified on the console.

Abstract: A broadcast receiving apparatus and a method for managing a memory are provided. The method for managing a memory includes setting a part of a memory to be a first memory area to be used for a first operating system; setting a portion of the memory which is not set as the first memory area to be a second memory area; and if a second operating system uses the memory, expanding the first memory area to include at least part of the second memory area. Therefore, the broadcast receiving apparatus uses a plurality of operating systems.

Abstract: Various embodiments comprise apparatuses and methods including a method of reconfiguring partitions in a memory device as directed by a host. The method includes managing commands through a first interface controller to mapped portions of a first memory not having an attribute enhanced set, and mapping portions of a second memory having the attribute enhanced set through a second interface controller. Additional apparatuses and methods are described.

Abstract: Embodiments described herein are directed to providing scalability to software applications. A computer system partitions a portion of data stored in a directory services system into multiple different data partitions. Each data partition includes a primary writable copy and at least one secondary read-only copy of the data. The computer system receives a client request for a portion of the data that is stored in the directory services system and accesses various stored partition mappings to determine which of the different data partitions includes the requested data. The computer system also accesses a dynamic copy locator to determine which of the read-only copies of the indicated partition to access and provide the accessed primary writeable copy of the indicated partition and the determined read-only copy to the client in a virtualized manner so that the client is not aware of the data partitions.

Abstract: A memory device comprising a memory controller and a homogeneous memory accessible by the memory controller, wherein the homogeneous memory is divided by the memory controller in a first memory partition and a second memory partition, wherein the first memory partition is allocated to a first type of information comprising user data and ECC data that are arranged interleaved with the user data, and wherein the second memory partition is allocated to a second type of information comprising further user data.

Abstract: A method and system for binding a preferred CPU to a virtual partition of a computer is disclosed. In one embodiment, a preferred CPU for a virtual partition of a computer is determined upon a receipt of a request to assign a CPU to the virtual partition. Then, the preferred CPU is assigned to the virtual partition when the preferred CPU is available for assignment. Further, the preferred CPU is retained in the virtual partition when the virtual partition is rebooted.

Abstract: A system and method are provided for pooling storage devices in a virtual library for performing a storage operation. A storage management device determines a storage characteristic of a plurality of storage devices with respect to performing a storage operation. Based on a storage characteristic relating to performing the storage operation, the storage management device associates at least two storage devices in a virtual library. The storage management device may continuously monitor the virtual library and detect a change in storage characteristics of the storage devices. When changes in storage characteristics are detected, the storage management device may change associations of the storage device in the virtual library.

Abstract: A method for installing linked MIFARE applications (TK1-A, TK1-B, TK1-C) in a MIFARE memory (MM) being configured as a MIFARE Classic card or an emulated MIFARE Classic memory comprises storing the first linked MIFARE application (TK1-A) in a first free sector of the MIFARE memory, storing the second linked MIFARE application (TK1-B) in a second free sector of the MIFARE memory and writing link information (LK) indicating this second sector in a link information memory location of the first sector where first linked MIFARE application (TK1-A) has been stored, and repeating the steps of storing linked MIFARE applications and writing link information (LK) until the last linked MIFARE application (TK1-C) has been stored.

Abstract: The size of management information pages for storing format management information is minimized and a management size of the management information pages is reduced.

Abstract: A method for resource management in MapReduce architecture. The method includes: determining a ratio r of an input data amount of a Map task and an output data amount of the Map task and an average size R of a record in Map output results; determining a memory size Memory_size that can be allocated to the Map task corresponding to a Map slot; according to the determined r, R and Memory_size, determining an input split size appropriate for the Map task; and allocating an input split with the input split size in a MapReduce job to be processed to the Map task occupying the Map slot. An apparatus for same is also provided.

Abstract: A data storage system includes a processor, a system memory, and logical extents. Blocks of storage in one or more physical storage devices are allocated to each of the logical extents. The processor maintains a logical container for data objects and the volume includes one or more of the logical extents. The processor stores data objects that are uniquely identified by object identifiers in the logical extents. The processor also maintains a first index that is stored in the system memory and maps a range of the object identifiers to a second index. The second index is also stored in a logical extent and indicates storage locations of the data objects associated with the range of the object identifiers.

Abstract: A storage card partition system and a storage card partition method adapted for a mobile phone are disclosed. The system acquires a storage capacity of a storage card in the mobile phone, defines the quantity of partitions, dividing the storage card into the quantity of partitions according to the storage capacity of the storage card, and defining a capacity of each partition, and names each partition to obtain a partition name and defining a relationship between each partition name and at least one suffix name. The system further acquires a suffix name of a file which will be stored to the storage card or has been stored in the storage card and saves the file, based on its suffix, to a corresponding one of the partitions related to the same suffix.

Abstract: A storage device includes: a storage medium; and a control section configured to prompt a host apparatus to perform formatting of the storage medium in accordance with a change of a number of divisions of a storage area of the storage medium.

Abstract: The temporary area capacity required to be secured with respect to the whole permanent area is calculated in accordance with the capacity and access frequency of a host computer data permanent area of a disk device contained in the storage system and a disk device of an external storage device that is managed by a storage virtualization function of this storage system. The nonvolatile memory is defined as the temporary area and is used to temporarily store host computer data when a data I/O from the host computer is processed. The required capacity of the temporary area is re-calculated in accordance with an event such as a configuration change in the external storage system.

Abstract: According to one embodiment, a backup is searched for data to be restored from a volume. The backup comprises multiple disks. The volume is stored in one or more spans on the disks. The spans containing the data to be restored from the volume are identified as desired spans, and a current disk is searched for the desired spans. A first subset of data is read from the desired spans on the current disk. A second subset of data is recorded on an unread list. The second subset of data comprises the data to be restored from the desired spans that are not on the current disk. The remaining data is read from the remaining disks according to the unread list.

Abstract: Embodiments of the inventions relate to granular management of data storage blocks in a data storage system. In one aspect, status values are employed to track “used”, “free”, and “claimed free” storage blocks. A storage block having stored data is identified as used, a storage block available to store data is identified as free, and a storage block having previously stored data removed that has not been reclaimed is identified as claimed free. These values are maintained on a map to track each data block within the data storage system. Available claimed free data blocks are prioritized for data block allocation over available free data blocks for efficient storage, including enabling efficient reclamation of data blocks and minimizing data movement needed for reclamation-oriented de-fragmentation.

Abstract: Embodiments of the inventions relate to granular management of data storage blocks in a data storage system. In one aspect, status values are employed to track “used”, “free”, and “claimed free” storage blocks. A storage block having stored data is identified as used, a storage block available to store data is identified as free, and a storage block having previously stored data removed that has not been reclaimed is identified as claimed free. These values are maintained on a map to track each data block within the data storage system. Available claimed free data blocks are prioritized for data block allocation over available free data blocks for efficient storage, including enabling efficient reclamation of data blocks and minimizing data movement needed for reclamation-oriented de-fragmentation.