text:
Memory partitioning
Subclass of:
711 - Electrical computers and digital processing systems: memory
711170000 - Memory configuring
Patent class list (only not empty are listed)
Deeper subclasses:
|STORAGE SYSTEM AND CONTROLLING SYSTEM AND METHOD THEREOF - A controlling system is used in a storage system. The storage system includes a host and at least one storage device connected to the host in series. The controlling system includes a detecting unit and a partitioning unit. The detecting unit is operable to detect the number of the at least one storage device. The partitioning unit is operable to partition the at least one storage device and generate a partition table and at least one partition information table. The partition table records partition information of the at least one storage device. Each partition information table is stored in a corresponding storage device and records storage information of the corresponding storage device.
|PROCESSING SYSTEM HAVING MEMORY PARTITIONING - Memory resource partitioning code allocates a memory partition in response to a process requesting access to memory storage. Memory partition rules may define attributes of the memory partition. The attributes may include a minimum memory allocation and a maximum memory allocation for the memory partition.
|SOLID STATE MEMORY DEVICE LOGICAL AND PHYSICAL PARTITIONING - Embodiments relate to solid state memory device including a storage array having a plurality of physical storage devices and the storage array includes a plurality of partitions. The solid state memory device also includes a controller comprising a plurality of mapping tables, wherein each of the plurality of mapping tables corresponds to one of the plurality of partitions. Each of the plurality of mapping tables is configured to store a physical location and a logical location of data stored in its corresponding partition.
|STORAGE DEVICE, NON-TRANSITORY COMPUTER READABLE MEDIUM AND METHOD OF CONTROLLING STORAGE DEVICE - A storage device that stores at least one of video data and audio data comprising: a storage medium having a total storage area divided into multiple divided storage areas; a storage processing unit that selects a divided storage area other than a divided storage area that is most recently subjected to storage processing among the multiple divided storage areas, and stores, in a selected divided area, at least one of the video data and the audio data corresponding to a storage period unit; and a divided storage area control unit that performs initialization processing or defragmentation processing to the divided storage area which stores at least one of the video data and the audio data corresponding to the storage period unit.
|Autonomic Self-Tuning of Database Management System in Dynamic Logical Partitioning Environment - Database partition monitoring and dynamic logical partition reconfiguration in support of an autonomic self-tunable database management system are provided by an automated monitor that monitors one or more resource parameters in a logical partition running a database application in a logically partitioned data processing host. The monitor initiates dynamic logical partition reconfiguration in the event that the parameters vary from predetermined parameter values. In particular, the monitor can initiate removal of resources if one of the resource parameters is being underutilized and initiate addition of resources if one of the resource parameters is being overutilized. The monitor can also calculate an amount of resources to be removed or added. The monitor can interact directly with a dynamic logical partition reconfiguration function of the data processing host or it can utilize an intelligent intermediary that listens for a partition reconfiguration suggestion from the monitor. In the latter configuration, the listener can determine where available resources are located and attempt to fully or partially satisfy the resource needs suggested by the monitor.
|SYSTEM FOR ENABLING ACCESS TO ADDITIONAL MEMORY AND STORAGE CAPACITY - An electronic device including a controller having a processor that works with a memory or a storage. The memory or storage has an additional partition that is prevented from being accessed by the processor until enabled with an access logic and a key associated with this partition. A user of the device upgrades it to access the additional partition by running the access logic in the device, being informed that an upgrade is permitted, determining if they wish the upgrade and, if so, then purchasing it, the key being transferred to the device from an external source, and the key being applied with the access logic to enable the partition.
|Network On Chip With Partitions - Data processing with a network on chip ('NOC') that includes integrated processor ('IP') blocks, routers, memory communications controllers, and network interface controller, including: organizing the network into partitions; assigning all IP blocks of a partition a partition identifier ('partition ID') that uniquely identifies for an IP block a particular partition in which the IP block is included; establishing one or more permissions tables associating partition IDs with sources and destinations of data communications on the NOC, each record in the permissions tables representing a restriction on data communications on the NOC; executing one or more applications on one or more of the partitions, including transmitting data communications messages among IP blocks and between IP blocks and memory, each data communications message including a partition ID of a sender of the data communications message; and controlling data communications among the partitions in dependence upon the permissions tables and the partition IDs.
|Partition Transparent Correctable Error Handling in a Logically Partitioned Computer System - A method and apparatus for transparently handling recurring correctable errors to prevent costly system shutdowns for correctable memory errors or system failures from uncorrectable memory errors. When a high number of correctable errors are detected for a given memory location, the hypervisor moves the data associated with the memory location to an alternate physical memory location transparently to the partition such that the partition has no knowledge that the physical memory actualizing the memory location has been changed. Similarly, the hypervisor can move direct memory access (DMA) memory locations using an I/O translation table.
|VIRTUAL REAL MEMORY EXPORTATION FOR LOGICAL PARTITIONS - A computer implemented method, apparatus, and program product for extending virtual memory associated with logical partitions. A hosting partition receives a paging request from a logical partition on a logically partitioned data processing. The hosting partition identifies a location of the physical memory space on a remote computing device assigned to the logical partition and sends an extended virtual memory paging request to an extended virtual memory manager located on the remote computing device using a network connection. The extended virtual memory paging request comprises the instructions for the memory page-in or the memory page-out and the location of the physical memory space on the remote computing device that is being paged-in or paged-out. The extended virtual memory manager performs a page-in operation or a page-out operation in accordance with the instructions for the memory page-in or memory page-out.
|Logical Partition Defragmentation with a Data Processing System - A mechanism, in a data processing system, is provided for logical partition defragmentation. The mechanism gathers resource requirements for a plurality of logical partitions running in a plurality of power domains within one or more servers. The mechanism determines optimal hardware utilization for the plurality of logical partitions. The mechanism migrates one or more of the plurality of logical partitions to run in a subset of the plurality of power domains such that at least one power domain within the plurality of power domains is unused. The mechanism puts the at least one unused power domain in a low power state.
|STORAGE CONTROL APPARATUS AND STORAGE CONTROL METHOD - A storage control apparatus includes a processor. The processor is configured to create management information upon detecting a connection with an information processing apparatus. The processor is configured to set a first logical volume for the information processing apparatus in the management information. The first logical volume is allocated with no physical storage region. The processor is configured to convert, upon receiving a write request for the first logical volume from the information processing apparatus, the first logical volume into a second logical volume by allocating a physical storage region to the first logical volume. The processor is configured to set the second logical volume in the management information.
|Reducing Power-On Time by Simulating Operating System Memory Hot Add - This invention generally provides a method for speeding up system boot time, by initializing a subset of memory during the system firmware test/initialization, and allowing the system to boot an operating system with this subset of installed memory. While the system is completing the operating system boot with the subset of installed memory, a remainder of the installed system memory is being initialized/tested. When the initialization the remainder of system memory is completed (and after the OS has booted), the SMI handler is invoked. The SMI handler then simulates a physical memory "Hot Add" event, and reports the event to the OS. This allows much of the memory initialization/test activity to occur in parallel with the firmware initialization/test and operating system startup processes.
|Managing a Logically Partitioned Computing System Through a Virtual File System - A method, apparatus, and program product for managing partitionable resources in a logically partitioned computing system is disclosed. The method includes associating each of a plurality of partitionable resources in the logically partitioned computing system with a respective file entry in a virtual file system, associating each of a plurality of partitionable resources in the logically partitioned computing system with a respective file entry in a virtual file system, and allocating a first partitionable resource among the plurality of partitionable resources to a first logical partition among the plurality of logical partitions in response to a file system operation directed to the virtual file system to organize a respective file entry for the first partitionable resource within the respective directory for the first logical partition.
|CONTENT PROCESSING APPARATUS - A content processing apparatus includes a taker. A taker takes a plurality of partial contents in an internal memory. A first transferor transfers the plurality of partial contents taken by the taker to an external memory by each partial amount. A creator repeatedly creates link information representing a link state of transfer-destination addresses by the first transferor in the internal memory, in parallel with a transfer process of the first transferor. An updater updates the link information created by the creator so that the plurality of partial contents transferred by the first transferor are combined with each other. A second transferor transfers the link information updated by the updater to the external memory.
|REDUCING OCCUPANCY OF DIGITAL STORAGE DEVICES - A digital data storage device physically stores blocks of identical data only once on its storage medium wherein a second or even further identical blocks are stored only as reference referring to the first block of these identical blocks. By this technique, storage of duplicate data is most effectively avoided on the lowest storage level of the disk storage device, even in cases where identical blocks are written by different operating Systems. In the preferred embodiment, the underlying storage medium (magnetic hard disk, optical disk, tape, or M-RAM) is segmented into two areas, the first area particularly comprising a relatively small block reference table and the remaining physical storage area for storing real blocks of information.
|TECHNIQUES FOR EFFICIENT DATALOADS INTO PARTITIONED TABLES - Techniques for efficiently loading data into a partition of a partitioned table of a database are provided. Data is stored in a swap table and the high water mark of the swap table has been reset prior to storing the data. The swap table is swapped with the partition. After the swap, the swap table becomes the partition of the partitioned table and the partition of the partitioned table becomes the swap table, and the swap table is truncated to reset the high water mark of the swap table.
|STORAGE DEVICE, AND METHOD OF CONTROLLING THE SAME - 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.
|TECHNIQUES FOR OPTIMIZING CONFIGURATION PARTITIONING - Techniques for optimizing configuration partitioning are disclosed. In one particular exemplary embodiment, the techniques may be realized as a system for configuration partitioning comprising a module for providing one or more policy managers, a module for providing one or more applications, the one or more applications assigned to one or more application groups, a module for associating related application groups with one or more blocks, and a module for assigning each of the one or more blocks to one of the one or more policy managers, wherein if one or more of the one or more blocks cannot be assigned to a policy manager, breaking the one or more blocks into the one or more application groups and assigning the one or more application groups to one of the one or more policy managers.
|STORAGE SYSTEM - A storage system according to the present invention includes: a block detecting means for checking whether respective block data obtained by division are already stored in a storage device; and a data writing means for storing the respective block data obtained by division with duplicated storage eliminated into the storage device. The block detecting means detects a share rate representing a rate of a shared portion between a plurality of consecutive block data configuring a predetermined range in write target data among the block data obtained by division and a plurality of block data in a predetermined range already stored consecutively in the storage device. The data writing means, depending on the detected share rate, newly stores the block data obtained by division, into the storage device.
|MANAGEMENT OF RECYCLING BIN FOR THINLY-PROVISIONED LOGICAL VOLUMES - A method for data storage includes representing logical volumes by respective sets of pointers to physical partitions in which data used by the logical volumes is stored. One or more of the logical volumes are defined as provisionally deleted. A subset of the provisionally-deleted logical volumes is selected such that each logical volume in the subset has one or more private physical partitions whose data is used exclusively by that logical volume. One or more of the private physical partitions of the logical volumes in the subset are released for reallocation to another logical volume.
|REDUNDANT, MULTI-DIMENSIONAL DATA PARTITIONING: METHODS, PROGRAM PRODUCT AND SYSTEM - Horizontal partitioning can handle a transaction by accessing a single node only if the transaction is restricted along the single partitioned dimension. Composite partitioning allows for partitioning along more than one dimension, but can only handle a transaction by accessing a single node if the transaction is limited along all partitioned dimensions. A partitioning method partitions a tuple space along more than one dimension and, by storing tuples redundantly, allows transactions restricted along one or more of the partitioned dimensions to be handled by accessing a single node. Other embodiments include a computer program product and a system for partitioning a tuple space.
|Memory management for hypervisor loading - Techniques related to personal computers and devices sharing similar architectures are disclosed. Particularly shown is a system and method for enabling improved performance and security in hypervisor programs and related applications programs achieved through the use of multiple non-volatile memories.
|NONVOLATILE STORAGE AND OPERATING METHODS OF COMPUTING DEVICES INCLUDING THE NONVOLATILE STORAGE - An writing and reading method of a nonvolatile Storage, that includes a first partition and a second partition, and is configured to allow a read operation and a write operation with respect to the second partition only when an authentication is successful in a normal mode, may comprise: assigning a part of a storage space of the second partition to a temporary area by the nonvolatile storage according to a request of changing the normal mode to a secure temporary mode; and/or writing data to the temporary area by the nonvolatile storage. The nonvolatile storage may allow the read operation and with respect to the temporary area without the authentication.
|SELECTION OF A REDUNDANT CONTROLLER BASED ON RESOURCE VIEW - A method, a system and a computer program product for selecting a primary controller for a server system based on the services offered by each controller. A primary controller designator (PCD) utility determines the relative importance of a controller based upon the services provided by the controller and the weighted importance assigned to these services. The PCD utility classifies the services provided by a system-controller according to the following: (1) the number of OS partitions a system-controller is able to communicate with; and (2) the number of hardware devices that a controller has access to. The importance of the services is determined by the host OS partition information and the degree of importance of a partition that utilizes/requires the particular service(s). The PCD utility designates a controller as a "Primary" if the designated "Primary" is capable of providing services that are required for the most important OS partitions, according to the classification of controller services.
|STORAGE SYSTEMS HAVING DIFFERENTIATED STORAGE POOLS - The systems and methods described herein include among other things, systems for providing a block level data storage service. More particularly, the systems and methods of the invention provide a block level data storage service that provides differentiated pools of storage on a single storage device. To this end, the systems and methods described herein leverage the different performance characteristics across the logical block name (LBN) space of the storage device (or devices). These different performance characteristics may be exploited to support two or more classes of storage on a single device.
|HOST COMPUTER, MULTIPATH SYSTEM, PATH ALLOCATION METHOD, AND PROGRAM - Provided is a host computer which is connected to a system resource through n (n≧2) number of paths. The host computer includes: a plurality of logical partitions accessible to the system resource; an allocation unit that allocates the paths to the plurality of logical partitions; and an allocation table. The allocation table is user configurable and stores, in a correlated manner, information indicating the logical partitions and information capable of indicating the number of paths to be allocated to the logical partitions indicated by the information. The allocation unit allocates the paths to the logical partitions in accordance with the allocation table. This makes it possible to secure the I/O response also for logical partitions having a small amount of I/O.
|MANAGING MEMORY AND STORAGE SPACE FOR A DATA OPERATION - Processing a plurality of data units to generate result information, includes: performing a data operation for each data unit of a first subset of data units from the plurality of data units, and storing information associated with a result of the data operation in a first set of one or more data structures stored in working memory space of a memory device; after an overflow condition on the working memory space is satisfied, storing information in overflow storage space of a storage device; and repeating an overflow processing procedure multiple times during the processing of the plurality of data units, the overflow processing procedure including: updating a new set of one or more data structures stored in the working memory space using at least some information stored in the overflow storage space.
|Inter operating system memory hotswap to support memory growth a non-virtualized system - Methods, systems, apparatuses and program products are disclosed for managing memory multiple OSes within a single computer and the like.
|Information Handling System Including Dynamically Merged Physical Partitions - An information handling system includes instruction processing nodes in respective physical partitions. A communications bus couples two information processing nodes together. Each node includes hardware resources such as CPUs, memories and I/O adapters. Prior to a command to merge the physical partitions, the communication bus exhibits a disabled state such that the two information processing nodes are effectively disconnected. After receiving a command to merge the physical partitions, the system enables the communication bus to effectively hot-plug the two nodes together. A modified master hypervisor in one node stores data structures detailing the hardware resources of the two nodes. The modified master may assign resources from one node to a logical partition in another node.
|CAPPING A NUMBER OF LOCATIONS REFERRED TO BY CHUNK REFERENCES - As part of a deduplication process, chunks are produced from data. The chunks are assigned to locations in a data store, where the assignments are such that a number of locations referenced is capped according to at least one predefined parameter.
|SYSTEMS, METHODS, AND PHYSICAL COMPUTER STORAGE MEDIA TO OPTIMIZE DATA PLACEMENT IN MULTI-TIERED STORAGE SYSTEMS - For optimizing data placement in a multi-tiered storage system, system configuration data and system performance data is collected. A plurality of data movement plans are generated, based in part on the system configuration data and the system performance data. A conflict between the plurality of data movement plans are arbitrated to form an execution plan. The data movement plans are performed according to the execution plan.
|MEMORY CONTROLLER, NONVOLATILE STORAGE DEVICE, AND NONVOLATILE STORAGE SYSTEM - A method for use in a nonvolatile storage device that can resize one or more partitions prevents an address management table from becoming complicated after repeated resizing of partitions. When a partition is resized, a logical-to-physical conversion table is updated by shifting a physical block address corresponding to a partition subsequent to the resized partition by the resized amount of the partition. The method enables both logical addresses corresponding to partitions and logical addresses not corresponding to partitions to be constantly continuous to one another.
|System and Method for Distributed Partitioned Library Mapping - A system and method of media library access that utilizes distributed mapping of media library partitions. A first controller can be connected to a data transport element of a media library and a second controller can be connected to a media changer of the media library. The first controller can maintain a media library partition representing a portion of the media library, receive a command from a host application based on the media library partition and forward the command to the second controller. The first controller can further translate logical addresses referenced in the command to physical addresses before forwarding the command to the second controller. The second controller can receive the command from the first controller and forward the command to the media changer. The second controller can also prioritize the command on using a FIFO or other prioritization scheme.
|STORAGE OPTIMIZATION ACROSS MEDIA WITH DIFFERING CAPABILITIES - A storage device can comprise storage media that can have differing characteristics. A storage manager can obtain the characteristics of a storage device, and of individual portions, such as individual media, of the storage device, by querying the device, querying a database, or through empirical observation or testing. The storage manager can then divide the media of the storage device into storage media parts, that can comprise some or all of the individual storage media. Data can then be stored on one or more storage media parts in accordance with the information provided by metadata associated with the data, such that the data is stored on storage media parts that are optimal for such data, from among the available storage media parts, based on the information from the associated metadata.
|SYSTEMS AND METHODS FOR S-LIST PARTITIONING - Systems and techniques of the management of the allocation of a plurality of memory elements stored within a plurality of lockless list structures are presented. These lockless list structures (such as Slists) may be made accessible within an operating system environment of a multicore processor—and may be partitioned within the system. Memory elements may also be partitioned among these lockless list structures. When a core processor (or other processing element) makes a request for allocating a memory element to itself, the system and/or method may search among the lockless list structures for an available memory element. When a suitable and/or available memory element is found, the system may allocate the available memory element to requesting core processor. Dynamically balancing of memory elements may occur according to a suitable balancing metric, such as maintain substantial numerical equality of memory elements or avoid over-allocation of resources.
|METHOD AND SYSTEM FOR PREFERRED CPU BINDING ON VIRTUAL PARTITIONS - 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.
|METHOD AND SYSTEM FOR EXECUTING APPLICATONS, STORAGE MEDIUM CONTROLLER AND STORAGE DEVICE - An application executing method for automatically executing an application stored in a storage unit of an external storage device in an operating system (OS) of a computer host is provided. The method includes dividing the storage unit into a first partition and a second partition; emulating the first partition as compact disc-read only memory (CR-ROM); storing a switch program in the first partition; and storing the application in the second partition. The method also includes providing only the first partition to be accessed by the OS and automatically executing the switch program by the OS to decouple and re-couple the external storage device to the computer host. Additionally, the method further includes providing only the second partition to be accessed by the OS and executing the application when the external storage device is re-coupled to the computer host.
|BOOT PARTITIONS IN MEMORY DEVICES AND SYSTEMS - The present disclosure includes boot partitions in memory devices and systems, and methods associated therewith. One or more embodiments include an array of memory cells, wherein the array includes a boot partition and a number of additional partitions. Sequential logical unit identifiers are associated with the additional partitions, and a logical unit identifier that is not in sequence with the sequential logical unit identifiers is associated with the boot partition.
|STORAGE CONTROL SYSTEM WITH DATA MANAGEMENT MECHANISM OF PARITY AND METHOD OF OPERATION THEREOF - A method of operation of a storage control system includes: partitioning memory channels with memory devices; selecting a super device with one of the memory devices from one of the memory channels; selecting a super block associated with the super device; and determining a location of a parity within the super block when the super block is formed.
|DISK-BASED STORAGE DEVICE WITH FREQUENTLY ACCESSED PARTITION - 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.
|ACQUIRING MULTI-MEDIA CONTENT - A method begins by a dispersed storage (DS) processing module receiving a first sub-set of encoded data slices, wherein a data segment of multi-media content was encoded using a dispersed storage error coding function to produce a set of encoded data slices, wherein the set of encoded data slices is partitioned into the first sub-set of encoded data slices and a second sub-set of encoded data slices. The method continues with the DS processing module sending accessing information when the second sub-set of encoded data slices is to be requested. The method continues with the DS processing module receiving, in response to the accessing information, at least one of the encoded data slices of the second sub-set of encoded data slices such that a decode threshold number of encoded data slices have been received.
|Dynamic Network Adapter Memory Resizing and Bounding for Virtual Function Translation Entry Storage - An approach is provided which a system selects a first virtual function from a plurality of virtual functions executing on a network adapter that includes a memory area. Next, the system allocates, in the memory area, a memory corresponding to the first virtual function. The system then stores one or more translation entries in the allocated memory partition, which are utilized to send data traversing through the first virtual function. As such, the system sends, utilizing one or more of the translation entries, the data packets from the network adapter to one or more destinations. In turn, the system dynamically resizes the memory partition based upon an amount of the memory partition that is utilized to store the one or more translation entries.
|STORAGE SUBSYSTEM AND STORAGE CONTROL METHOD - According to the prior art storage system, in order to add a storage device to a pool after a storage system has been operated for a certain period of time, the performance may be varied significantly according to the access performance of the application using the pool, and it was not possible to realize an optimum allocation corresponding to the operation form if the storage device is set to be included in a pool of a given tier based on the type of the storage device. Therefore, the present invention provides a system in which a performance test is performed in accordance with an access tendency of the application using the pool to thereby compute the tier capable of having the storage device added thereto, based on which the storage device can be allocated to an appropriate pool.
|SEQUENTIAL BLOCK ALLOCATION IN A MEMORY - A region of memory is logically divided into a number of segments, each of which is logically divided into a number of blocks. Blocks are allocated sequentially. A head pointer and a tail pointer demarcate the section of allocated blocks. As allocated blocks are added, the tail pointer is moved so that it remains at the end of the section of allocated blocks. If the tail pointer is within a threshold distance of the head pointer, then the head pointer is moved from its current position to a new position, and the allocated blocks between the current and new positions are freed (deallocated and/or erased). Thus, writes to the memory can be performed sequentially, and blocks can be freed in advance of when they are actually needed.
|FLEXIBLE MEMORY CONTROLLER FOR AUTONOMOUS MAPPING OF MEMORY - A memory controller implements flexible memory mapping for storage of data units in a memory. The memory controller logically partitions the memory into a plurality of blocks or block segments and manages the storage of data units among the plurality of blocks/block segments. The memory controller can operate in one of three modes: a monolithic mode whereby the memory is modeled as a plurality of blocks, whereby each block is treated as a "monolithic" block; a fragmented mode whereby the memory is modeled as a plurality of blocks segments of varying sizes; and a combined mode whereby the memory is initially partitioned into a plurality of equal-sized blocks, and whereby each block can be used as a monolithic block or a fragmented block comprising a plurality of block segments of different sizes, and wherein monolithic blocks can be converted to fragmented blocks and fragmented blocks can be converted back to monolithic blocks.
|INTER-PARTITION COMMUNICATION IN MULTI-CORE PROCESSOR - A multi-core processor includes logical partitions that have respective processor cores, memory areas, and Ethernet controllers. At least one of the Ethernet controllers is disabled for external communication and is assigned as an inter-partition Ethernet controller for inter-partition communication. The inter-partition Ethernet controller is configured in loopback mode. A transmitting partition addresses a message through a send buffer in a private memory area to the inter-partition Ethernet controller assigned to a receiving partition. The receiving inter-partition Ethernet controller copies the received message to a receive buffer in the receiving partition's memory area. The receive Ethernet controller returns the received message to the sending partition and the sending partition resumes control of the memory space of the send buffer, or alternatively, the receive Ethernet controller frees the memory space of the send buffer to the private memory of the sending partition.
|DATA PARTITIONING SCHEME FOR NON-VOLATILE MEMORIES - Systems and methods are disclosed for partitioning data for storage in a non-volatile memory ("NVM"), such as flash memory. In some embodiments, a priority may be assigned to data being stored, and the data may be logically partitioned based on the priority. For example, a file system may identify a logical address within a first predetermined range for higher priority data and within a second predetermined range for lower priority data, such using a union file system. Using the logical address, a NVM driver can determine the priority of data being stored and can process (e.g., encode) the data based on the priority. The NVM driver can store an identifier in the NVM along with the data, and the identifier can indicate the processing techniques used on the associated data.
|MANAGING CPU RESOURCES FOR HIGH AVAILABILITY MICRO-PARTITIONS - 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.
|MANAGING CPU RESOURCES FOR HIGH AVAILABILITY MICRO-PARTITIONS - 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.
|PARTITION MANAGEMENT IN A PARTITIONED, SCALABLE, AND AVAILABLE STRUCTURED STORAGE - Partition management for a scalable, structured storage system is provided. The storage system provides storage represented by one or more tables, each of which includes rows that represent data entities. A table is partitioned into a number of partitions, each partition including a contiguous range of rows. The partitions are served by table servers and managed by a table master. Load distribution information for the table servers and partitions is tracked, and the table master determines to split and/or merge partitions based on the load distribution information.
|SYSTEM AND METHOD TO STORE DATA IN AN ADJUSTABLY PARTITIONABLE MEMORY ARRAY - The disclosure relates to an electronic memory system, and more specifically, to a system for storing data in an adjustably partitionable memory array, and a method to store data in an adjustably partitionable memory array. According to an embodiment of the disclosure, a system to store data in an adjustably partitionable memory array is provided, the system including a plurality of memory cells arranged in an array of rows and columns, a plurality of bit lines, and a plurality of switches, wherein each bit line is electrically coupled to a column of memory cells and each bit line comprises a switch configured to allow the respective bit line to be partitioned by opening of the switch.
|Massively Scalable Object Storage for Storing Object Replicas - An example method for storing data includes providing a plurality of physical storage pools, each storage pool including a plurality of storage nodes coupled to a network. The method also includes mapping a partition of a plurality of partitions to a set of physical storage pools, where each physical storage pool of the set of physical storage pools is located in a different availability zone, and the storage nodes within an availability zone are subject to a correlated loss of access to stored data. The method further includes receiving a data management request over the network, the data management request being associated with a data object. The method also includes identifying a first partition of the plurality of partitions corresponding to the received data management request and manipulating the data object in the physical storage pools mapped to the first partition in accordance with the data management request.
|METHOD AND APPARATUS FOR APPLYING DATABASE PARTITIONING IN A MULTI-TENANCY SCENARIO - A method and apparatus for applying database partitioning in a multi-tenancy scenario is disclosed, the method includes providing, in each database table of a partitioned database system storing tenant data, a partition key field for storing a respective partition key for each tenant within a plurality of tenants. The respective partition key for each tenant is designated for each tenant according to a partition designated for the each respective tenant and the corresponding relationships between partitions and partition keys in the database partitioning mechanism of the partitioned database system. The respective partition key is used by the partitioned database system to perform database partitioning operations on the data of each respective tenant.
|Keeping File Systems or Partitions Private in a Memory Device - Disclosed is a method and apparatus for allowing a user to select, from a plurality of partitions on a memory device, which partitions may be visible to hosts connecting to the memory device.
|STORAGE CONTROL SYSTEM WITH WRITE AMPLIFICATION CONTROL MECHANISM AND METHOD OF OPERATION THEREOF - A method of operation of a storage control system includes: partitioning logical addresses into a number of subdrives, the logical addresses associated with a memory device; and monitoring a data write measure of one of the subdrives.
|CLOUD SCALE DIRECTORY SERVICES - 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.
|Serial Attached Storage Drive Virtualization - Techniques are provided for an access device, such as a Serial Attached Small Computer System Interface (SAS) expander, that is in communication with a storage device to subdivide the storage space of the storage device into a plurality of logical storage spaces, where the access device mediates storage and retrieval of data to and from the storage device. The access device maintains a unique identifier assigned to each of the logical storage spaces. Storage and retrieval of data to and from at least one of the logical storage spaces by way of the access device is based on the assigned unique identifier. The storage space may be subdivided using logical block addresses (LBAs) of the storage device without physically partitioning the available storage on the storage device.
|POOLED PARTITION LAYOUT AND REPRESENTATION - 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.
|Selecting a Target Number of Pages for Allocation to a Partition - In an embodiment, a target number of discretionary pages is calculated for a first partition. If the target number of discretionary pages for the first partition is less than a number of the discretionary pages that are allocated to the first partition, a result page is found that is allocated to the first partition and the result page is deallocated from the first partition. If the target number of discretionary pages for the first partition is greater than the number of the discretionary pages that are allocated to the first partition, a free page is allocated to the first partition.
|METHOD AND APPARATUS FOR ALLOCATING RESOURCES IN A COMPUTER SYSTEM - Embodiments of the present invention provide a computer system, comprising at least two logical partitions, each partition having allocated computing resources, wherein the computing resources allocated to a first partition include memory storing a file system accessible by processes executing in the first partition; and a partition resource allocator, wherein the partition resource allocator is arranged to migrate the memory storing the file system from the first partition to a second partition, such that the file system is accessible by processes executing in the second partition.
|STORAGE APPARATUS AND DATA CONTROL METHOD OF THE SAME - The relay unit splits the storage area in the buffer into a plurality of partitioned areas, manages the same and, upon receiving a read request from the access request source, selects and allocates one or more from the plurality of partitioned areas and, on condition that the relevant partitioned areas are allocated, transmits the read request to the memory control unit, wherein the memory control unit reads the data requested in the received read request from the memory, splits the data which is read into a plurality of units, and transmits the same to the relay unit, wherein the relay unit stores each of the data transmitted from the memory control unit in each of the allocated partitioned areas sequentially, on condition that all of the data is stored, reads each of the data from each of the allocated partitioned areas, compiles each of the data which is read into one, transmits the same as read data to the access request source, and releases all of the respective allocated partitioned areas.
|Dynamic Logical Partition Management For NUMA Machines And Clusters - A partitioned NUMA machine is managed to dynamically transform its partition layout state based on NUMA considerations. The NUMA machine includes two or more NUMA nodes that are operatively interconnected by one or more internodal communication links. Each node includes one or more CPUs and associated memory circuitry. Two or more logical partitions each comprise at a CPU and memory circuit allocation on at least one NUMA node. Each partition respectively runs at least one associated data processing application. The partitions are dynamically managed at runtime to transform the distributed data processing machine from a first partition layout state to a second partition layout state that is optimized for the data processing applications according to whether a given partition will most efficiently execute within a single NUMA node or by spanning across a node boundary. The optimization is based on access latency and bandwidth in the NUMA machine.
|MEMORY MANAGEMENT SYSTEM AND METHOD - A technique for managing memory allocation in an electronic device is provided. In one embodiment, a method includes loading a memory allocation strategy for an application executed by a processor of a device, and requesting memory for the application from various memory locations in accordance with the memory allocation strategy. In one embodiment, the device includes multiple sets of contiguous memory blocks and a memory heap, memory may be requested from at least one of these memory locations, and memory may then be allocated to the application in response to the request. In some embodiments, the memory allocation strategy may be stored in the device prior to execution of the application. Various other methods, devices, and manufactures are also provided.
|MEMORY CONTROLLER, NONVOLATILE MEMORY MODULE, ACCESS MODULE, AND NONVOLATILE MEMORY SYSTEM - An address management part
|METHODS, SYSTEMS, AND COMPUTER READABLE MEDIA FOR MEMORY ALLOCATION AND DEALLOCATION - Methods, systems, and computer readable media for memory allocation and de-allocation are disclosed. According to one aspect, a method for allocation and de-allocation of memory includes dividing a memory space into a plurality of records of fixed size and maintaining an allocation map for indicating, for each record in the memory space, whether the record is allocated or unallocated. The method also includes maintaining a set of lists of unallocated blocks, where a block is a group of contiguous records, where the size of a block is the number of contiguous records in the block, and where each list lists unallocated blocks of a particular size. The method also includes processing requests for allocation and de-allocation of memory. Processing a request for memory allocation includes using the set of lists to find an unallocated block of the smallest size that is equal to or greater than the amount of memory requested to be allocated. Processing a request for memory de-allocation includes using the allocation map to combine the deallocated memory block with an unallocated block contiguous to the deallocated memory block and add the combined blocks to the list indicating unallocated blocks of the size of the combined memory blocks.
|WORKLOAD-AWARE DISTRIBUTED DATA PROCESSING APPARATUS AND METHOD FOR PROCESSING LARGE DATA BASED ON HARDWARE ACCELERATION - A workload-aware distributed data processing apparatus and method for processing large data based on hardware acceleration are provided. The data processing apparatus includes a memory buffer including partitions. The data processing apparatus further includes a partition unit configured to distribute a mapping result to the partitions based on a partition proportion scheme. The data processing apparatus further includes a reduce node configured to receive content of a corresponding one of the partitions, and perform a reduction operation on the content to generate a reduce result.
|MANAGING CPU RESOURCES FOR HIGH AVAILABILITY MICRO-PARTITIONS - 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.
|Intelligent storage device controller - In a particular embodiment, a storage device includes a controller that is adapted to receive environmental data from a plurality of environmental sensors, where the environmental data is related to an operating environment of the storage device. Further, the controller is adapted to receive state information related to the data storage medium from a plurality of firmware detectors, to weight the received environmental data and the received state information according to a pre-determined weighting table, and to dynamically manage at least one attribute of the storage device based on the weighted environmental data and the weighted state information.
|CONTROLLING CIRCUIT APPLICABLE IN PHYSICAL STORAGE DEVICE AND RELATED METHOD - A controlling circuit applicable in a physical storage device includes: a dividing circuit coupled to the physical storage device for dividing a storage capacity of the physical storage device into a plurality of divided storage areas, wherein a divided storage capacity of each divided storage area is not larger than the capacity corresponding to the largest address generated by an operating system; and a feedback circuit coupled to the dividing circuit for feeding back the plurality of divided storage areas to the operating system such that the operating system regards the plurality of divided storage areas as a plurality of independent physical storage devices.
|AUTOMATICALLY ALIGNING VIRTUAL BLOCKS TO PHYSICAL BLOCKS - Automatically aligning virtual blocks of partitions to blocks of underlying physical storage is disclosed. In some embodiments, a starting offset of a partition included in a logical container is detected. In some embodiments, a misalignment correction amount for a partition included in a logical container is detected. In some embodiments, a misalignment associated with a partition included in a logical container is corrected.
|CREATING A SELF-CONTAINED PORTABLE OUTPUT FILE - Various embodiments provide for creating a self-contained portable output file that includes a de-duplicated version of data. According to one embodiment, data, which includes a selected group of files, is partitioned into subblocks. A de-duplicated version of the data is created by eliminating a second subblock from the data and using a first subblock to represent the second subblock, if the second subblock is a duplicate of the first subblock. A self-contained portable output file, which includes the de-duplicated version of the data, is created.
|VERIFICATION OF DYNAMIC LOGICAL PARTITIONING - Embodiments of the present invention disclose a method, computer program product, and system for verifying transitions between logical partition configurations. A computer system divides the physical resources of a processing core into logical partitions, each of which has at least one processing subcore. The computer system loads the contexts of the logical partitions and assigns test cases to each processing subcore. The processing subcore executes the test case, verifying the context of the logical partition. The computer system reassigns the test cases to different processing cores in anticipation of reconfiguring the number of logical partitions on the processing core. The computing system reconfigures the number of logical partitions on the processing core and executes the test cases as assigned on the reconfigured logical partitions. (124 words)
|METHODS OF ACCESSING MEMORY CELLS, METHODS OF DISTRIBUTING MEMORY REQUESTS, SYSTEMS, AND MEMORY CONTROLLERS - Methods of accessing memory cells, methods of distributing memory requests, systems, and memory controllers are described. In one such method, where memory cells are divided into at least a first region of memory cells and a second region of memory cells, memory cells in the first region are accessed according to a first address definition and memory cells in the second region are accessed according to a second address definition that is different from the first address definition. Additional embodiments are described.
|BLOCK-BASED STORAGE DEVICE WITH A MEMORY-MAPPED INTERFACE - Described herein are methods for accessing a block-based storage device having a memory-mapped interface and a block interface. In one embodiment, an apparatus (e.g., block-based storage device) includes a storage array to store data and a memory-mapped interface that is coupled to the storage array. The memory-mapped interface includes memory-mapped memory space. The memory-mapped interface receives direct access requests from a host to directly access memory-mapped files. The apparatus also includes a block interface that is coupled to the storage array. The block interface receives block requests from a storage driver to access the storage array.
|Memory Management System - This memory management system has: (a) a logical partition management unit that manages allocation and release of a virtual memory used by an application in a logical address space; (b) a physical partition management unit that manages allocation and release of small size parts into which a physical memory is divided in a physical address space; and (c) a converter unit that converts an address between the logical address space and the physical address space.
|ALLOCATION OF DISTRIBUTED DATA STRUCTURES - Allocating distributed data structures and managing allocation of a symmetric heap can include defining, using a processor, the symmetric heap. The symmetric heap includes a symmetric partition for each process of a partitioned global address space (PGAS) system. Each symmetric partition of the symmetric heap begins at a same starting virtual memory address and has a same global symmetric break. One process of a plurality of processes of the PGAS system is configured as an allocator process that controls allocation of blocks of memory for each symmetric partition of the symmetric heap. Using the processor executing the allocator process, isomorphic fragmentation among the symmetric partitions of the symmetric heap is maintained.
|METHODS AND SYSTEMS FOR FORMATTING STORAGE VOLUMES - Methods, systems, and computer storage mediums including a computer program product method for formatting storage volumes are provided. One method includes creating a storage volume including a global counter and partitioned into multiple storage segments including a segment counter and partitioned into multiple stripes, wherein the global counter and each segment counter match at an initial time. The method further includes receiving a command to write data to a first stripe, comparing a first segment counter associated with the segment, determining if the segment and global counters match, and re-initializing first metadata associated with the segment to indicate the first segment requires formatting if the counters do not match. One system includes a processor for performing the above method and one computer storage medium includes a computer program product configured to perform the above method.
|GENERATION AND UPDATE OF STORAGE GROUPS CONSTRUCTED FROM STORAGE DEVICES DISTRIBUTED IN STORAGE SUBSYSTEMS - A plurality of storage subsystems and a plurality of storage devices are maintained, and wherein each storage subsystem includes at least one storage device of the plurality of storage devices. A plurality of storage groups is generated, wherein each storage group includes one or more storage devices selected from the plurality of storage devices, and wherein the one or more storage devices selected in each storage group are included in at least two different storage subsystems. The plurality of storage groups is adjusted based on: (a) usage statistics of the data, wherein the usage statistics are stored in a log file; and (b) properties and organization of the data stored in a plurality of data structures.
|IMPLEMENTING OPTIMAL STORAGE TIER CONFIGURATIONS FOR A WORKLOAD IN A DYNAMIC STORAGE TIERING SYSTEM - A method for Dynamic Storage Tiering (DST) may include identifying a first storage tier with a performance characteristic. The method may include monitoring the utilization of the first storage tier to detect the placement of a hot spot. The method may include logically dividing a continuous range of a plurality of logical addresses into at least a first segment and a second segment so the first segment includes a proportionally larger amount of the hot spot. The method may include moving the first segment into a second storage tier or moving the second segment into the second storage tier. The method may include determining an amount of utilization of the first storage tier by hot spots. The method may include recommending a change in an amount of storage space in the first storage tier based upon the amount of utilization of the first storage tier by the hot spots.
|GPU SUPPORT FOR GARBAGE COLLECTION - A system and method for efficient garbage collection. A general-purpose central processing unit (CPU) partitions an allocated heap according to a generational garbage collection technique. The generations are partitioned into fixed size cards. The CPU marks indications of qualified dirty cards during application execution since the last garbage collection. When the CPU detects a next garbage collection start condition is satisfied, the CPU sends a notification to a special processing unit (SPU) corresponding to a determination of one or more card root addresses, each card root address corresponding to one of said marked indications. The SPU has a single instruction multiple data (SIMD) parallel architecture and may be a graphics processing unit (GPU). The SPU may utilize the parallel architecture of its SIMD core to simultaneously compute multiple card root addresses. Following, the SPU sends these addresses to the CPU to be used in a garbage collection algorithm.
|VOLUME CLASS MANAGEMENT - A method for setting up and managing large numbers of storage volumes is disclosed. In one embodiment, such a method enables a user to establish a volume class comprising various volume attributes. The method further enables the user to assign a volume or range of volumes to the volume class. Once the volume or range of volumes is assigned to the volume class, the method automatically sets up, without user invention, the volumes with the attributes designated for the volume class. When a new volume is assigned to the volume class, the method automatically sets up the new volume with the attributes of the volume class, including automatically calculating a VTOC size for the new volume based on VTOC sizes for volumes already assigned to the volume class. A corresponding apparatus and computer program product are also disclosed.
|On-Die Logic Analyzer For Semiconductor Die - In one embodiment, the present invention includes a semiconductor die such as a system on a chip (SoC) that includes a logic analyzer with a built-in trace buffer to store information communicated between on-die agents at speed and to provide the information to an off-die agent at a slower speed. Other embodiments are described and claimed.
|COMPOSITE HASH AND LIST PARTITIONING OF DATABASE TABLES - A method for partitioning during an online node add. The method includes providing a data storage cluster with first and second nodes, and storing a table of data in the data storage cluster with a first partition storing a set of rows or data elements in the first node and a second partition storing a set of rows or data elements in the second node. The method includes adding a third node to the cluster and adding a third partition to the table using a partitioning mechanism to create a distribution mapping for data elements in the first, second, and third partitions. The distribution mapping provides substantially uniform distribution of the data elements over the first, second, and third partitions by the partitioning mechanism using modulo hash partitioning as a function of data elements or by combining hash and list partitioning such that data is retained on the original partitions.
|SYSTEM AND METHOD FOR OPTIMIZING INTERRUPT PROCESSING IN VIRTUALIZED ENVIRONMENTS - An approach is provided that retrieves a time spent value corresponding to a selected partition that is selected from a group of partitions included in a virtualized environment running on a computer system. The virtualized environment is provided by a Hypervisor. The time spent value corresponds to an amount of time the selected partition has spent processing interrupts. A number of virtual CPUs have been assigned to the selected partition. The time spent value (e.g., a percentage of the time that the selected partition spends processing interrupts) is compared to one or more interrupt threshold values. If the comparison reveals that the time that the partition is spending processing interrupts exceeds a threshold, then the number of virtual CPUs assigned to the selected partition is increased.
|DEGENERATION METHOD AND INFORMATION PROCESSING APPARATUS - By including detecting an abnormality in a first system common unit; reading a priority indication, from the storage portion, indicating whether or not the first system common unit is to be degenerated when an abnormality occurs in the first system common unit for each of the partitioned portions; carrying out, when an abnormality is detected in a partitioned portion to which the priority indication is set, suspend processing on the information processing apparatus by the system control portion on the partitioned portion; and carrying out degeneration processing for suspending operation of the first system common unit and switching to the second system common unit, quick recovery is achieved when a significant partition is down due to a fault experienced in a common unit.
|Systems and Methods for Entitlement of Virtual Real Memory for Applications - Systems, methods and media for dynamic reallocation of memory to an application, the memory from a pool of virtual real memory allocated to a virtual client that executes the application are disclosed. In one embodiment, a virtual client is allocated a pool of virtual real memory. A subset of this pool of virtual real memory is a block of memory allocated for use by an application. The allocation may be stated as a range of allocated memory with an upper and lower limit. The application calls a kernel service when it thinks it needs a new allocation of memory. The new allocation is established by a power hypervisor connected to the virtual client. Memory is exported by way of a Paging Space Partition.
|MIGRATING MEMORY DATA BETWEEN PARTITIONS - A method, system, and computer usable program product for migrating memory data between partitions are provided in the illustrative embodiments. All or a portion of a memory data of the source partition is written to a data storage unit, which may be a shared paging space, or a shared area of a data storage unit other than a paging space. The writing uses a first data communication path configured for paging the memory data. The portion of the memory data from the data storage unit is read at a destination partition. The reading uses a second data communication path configured for paging a second memory data. The read portion of the memory data may be used for executing a migrated application. The writing and reading may use a third and a fourth data communication paths respectively that may be configured for paging memory data to the shared area.
|Memory Management System - This memory management system has: (a) a logical partition management unit that manages allocation and release of a virtual memory used by an application in a logical address space; (b) a physical partition management unit that manages allocation and release of small size parts into which a physical memory is divided in a physical address space; and (c) a converter unit that converts an address between the logical address space and the physical address space.
|MULTI-LEVEL DATA PARTITIONING - Based on one or more first columns of a table partitioned at a first level over multiple first level partitions, a first partition criteria is evaluated for a data record. Each of the at least first level partitions is further partitioned into a same number of second-level partitions using a same second partitioning method for all first level partitions. One first level partition is identified for storage of the data record, for example by determining the one of the at least two data server processes using the first partition criteria and a first partitioning method that differs from the second partitioning method. Based on one or more second columns of the table, a second partition criteria is evaluated for the data record, and the data record is stored in one of the second-level partitions of the at least two first level partitions.
|SCALING ENERGY USE IN A VIRTUALIZED ENVIRONMENT - A method, system, and computer usable program product for scaling energy use in a virtualized data processing environment are provided in the illustrative embodiments. A set of PIOAs is configured such that each PIOAs in the set of PIOAs is a functional equivalent of another PIOAs in the set of PIOAs. A utilization of each PIOA in the set of PIOAs is measured. A number of PIOAs needed to service a workload is determined. A first subset of PIOAs from the set of PIOAs is powered down if the number of PIOAs needed to service the workload is smaller than a number of operational PIOAs. The I/O operations associated with the first subset of PIOAs are transferred to a second subset of PIOAs remaining operational in the set of PIOAs.
|EFFICIENT ALLOCATION AND RECLAMATION OF THIN-PROVISIONED STORAGE - 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.
|EFFICIENT ALLOCATION AND RECLAMATION OF THIN-PROVISIONED STORAGE - 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.
|MEMORY MANAGEMENT APPARATUS AND METHOD FOR THREADS OF DATA DISTRIBUTION SERVICE MIDDLEWARE - Disclosed herein are a memory management apparatus and method for threads of Data Distribution Service middleware. The apparatus includes a memory area management unit, one or more thread heaps, and a queue. The memory area management unit partitions a memory chunk allocated for the DDS middleware by a Cyber-Physical System on a memory page basis, manages the partitioned memory pages, and allocates the partitioned memory pages to the threads of the DDS middleware that have requested memory. The thread heaps are provided with the memory pages allocated to threads of the DDS middleware by the memory area management unit, and manage the provided memory pages. The queue receives memory used pages returned by the thread heaps. The thread heaps are provided with the memory pages for the threads by the queue if a memory page is not present in the memory area management unit when the threads request memory.
|FILE STORAGE METHOD AND APPARATUS - A file storage method includes: splitting each of multiple files into one or more file block objects with different sizes; and writing the file block objects obtained from file splitting into corresponding large object storage files, wherein a preset number of large object storage files are pre-created in a storage apparatus, and storage spaces occupied by the preset number of large object storage files in the storage apparatus are continuous.
|STORAGE SYSTEM - The storage system includes a data storage controlling unit that stores a plurality of units of block data, generated by dividing storage target data, in a distributed manner in a plurality of storage devices, and performs duplicate storage elimination. The data storage controlling unit stores a plurality of continuous units of block data of the storage target data, generated by dividing the storage target data, in a particular storage device among the plurality of storage devices, stores, in the particular storage device, feature data based on the data content of the block data and storing position information representing the storing position in the particular storage device of the block data in association with each other as a storing position specifying table, and stores storage device identifying information for identifying the particular storage device and the feature data of the block data stored in the particular storage device in association with each other as a storage device specifying table.
|REGION MANAGEMENT APPARATUS, REGION MANAGEMENT METHOD, AND PROGRAM - To provide a technology that, regardless of the capacity of a storage device, enables its areas to be flexibly partitioned and managed, and, when a file is allocated to a region also, can also use its areas effectively by means of an efficient method. When a region size of a storage device is expressed as the sum of mutually differing power-of-2 values, and areas whose size is one of the power-of-2 sizes configuring that sum are taken to be master partitions, to partition the areas into partitions each of whose size is the size made by successively dividing each master partition in half and to generate an allocation table holding allocation information expressing the allocation status of each of the files that have partitions with each of the sizes included in the master partitions. To manage a region based on the allocation information stored in the allocation table.
|STORAGE CARD PARTITION SYSTEM AND METHOD - 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.
|MEMORY MANAGER - A memory management device including a plurality of outputs, each output configured to interface to respective one of a plurality of memories; and a controller configured to cause each buffer allocated to the memories to be divided up substantially equally between each of the plurality of memories.
|System and Method For Providing Compact Mapping Between Dissimilar Memory Systems - A memory mapping system for compactly mapping dissimilar memory systems and methods for manufacturing and using same. The mapping system maps a source memory system into a destination memory system by partitioning the source memory system and disposing memory contents within the partitioned source memory system into the destination memory system. In one embodiment, the mapping system factorizes a source data width of the source memory system in terms of a destination data width of the destination memory system to form at least one data sub-width. A source memory sub-region is defined for each data sub-width. The memory contents associated with each source memory sub-region are disposed within the destination memory system in a side-by-side manner across selected destination memory registers of the destination memory system. The mapping system thereby can compactly map the memory contents into the destination memory system without a loss of valuable memory space.
|MANAGEMENT METHOD FOR A VIRTUAL VOLUME ACROSS A PLURALITY OF STORAGES - A first storage system includes a plurality of first storage devices and is coupled to a computer. A second storage system includes a plurality of second storage devices and is coupled to the first storage system. A first controller provides a thin provisioning logical volume (LU) to the computer. A second controller provides an external thin provisioning LU to the first storage system. The first controller provides pool areas associated with the thin provisioning LU, including a first pool area mapped to the external thin provisioning LU, and allocates the first pool area to a first region in the thin provisioning LU to store a write data to the first region in the thin provisioning LU. The second controller allocates at least one of a plurality of pool areas to store the write data to the first region in the thin provisioning LU.
|DISPERSED STORAGE UNIT AND METHOD FOR CONFIGURATION THEREOF - A dispersed storage (DS) unit for use within a dispersed storage network is capable of self-configuring using registry information provided to the DS unit. The registry information includes a slice name assignment indicating a range of slice names corresponding to a plurality of potential data slices of potential data objects to be stored in the DS unit. Based on the registry information, the DS unit allocates a portion of physical memory to store the potential data slices.
|Partitioning Data Within A Distributed Data Storage System Using Virtual File Links - A record within a destination virtual file is generated on a destination node of a distributed data storage system. The record comprises (i) a link directed to a partition of a source virtual file stored on a source node and (ii) partition criteria characterizing the partition. The source virtual file is mapped to a chain of linked pages stored in a page buffer of the distributed data storage system and the partitioning criteria is used by at least one of the source node and the destination node to identify data associated with the partition. A request is later received at the destination node to access data defined by the destination virtual file. Data is provided, in response to the request, from the partition of the source virtual file stored on the source node using the link and the partitioning criteria. Related apparatus, systems, techniques and articles are also described.
|RESOURCE MANAGEMENT IN MAPREDUCE ARCHITECTURE AND ARCHITECTURAL SYSTEM - 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.
|MEMORY STORAGE DEVICE, MEMORY CONTROLLER THEREOF, AND METHOD FOR AUTOMATICALLY CREATING FILL-FILE THEREOF - A memory storage device, a memory controller thereof, and a method for automatically creating a fill-file thereof are provided. In the present method, a plurality of logical addresses is configured and grouped into a plurality of logical blocks to be mapped to physical blocks of a memory chip in the memory storage device. When a host system is powered on, whether the logical addresses have been formatted into a partition is determined. If the logical addresses have been formatted into a partition, whether a fill-file of a predetermined file capacity exists is determined. If the fill-file does not exist, data related to the fill-file is respectively filled into a file allocation table (FAT) and a root directory of the formatted partition when the host system reads the FAT and the root directory, so as to automatically create the fill-file.
|SHARED PHYSICAL MEMORY - A computer implemented method for sharing physical memory among logical partitions. A computer reserves physical memory of a Central Electronic Complex (CEC) for communication within the CEC as a shared memory pool. The computer creates a first logical partition using resources of the CEC that are not reserved as the shared memory pool. The computer creates a second logical partition using resources of the CEC that are not reserved as the shared memory pool. The computer creates a virtual local area network (VLAN) having at least two addresses within the CEC. The computer allocates a portion of the shared memory to the VLAN as the shared memory pool.
|DATA PRESERVATION METHOD - A data preservation method applicable to an electronic device operating with an open operating system having a data storage region includes creating a disk partition; creating an authority to access the disk partition and get linked to a group ID (GID); mounting the disk partition in a directory having a user ID (UID) and the GID; and giving authority related to the linked GID to an application having the authority, so as to access data in the disk partition having the GID. The authority, coupled with the GID, allows a specific disk partition to store data generated as a result of execution of the application. Even if the application causes a UID change later for some reason, the application bestowed with the authority can still access data through the GID, thereby preserving data.
|VERIFICATION OF DYNAMIC LOGICAL PARTITIONING - Embodiments of the present invention disclose a method, computer program product, and system for verifying transitions between logical partition configurations. A computer system divides the physical resources of a processing core into logical partitions, each of which has at least one processing subcore. The computer system loads the contexts of the logical partitions and assigns test cases to each processing subcore. The processing subcore executes the test case, verifying the context of the logical partition. The computer system reassigns the test cases to different processing cores in anticipation of reconfiguring the number of logical partitions on the processing core. The computing system reconfigures the number of logical partitions on the processing core and executes the test cases as assigned on the reconfigured logical partitions.
|CLIENT PARTITION SCHEDULING AND PRIORITIZATION OF SERVICE PARTITION WORK - A method in a data processing system is provided for processing a service request of a client partition. The method includes: obtaining by a service partition of the data processing system the service request from the client partition, wherein both the client and service partitions execute above a hypervisor of the data processing system; and processing the service request by the service partition utilizing a processor quantum assigned to the client partition and donated by the client partition to the service partition. The client partition controls scheduling of the service partition by queuing the service request at the client partition until the client partition decides to proceed with execution of the service request by the service partition. In one implementation, the service partition is a partition adjunct of the data processing system, which utilizes donated virtual address space of the client partition.
|FIRMWARE MANAGEMENT OF STORAGE CLASS MEMORY - A computer program product is provided and includes a tangible storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for detecting connections of two or more input/output (I/O) adapters, each of the two or more I/O adapters having one or more solid state devices (SSDs) connected thereto, and presenting a storage class memory address space for all of the connected SSDs that is independent of connections and disconnections between each of the one or more SSDs and each of the two or more I/O adapters and the processing unit.
|STORAGE SYSTEM - 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.
|METHOD AND APPARAUTS FOR DATA STORAGE AND ACCESS - A query cache stores queries and corresponding results of the queries, the results of the queries being derived from a primary store. A differential store stores a pointer to data of the primary store which has changed and which affects the result of the queries stored in the query store. A new query may be satisfied by accessing the corresponding query in the query store and determining, by reference to the differential store, whether data relating to the query in the primary store has changed since the query store was compiled and, completing the new query, by accessing the corresponding data in the primary store, if applicable. Data in the differential store may be arranged and partitioned according to labels. The partitioning may be varied according to predetermined rules.
|ALLOCATION OF DISTRIBUTED DATA STRUCTURES - Allocating distributed data structures and managing allocation of a symmetric heap can include defining, using a processor, the symmetric heap. The symmetric heap includes a symmetric partition for each process of a partitioned global address space (PGAS) system. Each symmetric partition of the symmetric heap begins at a same starting virtual memory address and has a same global symmetric break. One process of a plurality of processes of the PGAS system is configured as an allocator process that controls allocation of blocks of memory for each symmetric partition of the symmetric heap. Using the processor executing the allocator process, isomorphic fragmentation among the symmetric partitions of the symmetric heap is maintained.
|STORAGE SYSTEM AND MANAGEMENT METHOD THEREOF - A storage system having at least two storage apparatuses capable of partitioning an internal resource into logical partitions and managing the logical partitions, and which replicates data written into a primary volume of a primary storage apparatus as the replication source storage apparatus to a secondary volume of a secondary storage apparatus as the replication destination storage apparatus, including: a configuration information sending unit for sending configuration information of the logical partition, to which the primary volume belongs, to the secondary storage apparatus; and a logical partition setting unit for setting the configuration of the logical partition to which the secondary volume belongs based on the configuration information of the logical partition to which the primary volume belongs sent from the configuration information sending unit.
|Split Heap Garbage Collection - 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.
|STAGGERED PROGRAMMING FOR RESISTIVE MEMORIES - Subject matter disclosed herein relates to a memory device and method of programming same.
|DYNAMIC STORAGE DEVICE REGION PROVISIONING - Implementations disclosed herein provide for increasing storage drive performance by reserving a region of user-writeable storage space on a storage medium for overprovisioning uses, including performance-enhancing functions. Until a capacity condition of the storage drive is satisfied, write operations targeting the reserved region are written to another equal-sized region that does not contain user data.
|METHOD AND APPARATUS FOR DYNAMIC RESIZING OF CACHE PARTITIONS BASED ON THE EXECUTION PHASE OF TASKS - The present invention proposes a method and a system for dynamic cache partitioning for application tasks in a multiprocessor. An approach for dynamically resizing cache partitions based on the execution phase of the application tasks is provided. The execution phases of the application tasks are identified and updated in a tabular form. Cache partitions are resized during a particular instance of the execution of application tasks such that the necessary and sufficient amount of cache space is allocated to the application tasks at any given point of time. The cache partition size is determined according to the working set requirement of the tasks during its execution, which is monitored dynamically or statically. Cache partitions are resized according to the execution phase of the task dynamically such that unnecessary reservation of the entire cache is avoided and hence an effective utilization of the cache is achieved.
|Paging Partition Arbitration Of Paging Devices To Shared Memory Partitions - A computer implemented method to establish at least one paging partition in a data processing system. The virtualization control point (VCP) reserves up to the subset of physical memory for use in the shared memory pool. The VCP configures at least one logical partition as a shared memory partition. The VCP assigns a paging partition to the shared memory pool. The VCP determines whether a user requests a redundant assignment of the paging partition to the shared memory pool. The VCP assigns a redundant paging partition to the shared memory pool, responsive to a determination that the user requests a redundant assignment. The VCP assigns a paging device to the shared memory pool. The hypervisor may transmit at least one paging request to a virtual asynchronous services interface configured to support a paging device stream.
|MEMORY MODULE WITH CONFIGURABLE INPUT/OUTPUT PORTS - A memory module is coupled to a number of controllers. The memory module is configured to configure each of a number of data input/output ports thereof as at least one of an input and an output in response to a first command from a particular controller of the controllers. The memory module is configured to partition itself into memory partitions in response to a second command from the particular controller so that each memory partition corresponds to a respective one of the controllers. Each of a number of data input/output ports of the controllers is configurable as at least one of an input and an output to correspond to a respective one of the input/output ports of the memory module. The first and second commands may originate from the particular controller, or the controllers may be coupled in parallel to the memory module.
|SYSTEM AND METHOD OF OPTIMIZATION OF IN-MEMORY DATA GRID PLACEMENT - A method, system, and program product for optimizing distribution and availability of data partitions is disclosed. Placement logic is run for data partition distribution which optimizes a configuration of a memory data grid. A performance impact of adding new members to the memory data grid is provided. Replication of data partitions in the memory data grid is minimized. Optimum data partition distribution in the memory data grid is determined.
|STORAGE DEVICE - A storage device
|STORAGE SYSTEM COMPRISING MULTIPLE STORAGE CONTROL APPARATUS - A pool, which is configured by multiple actual areas, is formed on the basis of two or more storage devices. A second storage control apparatus (DKC) determines, for each storage device, an unused capacity to be given to a first DKC with respect to each first DKC based on an unused capacity of each storage device and a request value of each storage device for each first DKC, and gives, for each first DKC, the unused capacity for each storage device determined with respect to the first DKC, to this first DKC. The request value of the storage device is based on a performance value, which is a value related to the performance of this storage device. The total capacity of multiple actual areas allocated to the virtual volumes by the first DKC is equal to or less than the unused capacity given with respect to each storage device.
|Dynamic Data Partitioning For Optimal Resource Utilization In A Parallel Data Processing System - A method, computer program product, and system for dynamically distributing data for parallel processing in a computing system, comprising allocating a data buffer to each of a plurality of data partitions, where each data buffer stores data to be processed by its corresponding data partition, distributing data in multiple rounds to the data buffers for processing by the data partitions, where in each round the data is distributed based on a determined data processing capacity for each data partition, and where a greater amount of data is distributed to the data partitions with higher determined processing capacities, and periodically monitoring usage of each data buffer and re-determining the determined data processing capacity of each data partition based on its corresponding data buffer usage.
|ACCESS CONTROL APPARATUS - An access control apparatus includes an accessor. An accessor accesses a recording medium in which a plurality of partitions are formed. A elector selects any one of a first mode and a second mode. A designator designates at least a part of the plurality of partitions in a manner different depending on a mode selected by the selector. A controller controls a processing operation of the accessor with reference to identification information of the partition designated by the designator, when the mode selected by the selector is the first mode. A sender sends the identification information of the partition designated by the designator in order for an external device to refer, when the mode selected by the selector is the second mode.
|HINTING OF DELETED DATA FROM HOST TO STORAGE DEVICE - A storage device includes a memory and a processor. The processor is configured to store data items for a host in respective logical addresses, to identify a first subset of the logical addresses as frequently-accessed logical addresses and a second subset of the logical addresses as rarely-accessed logical addresses, to manage the frequently-accessed logical addresses separately from the rarely-accessed logical addresses, to receive from the host an indication of one or more logical addresses, which are used for storing data that is identified by the host as having been deleted by a user, and to add the logical addresses indicated by the host to the rarely-accessed logical addresses.
|SYSTEM SUPPORTING MULTIPLE PARTITIONS WITH DIFFERING TRANSLATION FORMATS - A system configuration is provided with multiple partitions that supports different types of address translation structure formats. The configuration may include partitions that use a single level of translation and those that use a nested level of translation. Further, differing types of translation structures may be used. The different partitions are supported by a single hypervisor.
|Dynamic Data Partitioning For Optimal Resource Utilization In A Parallel Data Processing System - A method, computer program product, and system for dynamically distributing data for parallel processing in a computing system, comprising allocating a data buffer to each of a plurality of data partitions, where each data buffer stores data to be processed by its corresponding data partition, distributing data in multiple rounds to the data buffers for processing by the data partitions, where in each round the data is distributed based on a determined data processing capacity for each data partition, and where a greater amount of data is distributed to the data partitions with higher determined processing capacities, and periodically monitoring usage of each data buffer and re-determining the determined data processing capacity of each data partition based on its corresponding data buffer usage.
|STORAGE SYSTEM AND STORAGE CONTROL METHOD - When a plurality of applications operating in a host computer or a storage system uses a same pool, actual data constantly allocated to an upper tier drive satisfying the required response performance will continue to increase. Therefore, when data is migrated by IOPS in page units, the access performance such as the response speed may not be satisfied. Therefore, according to the present invention, multiple virtual volumes used in applications are subjected to grouping. Relocation conditions corresponding to performances required for each group are set in advance, and reallocation of tiers according to the relocation conditions is performed.
|CONFIGURABLE PARTITIONS FOR NON-VOLATILE MEMORY - Example embodiments for configuring a non-volatile memory device may comprise configuring M physical partitions of the non-volatile memory into two or more banks, wherein the two or more banks respectively comprise one or more of the M physical partitions, and wherein at least a first of the M physical partitions comprises a first size and wherein at least a second of the M physical partitions comprises a second size.
|PAGE PROTECTION ORDERING FOR LOCKLESS WRITE TRACKING - A method and system for tracking write access in a memory. The memory is partitioned into pages and each page is pointed to by a pointer. Upon receiving a request from a requester, a computer system stores a copy of a file that contains pointers to modified pages in the memory. The computer system then clears the file, and protects the pages in the memory from write access after clearing of the file. The stored copy of the file is sent to the requester.
|METHOD AND SYSTEM FOR MEASURING THE PERFORMANCE OF A COMPUTER SYSTEM ON A PER LOGICAL PARTITION BASIS - Disclosed are a method and system for measuring the performance of individual logical partitions of a logically partitioned computer system. Preferably, the method and system both hardware and firmware to allow measurement samples to be collected only for user specified zones of interest. In one embodiment, the method comprises the steps of specifying a Zone or Zones of interest (a Zone being a logical partition), collecting measurement samples only from the one or more specified Zones of interest, and measuring the performance of each of these Zones using only the measurement samples collected from said each of the Zones.
|DISPERSED STORAGE UNIT CONFIGURATION - A dispersed storage (DS) unit for use within a dispersed storage network is capable of self-configuring using registry information provided to the DS unit. The registry information includes a slice name assignment indicating a range of slice names corresponding to a plurality of potential data slices of potential data objects to be stored in the DS unit. Based on the registry information, the DS unit allocates a portion of physical memory to store the potential data slices.
|ALLOCATION METHOD AND APPARATUS OF MODERATE MEMORY - An allocation method comprises: partitioning moderate memory into a plurality of physical memory pages having predetermined page size according to the predetermined page size; scanning the moderate memory using the predetermined page size and recording the physical address and damage degree of each physical memory page; obtaining the allocation information of the physical memory pages when a memory request is received and allocating physical memory to the request based on the recorded physical address and damage degree of each physical memory page and the obtained allocation information. A moderate memory is scanned and the physical address and damage degree of each physical memory page are recorded, then the physical memory is allocated based on the recorded physical address and damage degree of each physical memory page and the obtained allocation information.
|Dynamic Data Storage Repartitioning - Embodiments of the present invention enable dynamic repartitioning of data storage in response to one or more triggers. In embodiments, a trigger may be a user-initiated action, a system-generated action, and/or an inference based on storage usage parameters. Applications of the present invention are its use in embodiments of a storage management system comprising a file system manager and a volume manager, where the placement of data into a partition (data storage region) may be specified by matching one or more disk region placement data attributes assigned to data with corresponding disk region attributes. In embodiments, dynamic repartitioning comprises adjustment of the location of the boundary between adjacent disk partitions and, if necessary, rebalancing of the data stored within the partitions by identifying mismatched data and relocating it to the partition with which it is associated.
|DYNAMICALLY REALLOCATING COMPUTING COMPONENTS BETWEEN PARTITIONS - Systems, methods and computing components are provided for dynamically reallocating a plurality of computing components among one or more logical partitions. A first computing component that is allocated to a first partition may have a management processor. A second computing component may be allocated to a second partition. The management processor of the first computing component may be configured to reallocate the first computing component to a third partition without affecting the second computing component.
|SIMULATING MEMORY HOT ADD - Memory is logically partitioned into two regions. A first region may be a similar size relative to the second region or the first region may be a small subset of the memory. The first region of memory is initialized and an operating system utilizes the first region. A system handler simulates a physical hot add of the second region. After the simulated physical hot add, the operating system may utilize the second region as if it were newly added physical memory and/or may utilize both the first region and second region.
|Method for memory management to reduce memory fragments - Provided is a method and apparatus for managing a memory. The method and apparatus may allocate or release a memory larger than N bytes through a heap; and the performance of allocating or releasing a memory smaller than or equal to N bytes through a fragless module, wherein the memory smaller than or equal to N bytes is allocated or released at a first region of a memory pool without passing through the heap.
|TIME BASED PRIORITY MODULUS FOR SECURITY CHALLENGES - Systems, methods, and computer readable media are disclosed for making dictionary based attacks difficult and/or time consuming for attackers. In one example embodiment, this can be accomplished by equipping a security service with software and/or circuitry operable to select security questions from different partitions of a question table.
|PARALLEL INSTALLATION OF LOGICAL PARTITIONS - An apparatus and method provide parallel installation of logical partitions on a computer system. The function of a hardware maintenance console is built into a logical partition configuration mechanism that resides in the system firmware. A virtual local area network (VLAN) is used by the logical partition configuration mechanism to define an I/O bridge that allows installing multiple logical partitions in parallel. Because multiple logical partitions may be installed in parallel, the time required to install logical partitions is greatly reduced.
|VIRTUAL STORAGE SPACE WITH CYCLICAL WRAPPING GRID FUNCTION - Apparatus and method for arranging a virtual storage space with a cyclical wrapping grid function. The virtual storage space is formed from a physical memory and comprises a plurality of larger grains of selected storage capacity, each divided into a power of two number of smaller grains. Each of the larger grains are distributed across a non-power of two number of storage elements so that each of the storage elements receives the same number of smaller grains.
|Balancing Computer Memory Among a Plurality of Logical Partitions On a Computing System - Methods, apparatus, and products are disclosed for balancing computer memory among a plurality of logical partitions on a computing system, the computing system having installed upon it a hypervisor, the hypervisor having allocated computer memory and computer storage to each of the logical partitions, that include: receiving, in a memory balancing module, a storage identifier for each logical partition, the storage identifier specifying a portion of a logical partition's allocated computer storage to be used for caching data contained in the logical partition's allocated computer memory; monitoring, by the memory balancing module for each logical partition, a storage usage rate for the portion of that logical partition's allocated computer storage specified by that logical partition's storage identifier; and instructing, by the memory balancing module, the hypervisor to reallocate the computer memory for two or more of the logical partitions in dependence upon the storage usage rates.
|DATA REDISTRIBUTION IN SHARED NOTHING ARCHITECTURE - A system and method for data redistribution. In one embodiment, the method includes dividing data into batches at a sending partition; populating a first data structure with the first pages and the first control information in a first data structure; storing the first data structure in a cache at the sending partition; sending the changes over the network to the receiving partition; receiving a notification that the changes have been successfully stored in the second hard disk at the receiving partition; and storing, in response to the notification, the changes on the first hard disk at the sending partition.
|DEVICE AND METHOD FOR MEMORY CONTROL AND STORAGE DEVICE - A memory control device according to an example of the invention comprises an allocation section allocating a plurality of memory regions of a memory module, an available space storage section storing data in available space of a first memory region that is one of the plurality of memory regions and, when no more space becomes available in the first memory region, store data in available space of a following second memory region, and a copying section copying a plurality of items of to-be-copied data that is stored in the first memory region but not in the second memory region to the second memory region after no more space becomes available in the first memory region in such a manner that a copying operation is divided into a plurality of times.
|Storage controller and storage controller virtual memory control method - A storage controller of the present invention partitions and allocates a virtual memory area to each of a plurality of functions operating simultaneously. Microprocessors inside a higher-level communications controller can respectively execute a plurality of program products. A virtual memory created using a local memory is partitioned into a plurality of areas. The partitioned areas are allocated to the respective program products via queues.
|System and Method for Configuration Management of Storage System - A discrepancy between a management range of a user on a management computer and a management range of the user in a storage, is detected with respect to a volume held in the storage. Storage management information of the management computer stores a correspondence between an identifier of a volume group, and a identifier of the user. When a plurality of volumes are designated as a managed object of the user, the management computer references the storage management information, and obtains, from the storage, an identifier of the volume group to which the plurality of designated volumes belong. Next, the management computer references the storage management information, and determines whether or not the obtained volume group is in management range of the same user.
|STORAGE DEVICE AND METHOD FOR PROTECTING ITS PARTITION - The present invention provides a storage device and a method for protecting its protected partition in which the storage device comprises a master boot record unit and a protected partition, the protected partition comprises an application data area and a system data area for storing application data and system data to be provided to a user, respectively, and the system data area is in a customized data format of nonstandard file system. With the storage device and the method for protecting its protected partition, security of system data in the protected partition of the storage device is enhanced.
|MEDIA CONTAINER FILE MANAGEMENT - The invention teaches a media container file comprising media data organized into media source blocks. The media source blocks are partitioned into source symbols that can be processed by a forward error correction (FEC) algorithm for generation of FEC redundancy data. Information of this source block partitioning is included in the file in addition to the source blocks. The container file also comprises meta data providing an association between the media source blocks and the partitioning information. The container file can be employed by a media server in a media session for compiling media data packets to be transmitted to requesting clients without the need of extensive data processing before calculating FEC data.
|Thin Provisioning Migration and Scrubbing - A method for migrating data to a mass storage system, including receiving an incoming data partition for storage in the mass storage system and allocating logical storage for the incoming data partition in the mass storage system. The method further includes making a determination that the incoming data partition includes only zero data, and, in response to the determination, inhibiting physical storage of the incoming data partition in the mass storage system while maintaining the allocated logical storage for the incoming data partition.
|METHODS AND DEVICES FOR EXPANDABLE STORAGE - Embodiments described herein disclose methods and devices for expanding the storage capacity in a storage device, including the steps of creating at least one partition in a storage memory of the storage device; designating a reserved-storage area and an enabled-storage area in at least one partition; storing a partition size in a FAT of the storage memory; and upon authorization, increasing the partition size to include sectors in the reserved-storage area, thereby expanding the storage capacity in a storage device. Preferably, the reserved-storage area is not accessible by a host system. Preferably, the partition size is determined from a partition range stored in a master boot record in the storage memory. Most preferably, the partition range is determined from an enabled capacity stored in a memory-management area in the storage memory, and wherein the memory-management area is not accessible by a host system.
|PARTITION-BASED METHOD AND APPARATUS FOR DIAGNOSING MEMORY LEAK IN JAVA SYSTEMS - A partition-based method for diagnosing memory leaks in Java systems, comprising dividing heap memory of a Java virtual machine into a plurality of partitions based on a partition plan, wherein each partition has at least one partition owner; monitoring the status of the respective partitions to determine whether there is a partition in which the memory space is exhausted; and if there is a partition in which the memory space is exhausted, determining that the memory leak may occur in the partition and analyzing the partition to obtain leaked objects and objects related to the leaked objects. The present invention also provides a partition-based apparatus for diagnosing memory leak in Java systems.
|METHOD OF PARTITIONING STORAGE AREA OF RECORDING MEDIUM AND RECORDING MEDIUM USING THE METHOD, AND METHOD OF ACCESSING RECORDING MEDIUM AND RECORDING DEVICE USING THE METHOD - Provided is a method of partitioning a storage area of a recording medium and a recording medium using the method, and a method of accessing a recording medium and a recording device using the method, capable of storing partition information used for partitioning a predetermined storage area included in the recording medium into a number of storage sub-areas in a first storage sub-area of the recording medium, and storing authority information which indicates whether an access instruction for accessing one of the partitioned storage sub-areas has authority to access the storage sub-area in a second storage sub-area. Accordingly, on a user's point, a read-only memory (ROM) area and a random access memory (RAM) area may be simultaneously provided to a NAND flash memory. On a content provider's point, desired contents are prevented from being deleted, and an additional space for storing added contents can be guaranteed.
|MEMORY CONTROLLER, NONVOLATILE STORAGE DEVICE, NONVOLATILE STORAGE SYSTEM, AND NONVOLATILE MEMORY ADDRESS MANAGEMENT METHOD - For address management of a nonvolatile memory, the whole logical address space is divided into logical address ranges (
|Memory partitioning method - A memory partitioning method is applied in a memory module having a plurality of physical blocks. The partitioning method includes the following steps. First, a partitioning command is received. Next, at least one first memory driving module and a second memory driving module are called according to the partitioning command. Then, at least one location code corresponding to one of the physical blocks is obtained according to the first memory driving module and/or the second memory driving module, and the physical blocks are divided into a first memory area and a second memory area according to the location code. Finally, the first memory driving module and the second memory driving module respectively partition the first memory area and the second memory area.
|SAFETY MODULE FOR A FRANKING MACHINE - The invention relates to a safety module for the electronic data processing, with a safety core comprising a core processor, and connected therewith, a core memory and a core interface, the core processor being adapted to import via the core interface, to verify and with successful verification to store and to activate programs/data sets in the core memory. It is characterized by that the safety core is connected by the core interface with a mass storage of the safety module arranged outside of the safety core, wherein the memory capacity of the mass storage is a multiple of the memory capacity of the core memory, that the core processor is adapted to import, verify and activate programs/data sets loaded into the mass storage for a program execution in a partitioned manner in the core memory, and that the core processor is adapted to authenticate partitioned programs/data sets not required for the program execution and stored in the core memory and to export them into the mass storage and/or to delete them in the core memory.
|PARTITION REDISPATCHING USING PAGE TRACKING - Illustrated embodiments provide a computer implemented method and data processing system for redispatching a partition by tracking a set of memory pages, belonging to the dispatched partition. In one illustrative embodiment the computer implemented method comprises finding an effective page address to real page address mapping for a page address miss to create a found real page address and page size combination, responsive to determining the page address miss in a page addressing buffer, and saving the found real page address and page size combination as an entry in set of entries in an array. Further in the computer implemented method, creating a preserved array from the array, responsive to determining the dispatched partition to be an undispatched partition. The computer implemented method further, analyzing each entry of the preserved array for a compressed page, responsive to determining the undispatched partition is now redispatched, and invoking a partition management firmware function to decompress the compressed page, prior to the partition being redispatched, responsive to determining a compressed page.
|User access to a partitionable server - A partitionable server that enables user access thereto is provided. The partitionable server includes a plurality of partitions, each running an independent instance of an operating system (OS) and a first management module located in the partitionable server and interfacing with the plurality of partitions, the first management module is separate from the plurality of partitions and includes a physical user interface for local access to the partitionable server. The first management module is operable to provide mapping of a physical user interface device, which locally accesses the partitionable server through the physical user interface, to a virtual user interface of any one of the plurality partitions as desired for accessing the one partition.
|AUTONOMICALLY SUSPENDING AND RESUMING LOGICAL PARTITIONS WHEN I/O RECONFIGURATION IS REQUIRED - A partition manager includes an I/O reconfiguration mechanism and a logical partition suspend/resume mechanism that work together to perform autonomic I/O reconfiguration in a logically partitioned computer system. When I/O reconfiguration is required, the affected logical partitions are suspended, the I/O is reconfigured, and the affected logical partitions are resumed. Because the logical partitions are suspended during I/O reconfiguration, any ghost packet that may occur when the I/O is reconfigured is ignored.
|METHOD FOR MANAGING PARTITIONS IN A STORAGE DEVICE - A method for re-allocating memory partition space is provided. The method comprises determining when a first memory partition is full or has reached a threshold value, determining that a second memory partition has unused storage space that can be allocated to the first memory partition, and assigning the unused storage space from the second memory partition to the first memory partition. A memory controller embedded within the mass storage device and having an interface to an external host assigns the unused storage space from the second memory partition to the first memory partition.
|Data Transmission for Partition Migration - A method, apparatus, and program product manage data during a logical partition migration. Data from a source logical partition is transformed into partition state records by a source migration services partition. The records are transmitted to a target migration services partition that processes the records and loads the data into a target logical partition. The logical partition migration may take place from a first computer to a second computer, or solely in a first computer. The migration services partitions may be configured with multiple virtual processors to create and send, or receive and process, partition state records in parallel.
|Compressing And Decompressing Image Data Without Introducing Artifacts - An apparatus may include a memory to store a first frame, a buffer to store at least one portion of a second frame previously stored in the memory, and first and second units to, respectfully, store and fetch data. The first unit may copy a datum of the second frame stored at a particular location in the memory to the buffer. The first unit may then store a datum of a first frame at the particular location. The second unit may fetch a datum of a second frame from a selected location. If a write-segment pointer and a read-segment pointer identify the same memory segment, and the read-data pointer is greater than the write-data pointer, the memory may be selected. If the write-segment pointer and the read-segment pointer identify the same memory segment, and the write-data pointer is greater than the read-data pointer, the buffer may be selected. In addition, if the write-segment pointer and the read-segment pointer identify different memory segments, either the memory or the buffer may be selected depending on additional criteria.
|Storage subsystem and storage control method - Failures may occur during the execution of an operation by a user, for example, when a directory quota cannot be expanded, or when a directory lacking in storage resources, which are to be assigned from a file system, emerges even if the directory quota can be expanded. A storage subsystem of the invention is characterized by autonomously detecting quota expansion for a user; comparing the total of plural quotas with a limit value; and allocating a storage area set in a storage device in advance to the limit value if, based on the result of the comparison, the total value exceeds the limit value.
|SYSTEM AND METHOD FOR SELECTIVELY STORING AND UPDATING PRIMARY STORAGE - A method and system is disclosed for selectively storing and updating data in primary storage. The primary storage may initially be evenly partitioned into a predetermined number of partitions. As a user selects a program, the partitions dedicated to programs not selected are reduced in size. As subsequent selections are made by the user, the partitions of the primary storage are adjusted to accurately represent the next set of possible selections available to a user. A second selective storing technique involves storing a list of assets for display in one of the partitions. This list is a predetermined portion of an entire list of assets available for selection by the user. User input, such as scrolling through the assets, allows a user to sort through the partial list. Once the user input is completed, the asset list may be repopulated with predetermined assets corresponding to the portion of the list selected by the user.
|Memory Migration in a Logically Partitioned Computer System - A method and apparatus migrates partition memory in a logically partitioned computer system by utilizing input/output (I/O) space located outside the logical memory blocks (LMBs) to be migrated. The transmit/receive (X/R) queues that are used by network storage adapters and any fixed memory items such as transmit/receive buffers are placed outside the logical memory blocks (LMBs) of the partition. Without the fixed memory items, these LMBs may be migrated without affecting the operation of the network storage adapters or the software in partition memory. The I/O space may be placed outside the partition in a specialized LMB that holds fixed memory items for one or more I/O adapters.
|Shared stream memory on multiple processors - A method and an apparatus that allocate a stream memory and/or a local memory for a variable in an executable loaded from a host processor to the compute processor according to whether a compute processor supports a storage capability are described. The compute processor may be a graphics processing unit (GPU) or a central processing unit (CPU). Alternatively, an application running in a host processor configures storage capabilities in a compute processor, such as CPU or GPU, to determine a memory location for accessing a variable in an executable executed by a plurality of threads in the compute processor. The configuration and allocation are based on API calls in the host processor.
|Method For Storing Messages in a Message Memory and Message Memory - In a method for storing messages in a communications module, the messages to be stored contain first data having a first data volume and second data having a second data volume, and it is possible for the second data volume to be different per message. A message memory contains a header segment, in which the first data of the message are stored in a respective header area per message, and the message memory also contains a data segment, in which the second data of the message are stored in a respective data area per message The message memory is configured such that a division between the header segment and the data segment is variable, depending on the number of messages and the second data volume.
|SECURE YET FLEXIBLE SYSTEM ARCHITECTURE FOR SECURE DEVICES WITH FLASH MASS STORAGE MEMORY - A device with mass storage capability that uses a readily available non secure memory for the mass storage but has firmware (and hardware) that provides security against unauthorized copying of data. This is true even though the firmware itself is stored in the non secure mass storage memory, and therefore potentially vulnerable to hacking. An indication of the authenticity of the firmware must be present before it will be executed by the device. This protects the device contents from unauthorized duplication or tampering. Additional functionality can be added to the device with additional firmware applications, and the authenticity of those additional applications will also be verified before they will be executed. This further prevents unauthorized copying or tampering of secure content through any mechanisms that may be unscrupulously introduced. Any data within the mass storage memory may also be encrypted.
|IMPLEMENTING A FAST FILE SYNCHRONIZATION IN A DATA PROCESSING SYSTEM - A system and method for implementing a fast file synchronization in a data processing system. A memory management unit divides a file stored in system memory into a collection of data block groups. In response to a master (e.g., processing unit, peripheral, etc.) modifying a first data block group among the collection of data block groups, the memory management unit writes a first block group number associated with the first data block group to system memory. In response to a master modifying a second data block group, the memory management unit writes the first data block group to a hard disk drive and writes a second data block group number associated with the second data block group to system memory. In response to a request to update modified data block groups of the file stored in the system memory to the hard disk drive, the memory management unit writes the second data block to the hard disk drive.
|Secure storage apparatus and method for controlling the same - The present invention discloses a storage apparatus in communication with one or more external systems, including at least one storage region, at least one logical partition formed by using a first part of the storage region for storing data, and a logic controller, provided with an authentication module for setting one access mode for controlling access to the logical partition according to the access mode when a vendor command from the external system requesting access to the logical partition is received.
|WORKLOAD MANAGEMENT IN VIRTUALIZED DATA PROCESSING ENVIRONMENT - A system, method and computer-readable medium for balancing access among multiple logical partitions to the physical system resources of a computer system employing system virtualization. Each of the logical partitions is classified, initially during a startup period, in accordance with a level of allocated dispatch window utilization. Performance metrics of one or more of the physical system resources are determined in association with one or more of the logical partitions. The performance metrics determination is performed at a hardware level independent of programming interrupts. During a dispatch window in which a given set of the physical system resources are configured for allocation to one of the logical partitions, the given set of physical system resources are re-allocated to a replacement logical partition in accordance with the determined performance metrics associated with the replacement logical partition and the dispatch window utilization classification of the replacement logical partition.
|PROCESSING SYSTEM HAVING MEMORY PARTITIONING - Memory resource partitioning code allocates a memory partition in response to a process requesting access to memory storage. Memory partition rules may define attributes of the memory partition. The attributes may include a minimum memory allocation and a maximum memory allocation for the memory partition.
|Adaptive arena assignment based on arena contentions - An embodiment of the invention provides an apparatus and a method for an adaptive arena assignment based on arena contentions. The apparatus and method include: receiving a request for memory from a software thread; determining a lock hit counter with a lowest value; and assigning the software thread to an arena associated with lock hit counter.
|METHOD FOR DISTRIBUTING HYPERVISOR MEMORY REQUIREMENTS ACROSS LOGICAL PARTITIONS - A method of reallocating memory to a hypervisor in a virtualized computing system, includes: assigning priorities to a plurality of logical partitions configured within the virtualized computing system; determining a memory requirement for the hypervisor, the hypervisor configured to manage the plurality of logical partitions; determining minimum levels of memory required for each of the plurality of logical partitions; determining the amount of available memory in the virtualized computing system; and in the event that the amount of available memory is less than the determined memory requirement of the hypervisor, removing portions of memory from one or more of the plurality of logical partitions based on the assigned priorities until the determined memory requirement for the hypervisor is obtained.
|DATA MANAGEMENT METHOD FOR NETWORK STORAGE SYSTEM AND THE NETWORK STORAGE SYSTEM BUILT THEREOF - A data management method for network storage system that said network storage system includes a storage network, a cluster of storage servers that provide data storage services for application servers connecting to the storage network and storage space corresponding to each storage server, setting a core manager in storage server, said core manager centralizing the metadata of all storage servers in a common storage space; separating the metadata from said storage servers to make a storage server become a storage manager and the storage spaces corresponding to each storage server form the common storage space, allocating the storage space of metadata in said common storage space, and managing the corresponding relationship between metadata and said storage manager.
|FEEDBACK LINKER FOR INCREASED DELTA PERFORMANCE - A method, system and program for generating an updated memory image including updated program code to be loaded into a storage medium that has stored thereon a current memory image including a current program code version. The method comprises receiving an updated input code comprising a number of segments, wherein each segment is relocatable within the updated memory image; arranging the segments within the updated memory image. The arranging further comprises receiving a representation of the current program code version; performing at least one optimization step adapted to decrease an objective function under at least one predetermined layout constraint, the objective function being indicative of a magnitude of differences between the current program code version and the updated program code version, the layout constraint being indicative of at least one constraint imposed on the arrangement of segments within the memory image.
|System and Method for Improving Data Caching - According to one embodiment of the present invention, a method for storing data includes partitioning the data into a plurality of sections and storing the sections on one or more server nodes of a plurality of server nodes. The method further includes caching one or more sections of the plurality of sections of data onto one or more caches nodes of a plurality of cache nodes. The method further includes storing, for each section of data, the identity of the particular cache node on which the section of data is cached.
|Reconfiguring a Storage Area Network - The invention relates to a method and apparatus for reconfiguring a portion of a storage area network by establishing one or more auxiliary data paths, configuring the storage area network to re-route communications from the portion of the storage area network to be reconfigured to the one or more auxiliary data paths and reconfiguring the portion of the storage area network while the communications are being re-routed.
|Application inspection tool for determining a security partition - An embodiment of the invention provides an apparatus and method for determining a security partition in a computer for an application. The apparatus and method can determine required system resources, security requirements, and partition rules for an application, can determine allocated system resources, security characteristics, and partitions rules for each security partition in the computer, and can identify at least one proposed security partition for the application.
|METHOD AND APPARATUS FOR MANAGING CENTRAL PROCESSING UNIT RESOURCES OF A LOGICALLY PARTITIONED COMPUTING ENVIRONMENT WITHOUT SHARED MEMORY ACCESS - A method and apparatus for managing CPU resources of a logically partitioned computing environment without shared memory access. A logical partition needing additional resources sends a message requesting such resources to a central domain manager, which sends messages to other partitions in the same group requesting that they assess their ability to donate resources to the requesting partition. Upon receiving such assessment request, each logical partition assesses its ability to donate resources to the requesting partition and responds accordingly to the domain manager. If at least one partition responds that it can donate resources to the requesting partition, the domain manager sends a message to a selected donor partition requesting that it reconfigure itself to donate resources to the requesting partition. Upon receiving a notification from the donor partition that it has successfully reconfigured itself, the domain manager notifies the requesting partition, which reconfigures itself to accept the donated resources.
|System and Method for Tracking the Memory State of a Migrating Logical Partition - An apparatus, program product and method for tracking the state of a migrating logical partition. Embodiments may use the state to determine the readiness and/or appropriateness of a page of the logical partition for transferring. The state may include a value or other data used to track changes affecting the page or the relative ease and/or appropriateness of migrating the page. A page manager table with entries corresponding to the state of each page of the logical partition may be used to track the state while the logical partition continues to run during a migration.
|Adjustment of Data Storage Capacity Provided by a Storage System - A storage system stores data in at least one partition of a physical storage media in accordance with file system information specifying a plurality of logical blocks having logical block addresses within the partition. The logical blocks include excess logical blocks that are not mapped to space in the physical storage media by the mapping employed by the storage system. Unusable block data marks those excess logical blocks as unusable. This makes it easy to adjust the data storage capacity of the storage system by changing the mapping to map more or less logical block addresses to space in the physical storage media and thereby destroy or create excess logical blocks, and by changing the unusable block data to correspondingly change the excess logical blocks marked as unusable.
|Data partitioning via bucketing bloom filters - Multiple Bloom filters are generated to partition data between first and second disjoint data sets of elements. Each element in the first data set is assigned to a bucket of a first set of buckets, and each element in the second data set is assigned to a bucket of a second set of buckets. A Bloom filter is generated for each bucket of the first set of buckets. The Bloom filter generated for a bucket indicates that each element assigned to that bucket is part of the first data set, and that each element assigned to a corresponding bucket of the second set of buckets is not part of the first data set. Additionally, a Bloom filter corresponding to a subsequently received element can be determined and used to identify whether that subsequently received element is part of the first data set or the second data set.
|COMPUTER SYSTEM FOR PERFORMING ERROR MONITORING OF PARTITIONS - A computer system for performing error monitoring of partitions. A partition status buffer (PSB) denotes a status (GOOD, BAD, NOCARE) of each partition of at least two partitions. The BAD status denotes that the partition has encountered at least one error that is currently unrepaired. A global supervisor mapping (GSM) associates each partition (designated as a supervised partition) with a supervisor partition in a one-to-one mapping. The supervisor partition determines its supervised partition from the GSM and ascertains the status of its supervised partition from the PSB. If the status of the supervised partition is BAD then the supervisor partition performs a recovery procedure. The recovery procedure: obtains a grant of access to physical and logical resources of the supervised partition which contains error data of the supervised partition; gathers the error data; sets the status of the supervised partition to the NOCARE status.
|Method and System for Finding Scrolled Regions Within a Tile Cache - In a method embodiment, a method includes periodically polling data sent to an output. The output is operable to render the data into a human-perceptible form. The method further includes determining if at least one partition of a first plurality of discrete partitions of the perdiodically polled data is substantially identical to a combination of respective portions of at least two partitions of a second plurality of discrete partitions of data recorded within a computer-readable storage.
|SYSTEM AND METHOD FOR SAFELY AUTOMATING THE GENERATION OF MULTIPLE DATA DEFINITION LANGUAGE STATEMENTS - A system and method includes steps or acts of: organizing table partitions in logical order; presenting the partition table numbers and their current ending values in logical order to a user; receiving an alter command from the user, the alter command specifying at least one logical partition number and its corresponding ending value; internally matching the specified logical partition number to its corresponding physical partition number; altering the physical partitioning of the table by manipulating one or more current ending values of partitions by altering the current ending value of the physical partition to which the specified logical partition is associated, such that new ending values are generated; and automatically generating at least one data definition language statement corresponding to the alter command, using the new ending value.
|INFORMATION REPRODUCING APPARATUS AND INFORMATION REPRODUCING METHOD - According to one embodiment, an information reproducing apparatus includes a memory, a decoder, an intermediate memory which is disposed between the memory and the decoder and which temporarily stores, in succession, the data that are supplied from the memory and then outputs the data to the decoder, switching circuit for switching an output of the memory to one of the decoder and the intermediate memory, memory management circuit for managing arrangement information of the data that are stored in the memory, determination circuit for determining whether the data that are stored in the memory are arranged in physically discontinuous memory areas of the memory, and switching control circuit for switching, in a case where the determination circuit determines that the data are arranged in the physically divided memory areas, the switching circuit in a manner to input the data output from the memory to the decoder via the intermediate memory.
|MEMORY CLASS BASED HEAP PARTITIONING - The illustrative embodiments provide a computer implemented method, apparatus, and computer usable program code for managing a heap. The heap is partitioned into at least one sub heap based on a relationship to at least one memory class of a plurality of memory classes. A memory allocation request comprising a memory class is received from a requester. A unique heap handle based on the memory class and associated with a specific sub heap is generated. The unique heap handle is then returned to the requester.
|MEMORY SYSTEM - In a memory system according to an aspect of the invention, a nonvolatile semiconductor memory includes storage areas each composed of a group of storage elements, stores one or more than one bit of data into each of the storage elements and selects either a first write mode in which n bits or a second write mode in which n+1 bits are stored into each of the storage elements. A controller instructs the semiconductor memory to store data, for each of logical address groups each composed of logical addresses belonging to a specific range, by writing a part of the data allocated with the logical addresses included in the logical address group into a first number of the storage areas in the first write mode and writing another part of the data into a second number of the storage areas in the second write mode.
|STORAGE SYSTEM IN WHICH RESOURCES ARE DYNAMICALLY ALLOCATED TO LOGICAL PARTITION, AND LOGICAL DIVISION METHOD FOR STORAGE SYSTEM - An object of the invention is to dynamically change the allocation of resources in a storage system. The resources including host IF units
|WORKLOAD MANAGEMENT IN VIRTUALIZED DATA PROCESSING ENVIRONMENT - A system, method and computer-readable medium for balancing access among multiple logical partitions to the physical system resources of a computer system employing system virtualization. Each of the logical partitions is classified, initially during a startup period, in accordance with a level of allocated dispatch window utilization. Performance metrics of one or more of the physical system resources are determined in association with one or more of the logical partitions. The performance metrics determination is performed at a hardware level independent of programming interrupts. During a dispatch window in which a given set of the physical system resources are configured for allocation to one of the logical partitions, the given set of physical system resources are re-allocated to a replacement logical partition in accordance with the determined performance metrics associated with the replacement logical partition and the dispatch window utilization classification of the replacement logical partition.
|WORKLOAD MANAGEMENT IN VIRTUALIZED DATA PROCESSING ENVIRONMENT - A system, method and computer-readable medium for balancing access among multiple logical partitions to the physical system resources of a computer system employing system virtualization. Each of the logical partitions is classified, initially during a startup period, in accordance with a level of allocated dispatch window utilization. Performance metrics of one or more of the physical system resources are determined in association with one or more of the logical partitions. The performance metrics determination is performed at a hardware level independent of programming interrupts. During a dispatch window in which a given set of the physical system resources are configured for allocation to one of the logical partitions, the given set of physical system resources are re-allocated to a replacement logical partition in accordance with the determined performance metrics associated with the replacement logical partition and the dispatch window utilization classification of the replacement logical partition.
|PROCESSOR CARD FOR BLADE SERVER AND PROCESS. - System including a processor card containing at least two processors, and a memory card containing at least two memory units. At least one memory unit is associated with each processor. A controller dynamically allocates memory in the at least two memory units to the at least two processors.
|PARALLEL INSTALLATION OF LOGICAL PARTITIONS - An apparatus and method provide parallel installation of logical partitions on a computer system. The function of a hardware maintenance console is built into a logical partition configuration mechanism that resides in the system firmware. A virtual local area network (VLAN) is used by the logical partition configuration mechanism to define an I/O bridge that allows installing multiple logical partitions in parallel. Because multiple logical partitions may be installed in parallel, the time required to install logical partitions is greatly reduced.
|PARALLEL INSTALLATION OF LOGICAL PARTITIONS - An apparatus and method provide parallel installation of logical partitions on a computer system. The function of a hardware maintenance console is built into a logical partition configuration mechanism that resides in the system firmware. A virtual local area network (VLAN) is used by the logical partition configuration mechanism to define an I/O bridge that allows installing multiple logical partitions in parallel. Because multiple logical partitions may be installed in parallel, the time required to install logical partitions is greatly reduced.
|Creating a Physical Trace from a Virtual Trace - In an embodiment, virtual trace records are read and physical trace records are created and displayed. The virtual trace records are associated with virtual processors allocated to logical partitions in a logically-partitioned computer system. Each of the virtual trace records has a wait timestamp, specifying a time at which a virtual processor began waiting to be dispatched and a wait time delta, specifying an amount of time that the virtual processor waited to be dispatched. An execute timestamp is created in each of the virtual trace records, which specifies a time at which the virtual processor was dispatched. The virtual trace records are sorted for each of the virtual processors by the execute timestamp. Physical trace records are created based on the sorted virtual trace records. Each physical trace record describes a dispatch of one of the virtual processors to one of the physical processors.
|Live Migration of a Logical Partition - A partition migration mechanism migrates a logical partition executing an operating system and resumes the logical partition before all resources in the logical partition have been migrated. When a partition is being migrated, a call checkpoint mechanism creates checkpoints of the state of the operating system when the partition manager is called. Before performing the call to the partition manager, a check is made to determine if all resources required by the call are available. If so, the partition manager call is executed. If all resources required by the call are not available, a resource fault is indicated, which causes the operating system state from the last checkpoint to be restored and a corresponding virtual CPU to be preempted until the resource that caused the fault becomes available. Exceptions that do not require the missing resource may be performed while the virtual CPU awaits the resource to become available.
Patent applications in class Memory partitioning