Class / Patent application number | Description | Number of patent applications / Date published |
711153000 | Shared memory partitioning | 83 |
20080201535 | Method and Apparatus for Provisioning Storage Volumes - A method for determining volume size in a storage system, comprising the steps of receiving a request for a volume assignment from a client host; obtaining client host specification; obtaining storage system specification; based on the client host specification and storage system specification selecting a proper volume size; and assigning a virtual volume to the client host, the virtual volume having the selected proper volume size. | 08-21-2008 |
20080222369 | Access Control Partitioned Blocks in Shared Memory - A method for controlling multiple access to partitioned areas of a shared memory and a digital processing apparatus having the shared memory are disclosed. According to embodiments of the present invention, the storage area of a shared memory is partitioned to a plurality of storage areas, and each processor accesses a storage area through each access port to store data and transfers an authority to access the pertinent storage area to the other processor, thereby allowing access by the other processor. With the present invention, the data communication time between the plurality of processors can be minimized, and the process efficiency of each processor can be optimized. | 09-11-2008 |
20080229031 | Method of Automated Resource Management In A Partition Migration Capable Environment - A method, system and program are disclosed for automatically adjusting the allocation of a plurality of information processing system (IPS) resources among a plurality of logical partitions (LPARs). An LPAR is created on a first central processor complex (CPC) and a first LPAR identifier is generated. A configuration change manager is implemented on the LPAR to communicate changes in the LPAR's identifier to an automated resource manager (ARM). IPS resources are automatically allocated to the LPAR. If the LPAR is migrated a second CPC, a second LPAR identifier is similarly generated, resulting in an LPAR configuration change event. The ARM is notified that the migrated LPAR's identifier has changed and receives the changed LPAR identifier. Comparison operations are performed to determine whether the second LPAR identifier matches the first CPC. If not, resources allocated to the migrated LPAR are released for automated allocation to other LPARs comprising the first CPC. | 09-18-2008 |
20080263288 | System and Method for Probing Hypervisor Tasks in an Asynchronous Environment - A system, method, and computer-usable medium for probing hypervisor tasks in an asynchronous environment. According to an embodiment of the invention, the partition firmware sends a request for data to the hypervisor. When the hypervisor receives the request for data, the hypervisor returns a taskID that identifies the task allocated to handle the request. Partition firmware records the taskID and a timestamp, which indicates the time in which the hypervisor received the request. A timer is set to measure the amount of time elapsed since the task ID was received by a requesting partition firmware. If the hypervisor has not provided the partition firmware with the requested data after a predetermined time period measured by the timer has elapsed, the partition firmware inquires about the status of the task associated with the taskID. If the task is still running, the partition firmware returns control of the partition to the operating system. | 10-23-2008 |
20080320242 | PHYSICAL MEMORY CAPPING FOR USE IN VIRTUALIZATION - A method of implementing virtualization involves an improved approach to resource management. A virtualizing subsystem is capable of creating separate environments that logically isolate applications from each other. Some of the separate environments share physical resources including physical memory. When a separate environment is configured, properties for the separate environment are defined. Configuring a separate environment may include specifying a physical memory usage cap for the separate environment. A global resource capping background service enforces physical memory caps on any separate environments that have specified physical memory caps. | 12-25-2008 |
20080320243 | MEMORY-SHARING SYSTEM DEVICE - A memory-sharing system device has a shared memory, divided into forward-direction and backward-direction memory areas; a first processor inputting transfer data in the forward direction, writing the data to the forward-direction memory area, reading transfer data in the backward direction from the backward-direction memory area and outputting the data; and a second processor for transferring data in the back-ward direction. The first or second processor sets memory release criteria for the forward-direction and backward-direction memory areas respectively, and, when the used memory area reaches the memory release criterion, performs memory release processing. The first or second processor monitors the forward-direction and the backward-direction data transfer speed, changes the memory release criterion depending on the data transfer speed. | 12-25-2008 |
20080320244 | Moving records between partitions - In an embodiment, data is partitioned into partitions, which are divided into levels. The levels are ordered by creation times of the levels. A request is received at a current partition, which includes a key that identifies a field in a record and a value for the key. A determination is made whether the value exists in the field in the current partition. If the determination is false, a message is sent from the current partition to a next-older partition, and the message instructs the next-older partition to move the record with the value from the next-older partition to the current partition. If the determination is true, the record with the value in the field is moved from the current partition to a next-newer partition if the next-newer partition sent the request, and the record is deleted from the current partition. | 12-25-2008 |
20090024805 | System, method and computer-readable medium for enabling access to additional memory capacity - A method, system and computer-readable media for exchanging information via an electronics communications are provided. A computer includes a memory and an access logic are bi-directionally communicatively coupled with a controller. The memory includes an open memory area and a partitioned memory area, wherein the open area available is for use by the controller upon an initial sale, installation or start-up. The access logic is configured to enable access to the partitioned memory by the controller after a receipt by the access logic of an access purchase confirmation. The computer may be coupled with an electronics communications network, such as the Internet, and the access purchase confirmation may be delivered via the electronics communications network. The access to partitioned area may optionally be enabled on a temporary or a segmented basis. | 01-22-2009 |
20090055599 | CONSISTENT DATA STORAGE SUBSYSTEM CONFIGURATION REPLICATION - Consistency for replicating data storage subsystem configurations in accordance with a “golden” configuration file. A data storage subsystem comprises a blade system with a plurality of slots, the blade system configured to support a plurality of blades and a storage system, each arranged in a predetermined slot of the blade system. The storage system arranges a logical configuration of the server blades in accordance with a “golden” configuration file. The server blade slot versus WWN information is collected and provided to the storage system. The storage system converts the “golden” configuration file slot information to WWNs. The server blades are enabled for access to said storage system as they log on with WWNs in accordance with the “golden” configuration file. | 02-26-2009 |
20090055600 | Method, System, and Apparatus for Dynamic Reconfiguration of Resources - A dynamic reconfiguration to include on-line addition, deletion, and replacement of individual modules of to support dynamic partitioning of a system, interconnect (link) reconfiguration, memory RAS to allow migration and mirroring without OS intervention, dynamic memory reinterleaving, CPU and socket migration, and support for global shared memory across partitions is described. To facilitate the on-line addition or deletion, the firmware is able to quiesce and de-quiesce the domain of interest so that many system resources, such as routing tables and address decoders, can be updated in what essentially appears to be an atomic operation to the software layer above the firmware. | 02-26-2009 |
20090055601 | Efficient Sharing Of Memory Between Applications Running Under Different Operating Systems On A Shared Hardware System - A system, method and computer program product for efficient sharing of memory between first and second applications running under first and second operating systems on a shared hardware system. The hardware system runs a hypervisor that supports concurrent execution of the first and second operating systems, and further includes a region of shared memory managed on behalf of the first and second applications. Techniques are used to avoid preemption when the first application is accessing the shared memory region. In this way, the second application will not be unduly delayed when attempting to access the shared memory region due to delays stemming from the first application's access of the shared memory region. This is especially advantageous when the second application and operating system are adapted for real-time processing. Additional benefits can be obtained by taking steps to minimize memory access faults. | 02-26-2009 |
20090063788 | Techniques For Storing System Images In Slices On Data Storage Devices - A data storage device has a data storage medium. A data storage capacity of the data storage device is divided into slices. Each slice has a set of sectors. Data storage device firmware is configured to store copies of a system image in the slices on the data storage device. Each of the slices stores a different copy of the system image. | 03-05-2009 |
20090077326 | Multiprocessor system - A memory mapping unit requests allocation of a remote memory to memory mapping units of other processor nodes via a second communication unit, and requests creation of a mapping connection to a memory-mapping managing unit of a first processor node via the second communication unit. The memory-mapping managing unit creates the mapping connection between a processor node and other processor nodes according to a connection creation request from the memory mapping unit, and then transmits a memory mapping instruction for instructing execution of a memory mapping to the memory mapping unit via a first communication unit of the first processor node. | 03-19-2009 |
20090113142 | STORAGE HAVING LOGICAL PARTITIONING CAPABILITY AND SYSTEMS WHICH INCLUDE THE STORAGE - A storage includes: host interface units; file control processors which receives a file input/output request and translates the file input/output request into a data input/output request; file control memories which store translation control data; groups of disk drives; disk control processors; disk interface units which connect the groups of disk drives and the disk control processors; cache memories; and inter-processor communication units. The storage logically partitions these devices to cause the partitioned devices to operate as two or more virtual NASs. | 04-30-2009 |
20090164739 | Method,system and apparatus for handling events for partitions in a socket with sub-socket partitioning - In one aspect, the issues of events that may impact one or more partitions of sub-socket partitioning in one or more sockets can be handled. Specifically, events for partitions can be handled in a socket with sub-socket partitioning, wherein the events may include reset, interrupts, errors and reliability, availability, and serviceability (RAS) management. | 06-25-2009 |
20090198918 | Host Fabric Interface (HFI) to Perform Global Shared Memory (GSM) Operations - A data processing system enables global shared memory (GSM) operations across multiple nodes with a distributed EA-to-RA mapping of physical memory. Each node has a host fabric interface (HFI), which includes HFI windows that are assigned to at most one locally-executing task of a parallel job. The tasks perform parallel job execution, but map only a portion of the effective addresses (EAs) of the global address space to the local, real memory of the task's respective node. The HFI window tags all outgoing GSM operations (of the local task) with the job ID, and embeds the target node and HFI window IDs of the node at which the EA is memory mapped. The HFI window also enables processing of received GSM operations with valid EAs that are homed to the local real memory of the receiving node, while preventing processing of other received operations without a valid EA-to-RA local mapping. | 08-06-2009 |
20090210636 | METHODS AND SYSTEMS FOR TWO-DIMENSIONAL MAIN MEMORY - In one embodiment of the invention, a memory module is disclosed including a printed circuit board with an edge connector; an address controller coupled to the printed circuit board; and a plurality of memory slices. Each of the plurality of memory slices of the memory module includes one or more memory integrated circuits coupled to the printed circuit board, and a slave memory controller coupled to the printed circuit board and the one or more memory integrated circuits. The slave memory controller receives memory access requests for the memory module from the address controller. The slave memory controller selectively activates one or more of the one or more memory integrated circuits in the respective memory slice in response to the address received from the address controller to read data from or write data into selected memory locations in the memory integrated circuits. | 08-20-2009 |
20090216963 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR PROVIDING A SHARED MEMORY TRANSLATION FACILITY - A system, method and computer program product for providing a shared memory translation facility. The method includes receiving a request for access to a memory address from a requestor at a configuration, the receiving at a shared memory translation mechanism. It is determined if the memory address refers to a shared memory object (SMO), the SMO accessible by a plurality of configurations. In response to determining that the memory address refers to the SMO, it is determined if the configuration has access to the SMO. In response to determining that the configuration has access to the SMO, the requestor is provided a system absolute address for the SMO and access to the SMO. In this manner direct interchange of data between the plurality of configurations is allowed. | 08-27-2009 |
20090254715 | VARIABLE PARTITIONED BLOCKS IN SHARED MEMORY - A method and device for varying the size of partitioned areas of a shared memory is disclosed. The present invention resets the size of partitioned areas by expanding the size of a shared area when data that is larger than the writable area of the shared area is to be written, after the storage area of a memory unit is partitioned to a plurality of partitioned areas by a main control unit. The memory unit is coupled with a main control unit and a supplementary control unit through independent ports. With the present invention, the data communication time between control units for processing data can be minimized, and the operation speed of each control unit can be optimized. | 10-08-2009 |
20090307438 | Automated Paging Device Management in a Shared Memory Partition Data Processing System - Automated paging device management is provided for a shared memory partition data processing system. The automated approach includes managing a paging storage pool defined within one or more storage devices for holding logical memory pages external to physical memory managed by a hypervisor of the processing system. The managing includes: responsive to creation of a logical partition within the processing system, automatically defining a logical volume in the paging storage pool for use as a paging device for the new logical partition, the automatically defining occurring absent use of a filesystem, with the resultant paging device being other than a file in a filesystem; and automatically specifying the logical volume as a paging space device for the new logical partition and binding the paging space device to the new logical partition, wherein the logical volume is sized to accommodate a defined maximum memory size of the new logical partition. | 12-10-2009 |
20090307439 | Dynamic Control of Partition Memory Affinity in a Shared Memory Partition Data Processing System - Dynamic control of memory affinity is provided for a shared memory logical partition within a shared memory partition data processing system having a plurality of nodes. The memory affinity control approach includes: determining one or more home node assignments for the shared memory logical partition, with each assigned home node being one node of the plurality of nodes of the system; determining a desired physical page level per node for the shared memory logical partition; and allowing the shared memory partition to run and using the home node assignment(s) and its desired physical page level(s) in the dispatching of tasks to physical processors in the nodes and in hypervisor page memory management to dynamically control memory affinity of the shared memory logical partition in the data processing system. | 12-10-2009 |
20090307440 | Transparent Hypervisor Pinning of Critical Memory Areas in a Shared Memory Partition Data Processing System - Transparent hypervisor pinning of critical memory areas is provided for a shared memory partition data processing system. The transparent hypervisor pinning includes receiving at a hypervisor a hypervisor call initiated by a logical partition to register a logical memory area of the logical partition with the hypervisor. Responsive to this hypervisor call, the hypervisor transparently determines whether the logical memory is a critical memory area for access by the hypervisor. If the logical memory area is a critical memory area, then the hypervisor automatically pins the logical memory area to physical memory of the shared memory partition data processing system, thereby ensuring that the memory area will not be paged-out from physical memory to external storage, and thus ensuring availability of the logic memory area to the hypervisor. | 12-10-2009 |
20090307441 | Controlled Shut-Down of Partitions Within a Shared Memory Partition Data Processing System - Controlled partition shut-down is provided within a shared memory partition data processing system including a shared memory partition, a paging service partition, a hypervisor and a shared memory pool within physical memory. The hypervisor manages access to logical pages within the pool and page-out of pages from the pool to external paging storage via the paging service partition. A respective paging service stream exists between the paging service partition and hypervisor for each shared memory partition, with each stream including a stream state. The control method includes: responsive to a shut-down initiating event, notifying the paging service partition to shut down, and determining whether a shared memory partition is currently active, and if so, signaling the hypervisor to complete paging activity for the active memory partition and waiting for its stream state to enter a suspended or a completed state before automatically shutting down the paging service partition. | 12-10-2009 |
20090319728 | Virtualized SAS Adapter with Logic Unit Partitioning - A method, computer program product and computer system for virtualizing an SAS storage adapter, so as to allow logical partitions of a computer system to share a storage device. The method, computer program product and computer system includes assigning a logical storage adapter to an operating system of each of the logical partitions; creating a mapping from each of the logical partitions to a set of logical blocks in the storage device; and configuring the logical storage adapter using a hypervisor, so that a select partition can access a select set of logical blocks that the select partition is allowed to access. | 12-24-2009 |
20100088477 | MEMORY SHARE SYSTEM AND MEMORY SHARE APPARATUS - Constructing to include a memory section and a share management section that divides a storage area of a storage apparatus attached to the memory section and allocates the divided areas to each plurality of information processing apparatus, thereby enabling sharing of the storage apparatus by the plurality of information processing apparatuses, carries out a memory access to the storage area on the basis of a memory access request signal from the each information processing apparatus, and generates a response signal from the memory section, thereby allowing the storage apparatus to function as an internal storage apparatus of the information processing apparatus, enables easy modification of the memory size used in an information processing apparatus by sharing memory which is provided external to the information processing apparatus among a plurality of information processing apparatuses, thereby facilitating effective use of the memory. | 04-08-2010 |
20100095072 | INTER-PROCESSOR COMMUNICATION METHOD, MULTIPROCESSOR SYSTEM, AND PROCESSOR - A method is provided for sending and receiving data between a first processor including a first cache memory and a second processor including a second cache memory via a shared memory. The method includes classifying, by the first processor, a transfer data area that stores data transferred between the first and second processors in the shared memory as a first area filling one cache line and a second area not filling one cache line, copying, by the first processor, data in the second area into a divided data area in the shared memory, the divided data area being aligned with a cache line in the first cache memory, and processing, by the second processor, the data in the first area and the data in the divided data area as data from the first processor. | 04-15-2010 |
20100106918 | VARIABLE-LENGTH CODING DATA TRANSFER INTERFACE - A VLC data transfer interface is presented that allows digital data to be packed and assembled according to a format selectable from a number of formats while the data is being transferred to a desired destination. | 04-29-2010 |
20100185823 | ENABLING HIGH-PERFORMANCE COMPUTING ON NON-DEDICATED CLUSTERS - Techniques for enabling high-performance computing are provided. The techniques include resizing a logical partition in a non-dedicated compute cluster server to enable high-performance computing, wherein a high performance computing application is executed such that the high performance computing application is configured to complete execution of each of one or more application threads at a similar instance as a slowest thread in the cluster, and wherein the non-dedicated compute cluster comprises one or more servers and the logical partition is created by partitioning one or more server resources. | 07-22-2010 |
20100217940 | Centrifugal separator - To propose a centrifugal separator that is capable of performing, easily and accurately, a condition setting operation for continuously operating the centrifugal separator under a plurality of operating conditions. In the centrifugal separator, which stores operating conditions in a plurality of memories respectively and independently or continuously calls up the operating conditions stored in these memories to perform operation control, a plurality of memory selection keys corresponding to the plurality of memories are provided, and the memories for storing the operating conditions therein and the memories for calling up the operating conditions are specified by selecting the memory selection keys. | 08-26-2010 |
20110072220 | METHOD AND APPARATUS FOR DETERMINING ACCESS PERMISSIONS IN A PARTITIONED DATA PROCESSING SYSTEM - In a data processing system having a plurality of resources and plurality of partitions, each partition including one or more resources of the plurality of resources, a method includes receiving an access request to a target resource of the plurality of resources; using a first set of transaction attributes of the access request to determine a partition identifier for the access request in which the partition identifier indicates a partition of the plurality of partitions which includes the target resource; using the partition identifier to determine access permissions for the partition indicated by the partition identifier; and based on the access permissions, determining whether or not the access request is permitted. | 03-24-2011 |
20110107035 | CROSS-LOGICAL ENTITY ACCELERATORS - A cross-logical entity group is created that includes one or more accelerators to be shared by a plurality of logical entities. Instantiated on the accelerators are functions that are common across multiple logical entities. The functions to be instantiated are determined, for instance, dynamically during run-time. | 05-05-2011 |
20110125973 | System and Method for Performing Dynamic Mixed Mode Read Validation In a Software Transactional Memory - The transactional memory system described herein may apply a mix of read validation techniques to validate read operations (e.g., invisible reads and/or semi-visible reads) in different transactions, or to validate different read operations within a single transaction (including reads of the same location). The system may include mechanisms to dynamically determine that a read validation technique should be replaced by a different technique for reads of particular locations or for all subsequent reads, and/or to dynamically adjust the balance between different read validation techniques to manage costs. Some of the read validation techniques may be supported by hardware transactional memory (HTM). The system may delay acquisition of ownership records for reading, and may acquire two or more ownership records back-to-back (e.g., within a single hardware transaction). The user code of a software transaction may be divided into multiple segments, some of which may be executed within a hardware transaction. | 05-26-2011 |
20110125974 | DISTRIBUTED SYMMETRIC MULTIPROCESSING COMPUTING ARCHITECTURE - Example embodiments of the present invention includes systems and methods for implementing a scalable symmetric multiprocessing (shared memory) computer architecture using a network of homogeneous multi-core servers. The level of processor and memory performance achieved is suitable for running applications that currently require cache coherent shared memory mainframes and supercomputers. The architecture combines new operating system extensions with a high-speed network that supports remote direct memory access to achieve an effective global distributed shared memory. A distributed thread model allows a process running in a head node to fork threads in other (worker) nodes that run in the same global address space. Thread synchronization is supported by a distributed mutex implementation. A transactional memory model allows a multi-threaded program to maintain global memory page consistency across the distributed architecture. A distributed file access implementation supports non-contentious file I/O for threads. These and other functions provide a symmetric multiprocessing programming model consistent with standards such as Portable Operating System Interface for Unix (POSIX). | 05-26-2011 |
20110161604 | WRITER/READER/NO-ACCESS DOMAIN DATA ACCESSIBILITY - Multiple types of executable agents operating within a domain. The domain includes mutable shared state and immutable shared state, with agents internal to the domain only operating on the shared state. Writer agents are defined to be agents that have read access and write access to mutable shared state and read access only to immutable shared state. General reader agents have read access to both mutable shared state and immutable shared state and have no write access. Immutable reader agents have read access to only immutable shared state and have no write access. By appropriate scheduling of the different types of agents, data races may be reduced or eliminated. | 06-30-2011 |
20110191548 | High Utilization Multi-Partitioned Serial Memory - A memory device that includes an input interface that receives instructions and input data on a first plurality of serial links. The instructions and input data are deserialized on the memory device, and are provided to a memory controller. The memory controller initiates accesses to a memory core in response to the received instructions. The memory core includes a plurality of memory partitions, which are accessed in a cyclic and overlapping manner. This allows each memory partition to operate at a slower frequency than the serial links, while properly servicing the received instructions. Accesses to the memory device are performed in a synchronous manner, wherein each access exhibits a known fixed latency. | 08-04-2011 |
20120084517 | Shared Memory Between Child and Parent Partitions - A mechanism for the creation of a shared memory aperture between modes in a parent and child partition is described. The shared memory aperture can be created between any memory mode between the guest and any host. For example, a shared memory aperture can be created between the kernel mode on the child partition and the user mode on the parent partition. | 04-05-2012 |
20120110274 | Operating System Image Management - In a data processing system including multiple logical partitions (LPARs), an application executes on a first logical partition (LPAR) of the multiple LPARs, where the application uses a first operation system stored in a first memory partition of a shared pool memory of the data processing system. A virtualization management component (a) initiates an update process that quiesces operations of the first LPAR, (b) pages in, via a virtual input/output server coupled to a first paging device, a first image of a second operating system from the first paging device to the shared pool memory; (c) changes one or more pointers associated with the application to point to one or more portions of the second operating system, such that the application uses the second operating system, when resumed; and (b) resumes execution the application. | 05-03-2012 |
20120110275 | Supporting Virtual Input/Output (I/O) Server (VIOS) Active Memory Sharing in a Cluster Environment - A method, system, and computer program product provide a shared virtual memory space via a cluster-aware virtual input/output (I/O) server (VIOS). The VIOS receives a paging file request from a first LPAR and thin-provisions a logical unit (LU) within the virtual memory space as a shared paging file of the same storage amount as the minimum required capacity. The VIOS also autonomously maintains a logical redundancy LU (redundant LU) as a real-time copy of the provisioned/allocated LU, where the redundant LU is a dynamic copy of the allocated LU that is autonomously updated responsive to any changes within the allocated LU. Responsive to a second VIOS attempting to read a LU currently utilized by a first VIOS, the read request is autonomously redirected to the logical redundancy LU. The redundant LU can be utilized to facilitate migration of a client LPAR to a different computing electronic complex (CEC). | 05-03-2012 |
20120110276 | MANAGING MIGRATION OF A SHARED MEMORY LOGICAL PARTITION FROM A SOURCE SYSTEM TO A TARGET SYSTEM - Migration management is provided for a shared memory logical partition migrating from a source system to a target system. The management approach includes managing migration of the logical partition from the source system to the target system by: transferring a portion of logical partition state information for the migrating logical partition from the source system to the target system by copying at the source system contents of a logical page of the migrating logical partition into a state record buffer for forwarding to the target system; forwarding the state record buffer to the target system; and determining whether the migrating logical partition is suspended at the source system, and if not, copying at the target system contents of the state record buffer to paging storage of the target system, the paging storage being external to physical memory managed by a hypervisor of the target system. | 05-03-2012 |
20120159090 | SCALABLE MULTIMEDIA COMPUTER SYSTEM ARCHITECTURE WITH QOS GUARANTEES - Versions of a multimedia computer system architecture are described which satisfy quality of service (QoS) guarantees for multimedia applications such as game applications while allowing platform resources, hardware resources in particular, to scale up or down over time. Computing resources of the computer system are partitioned into a platform partition and an application partition, each including its own central processing unit (CPU) and, optionally, graphics processing unit (GPU). To enhance scalability of resources up or down, the platform partition includes one or more hardware resources which are only accessible by the multimedia application via a software interface. Additionally, outside the partitions may be other resources shared by the partitions or which provide general purpose computing resources. | 06-21-2012 |
20120265945 | Recording Device, Recording Device Control Method, and Storage Medium - Managing commands in a buffer is simplified while continuing to enable immediately executing real-time commands. A control unit of a printer sequentially writes commands received from a host computer to a first buffer and sequentially reads the commands. If the read command is a real-time command, the control unit executes the command. If the read command is a normal command, the control unit writes the command to a second buffer without executing the command from the first buffer. The control unit sequentially reads and executes normal commands written to the second buffer. | 10-18-2012 |
20120272015 | VIRTUAL MACHINE TRIGGER - A computing system includes a parent partition, child partitions, a hypervisor, shared memories each associated with one of the child partitions, and trigger pages each associated with one of the child partitions. The hypervisor receives a system event signal from one of the child partitions and, in response to receiving the system event signal, accesses the trigger page associated with that child partition. The hypervisor determines whether the trigger page indicates whether data is available to be read from the shared memory associated with the child partition. The hypervisor can send an indication to either the parent partition or the child partitions that data is available to be read from the shared memory associated with the child partition if the hypervisor determines that the trigger page indicates that data is available to be read from the shared memory associated with the child partition. | 10-25-2012 |
20120311274 | DYNAMIC CONTROL OF PARTITION MEMORY AFFINITY IN A SHARED MEMORY PARTITION DATA PROCESSING SYSTEM - Dynamic control of memory affinity is provided for a shared memory logical partition within a shared memory partition data processing system having a plurality of nodes. The memory affinity control approach includes: determining one or more home node assignments for the shared memory logical partition, with each assigned home node being one node of the plurality of nodes of the system; determining a desired physical page level per node for the shared memory logical partition; and allowing the shared memory partition to run and using the home node assignment(s) and its desired physical page level(s) in the dispatching of tasks to physical processors in the nodes and in hypervisor page memory management to dynamically control memory affinity of the shared memory logical partition in the data processing system. | 12-06-2012 |
20130080711 | DYNAMIC POWER SCALING OF AN INTERMEDIATE SYMBOL BUFFER ASSOCIATED WITH COVARIANCE COMPUTATIONS - An intermediate symbol buffer (ISB) configuration and method is provided such that the ISB memory comprises 15 portions, one for each HSDPA spreading code. Symbols associated with a spreading code are written to the memory portion associated with the same spreading code. When a covariance calculation is performed to obtain a more accurate channel estimate, only the symbols associated with spreading codes determined to be needed for the covariance calculation are written to the ISB by a buffer block and red from the ISB by a correlation core. The symbols associated with spreading codes that are not necessary for a covariance calculation may be masked from being written or read from the ISB. In some embodiments each memory portion is an individual memory block. In other embodiments a plurality of memory blocks may contain a plurality of memory portions, one memory partition designated, at least temporarily, for each spreading code. | 03-28-2013 |
20130080712 | Non-Uniform Memory Access (NUMA) Enhancements for Shared Logical Partitions - In a NUMA-topology computer system that includes multiple nodes and multiple logical partitions, some of which may be dedicated and others of which are shared, NUMA optimizations are enabled in shared logical partitions. This is done by specifying a home node parameter in each virtual processor assigned to a logical partition. When a task is created by an operating system in a shared logical partition, a home node is assigned to the task, and the operating system attempts to assign the task to a virtual processor that has a home node that matches the home node for the task. The partition manager then attempts to assign virtual processors to their corresponding home nodes. If this can be done, NUMA optimizations may be performed without the risk of reducing the performance of the shared logical partition. | 03-28-2013 |
20130091332 | OS-independent Framework and Software Library for Real Time Inter-process Data Transfer (Data River) - Proposed is a secure real-time inter-process data exchange mechanism based on memory mapped files (MMF). A modified FIFO access to the data (“one head, multiple tails”) is provided by pointers residing in a MMF buffer. A process writes to a data area of the buffer using “head” pointer, and data are read by processes using “tail” pointers. Only one shared data block is accessible at any given time, thus achieving secure high-performance real-time data sharing data between processes without using OS-dependent thread-synchronization techniques. The invention is implemented as OS-specific dynamic libraries that form a platform-independent software layer which hides the implementation details from the programmer. Access to the libraries is provided by a simple and easy to use API, via a limited number of high-level functions, with syntax consistent across languages (C, C++, Pascal, MATLAB) and OS platforms (Windows, Linux, MacOSX). | 04-11-2013 |
20130212339 | Data Coherence Method and Apparatus for Multi-Node Computer System - A method for maintaining data coherency in a shared-memory computer system having a plurality of nodes divides the local memory of a given node into one or more blocks and stores a data record for each block indicating a plurality of node groups and a selection of the node groups. Each selected node group represents a number of nodes, and selected node groups represent at least one node that has requested access to the block. In response to receiving an access request from a requesting node that may or may not be in a selected node group, the method and system update the data record to indicate the correct selection. If the requesting node is not in any node group, the data record is adjusted to have new node groups, one of which represents the requesting node. | 08-15-2013 |
20130297891 | BINARY TREE STORAGE METHOD AND SYSTEM - The present invention is applicable to the field of computer technologies and provides a binary tree storage method and system. The method includes: dividing a binary tree into a root tree and a plurality of subtrees, where the plurality of subtrees is layered and stored in N levels of storages; partitioning the plurality of subtrees into M types according to a preset rule, so that the plurality of subtrees is partitioned into N×M data blocks; and adjusting storage positions of the N×M data blocks in the storages, so that a storage at each level occupies the same number of storage units. In the present invention, storage spaces for nodes at each level, which are spaces of non-uniform sizes, are normalized into spaces of the same size, thereby increasing a space utilization rate of storages. | 11-07-2013 |
20130304997 | Command Throttling for Multi-Channel Duty-Cycle Based Memory Power Management - A technique for memory command throttling in a partitioned memory subsystem includes accepting, by a master memory controller included in multiple memory controllers, a synchronization command. The synchronization command includes command data that includes an associated synchronization indication (e.g., synchronization bit(s)) for each of the multiple memory controllers and each of the multiple memory controllers controls a respective partition of the partitioned memory subsystem. In response to receiving the synchronization command, the master memory controller forwards the synchronization command to the multiple memory controllers. In response to receiving the forwarded synchronization command each of the multiple memory controllers de-asserts an associated status bit. In response to receiving the forwarded synchronization command, each of the multiple memory controllers determines whether the associated synchronization indication is asserted. Each of the multiple memory controllers with the asserted associated synchronization indication then transmits the forwarded synchronization command to associated power control logic. | 11-14-2013 |
20140006726 | STORAGE SYSTEM COMPRISING MULTIPLE STORAGE APPARATUSES WITH BOTH STORAGE VIRTUALIZATION FUNCTION AND CAPACITY VIRTUALIZATION FUNCTION | 01-02-2014 |
20140059302 | COMPUTER SYSTEM - A hypervisor as a movement source stores key information, and the key information is registered in a storage using the stored key information through a logical HBA which is used for migration. | 02-27-2014 |
20140075130 | SHARING AND SYNCHRONIZING DATA ACROSS USERS OF CLOUD COMPUTING SYSTEMS - The disclosed embodiments provide a system that processes data from a user. During operation, the system obtains, at a cloud computing system, a set of data-sharing preferences for the user. Next, the system creates a set of virtual storage partitions for the user with the cloud computing system based on the data-sharing preferences. Upon receiving data from the user to the cloud computing system, the system associates the data with a virtual storage partition from the set of virtual storage partitions based on the data-sharing preferences and a set of data attributes for the data. Finally, the system manages access to the virtual storage partition by one or more other users based on the data-sharing preferences. | 03-13-2014 |
20140082301 | 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. | 03-20-2014 |
20140136800 | DYNAMICALLY IMPROVING MEMORY AFFINITY OF LOGICAL PARTITIONS - In a computer system that includes multiple nodes and multiple logical partitions, a dynamic partition manager computes current memory affinity and potential memory affinity to help determine whether a reallocation of resources between nodes may improve memory affinity for a logical partition or for the computer system. If so, the reallocation of resources is performed so memory affinity for the logical partition or computer system is improved. Memory affinity is computed relative to the physical layout of the resources according to a hardware domain hierarchy that includes a plurality of primary domains and a plurality of secondary domains. | 05-15-2014 |
20140136801 | DYNAMICALLY IMPROVING MEMORY AFFINITY OF LOGICAL PARTITIONS - In a computer system that includes multiple nodes and multiple logical partitions, a dynamic partition manager computes current memory affinity and potential memory affinity to help determine whether a reallocation of resources between nodes may improve memory affinity for a logical partition or for the computer system. If so, the reallocation of resources is performed so memory affinity for the logical partition or computer system is improved. Memory affinity is computed relative to the physical layout of the resources according to a hardware domain hierarchy that includes a plurality of primary domains and a plurality of secondary domains. | 05-15-2014 |
20140181425 | METHOD FOR DIVISIONALLY MANAGING FILES ON A USER BASIS, AND A STORAGE SYSTEM AND COMPUTER PROGRAM PRODUCT THEREOF - According to one embodiment, a method for a plurality of users to write at least one file to a medium in such a manner that the file is divisionally managed in a system environment in which an input/output control is performed on a storage system includes saving, in the medium as metadata, a user identifier (ID) for identifying a user and file attribute information about the file managed by a user associated with the user ID, and writing, as data, the file managed by the user to the medium as indicated by the file attribute information. In other embodiments, a writing program product, a reading program product, and a system are presented that allow a plurality of users to write at least one file to a medium in such a manner that the file is divisionally managed in a system environment. | 06-26-2014 |
20140237196 | CHARGED PARTICLE BEAM WRITING APPARATUS, AND BUFFER MEMORY DATA STORAGE METHOD - A charged particle beam writing apparatus includes a buffer memory including a memory region capable of contemporarily storing writing data for data processing regions, wherein writing data including data files is temporarily stored for each of the data processing regions, a dividing unit to divide the memory region of the buffer memory into a first region being large and a second region being small, a specifying unit to specify the memory region such that a data file being large is preferentially stored in the first region and a data file being small is stored at least in the second region, concerning the data files for each of the data processing regions included in the writing data, and a data processing unit to read data files corresponding to each of the data processing regions from the buffer memory, and to perform data processing using the read data files. | 08-21-2014 |
20140237197 | NON-UNIFORM MEMORY ACCESS (NUMA) RESOURCE ASSIGNMENT AND RE-EVALUATION - A system and a method are disclosed for providing for non-uniform memory access (NUMA) resource assignment and re-evaluation. In one example, the method includes receiving, by a processing device, a request to launch a first process in a system having a plurality of Non-Uniform Memory Access (NUMA) nodes, determining, by the processing device, a resource requirement of the first process, determining, based on resources available on the plurality of NUMA nodes, a preferred NUMA node of the plurality of NUMA nodes to execute the first process, the preferred NUMA node being determined by the processing device without user input, and binding, by the processing device, the first process to the preferred NUMA node. | 08-21-2014 |
20140250277 | MEMORY SYSTEM - According to one embodiment, a memory system comprises a storage areas each having a physical page that is data-write- and read-accessible, the storage areas being divided into a plurality of parallel operation elements capable of performing a parallel operation, and the physical pages of the storage areas being associated with a logical page, a storage unit having a first buffer configured to store data to be rewritten in the storage areas, and a control unit configured to perform data transfer between the storage areas and the storage unit. The control unit comprises a logical page management unit configured to divide the logical page in a predetermined number of parallel operation elements out of the plurality of parallel operation elements, and a system control unit configured to perform a predetermined operation in each of the divided logical pages. | 09-04-2014 |
20140281287 | 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. | 09-18-2014 |
20140281288 | 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. | 09-18-2014 |
20140281289 | 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. | 09-18-2014 |
20140297971 | CONTROL PROGRAM OF STORAGE CONTROL DEVICE, CONTROL METHOD OF STORAGE CONTROL DEVICE AND STORAGE CONTROL DEVICE - For segments having the number of IOs exceeding a threshold, a data collection unit connects adjacent segments whose distance is within “s” to each other and extracts the connected segments and segments in the range of “s” from outside of the connected segments as an n_segment. A workload analysis unit then determines a target whose data is moved from an HDD to an SSD in units of n_segments. | 10-02-2014 |
20140297972 | MEMORY CONTROL DEVICE AND MEMORY CONTROL METHOD - A memory control device has a write-request distribution unit and controllers. The write-request distribution unit divides data to be written in a memory and outputs a plurality of divided data blocks obtained by the division while distributing the divided data blocks to a plurality of buses. The controllers write the plurality of divided data blocks output by the write-request distribution unit in the memory through the plurality of buses, with the divided data blocks being in contact with each other in each of the buses. | 10-02-2014 |
20140325163 | Cross-Partition Shared Memory Attach for Data Processing Environment - A technique for managing shared memory includes linking address translation data structures used by first and second sharing applications. The first sharing application is managed by a first operating system (OS) and the second sharing application is managed by a second OS that hosts an associated virtual object. Virtual addresses of the first and second sharing applications are bound, based on the linking, to a changeable set of physical addresses that the second OS assigns to the associated virtual object such that the associated virtual object, which is shared by the sharing applications, is pageable by the second OS without permission of the first OS. | 10-30-2014 |
20140344530 | METHOD AND SYSTEM OF IMPLEMENTING A DATABASE INDEX IN SHARED MEMORY - In one exemplary embodiment, a method includes allocating an arena block of a shared memory of a database node server. The arena block is divided into one or more slots. The one or more slots include a discreet and constant area of memory within the arena block. Each slot is assigned a constant-memory address relative to an arena-block's shared memory address. The index is implemented as a red-black tree data structure. Each red-black tree node is mapped to a slot. Each red-black-tree node is provided a pointer to one or more neighbor nodes. The index stored in shared memory can be used during a ‘warm’ rebooting process. | 11-20-2014 |
20140380001 | PARTITIONING SYSTEMS OPERATING IN MULTIPLE DOMAINS - Within a partitioned system, a first system partition operates in a safety domain in which predictable operation of the first system partition is necessary to protect the system or operators of the system from harm. A second system partition operates in a user domain in which information supplied by the second system partition is not sufficiently reliable to be used by the first system partition within the safety domain. A mediator controller is connected between the first system partition and the second system partition. The mediator controller receives the information supplied by the first system partition. The mediator controller monitors and supervises use of the information by the second system partition in order maintain requirements of the safety domain to protect the system or operators of the system from harm. | 12-25-2014 |
20150026419 | OPERATING SYSTEM VIRTUALIZATION FOR HOST CHANNEL ADAPTERS - A host information handling system (IHS) provides virtualization of host channel adapters (HCAs). A hypervisor partitions a system memory of the host IHS into multiple logical partitions (LPARs). A particular LPAR includes a single instance of an operating system. The single instance of the operating system includes a common layer that provides virtualization of physical HCAs and sharing of the physical HCAs by multiple virtual HCAs. | 01-22-2015 |
20150100742 | COMPATIBLE VIRTUAL MACHINE JOINER - A method, system and computer readable medium for joining multiple virtual machines (VMs). The method includes identifying a first virtual machine (VM) executing a first operating system (OS) for joining with a second VM executing a second OS, wherein the first OS and the second OS are compatible. A new VM having a new disk is created, wherein the new disk includes the contents of a first existing disk of the first VM and a second existing disk of the second VM. | 04-09-2015 |
20150127916 | DYNAMIC MEMORY ALLOCATION - A method includes calling a function of a memory class object to cause access to a value in a memory table of the memory class object so as to dynamically allocate a memory for access by an operating system. The memory class object represents the memory. The value corresponds to a property of a memory slice selected from a plurality of memory slices into which the memory is partitioned. | 05-07-2015 |
20150363310 | MEMORY HEAPS IN A MEMORY MODEL FOR A UNIFIED COMPUTING SYSTEM - A method and system for allocating memory to a memory operation executed by a processor in a computer arrangement having a first processor configured for unified operation with a second processor. The method includes receiving a memory operation from a processor and mapping the memory operation to one of a plurality of memory heaps. The mapping produces a mapping result. The method also includes providing the mapping result to the processor. | 12-17-2015 |
20160026400 | LOADING METHOD AND DIVIDING METHOD - A loading method includes steps of providing a storage device and a system, among which the storage device having at least one physical storage partition is installed in the system, booting the system, loading an identifying program, inputting an identifying information corresponding to an user, and loading the physical storage partition of the storage device corresponding to the user according to the identifying information. As a result, accesses of unauthorized users are avoided, and external accesses and software cracking are also avoided. Meanwhile, the management of the system is simplified, and a real multiboot function is achieved. | 01-28-2016 |
20160034205 | SYSTEMS AND/OR METHODS FOR LEVERAGING IN-MEMORY STORAGE IN CONNECTION WITH THE SHUFFLE PHASE OF MAPREDUCE - Certain example embodiments relate to a computer system for performing a map reduce sequence. Nodes therein include at least one processor and memory and are divided into at least mapper and reducer nodes. Each mapper node executes a map function on input to generate intermediate output elements. Each said intermediate output element includes a first key-value pair. Each element key includes associated map and reduce task identifiers. Each element value includes substantive data, organized as another key-value pair. The intermediate output elements are stored to memory. Each reducer node: retrieves at least intermediate output element values from the memory of a given mapper node, using specified map and reduce task identifiers; stores the retrieved element values to its memory; executes a reduce function on the retrieved element values, in order; and outputs a result from the reduce function for the map reduce sequence. Disk operations advantageously are reduced or eliminated. | 02-04-2016 |
20160070484 | DATA SHUFFLING IN A NON-UNIFORM MEMORY ACCESS DEVICE - A method of orchestrated shuffling of data in a non-uniform memory access device that includes a plurality of processing nodes that are connected by interconnects. The method includes running an application on a plurality of threads executing on the plurality of processing nodes. Data to be shuffled is identified from source threads running on source processing nodes among the processing nodes to target threads executing on target processing nodes among the processing nodes. The method further includes generating a plan for orchestrating the shuffling of the data among the all of the memory devices associated with the threads and for simultaneously transmitting data over different interconnects to a plurality of different target processing nodes from a plurality of different source processing nodes. The data is shuffled among all of the memory devices based on the plan. | 03-10-2016 |
20160070589 | SCALABLE LOG-BASED TRANSACTION MANAGEMENT - A first transaction manager of a partitioned storage group stores a first conditional commit record for a first write of a multi-partition transaction based on a first conflict detection operation. A second transaction manager stores a second conditional commit record for a second write of the transaction based on a second conflict detection operation. A client-side component of the storage group determines that both writes have been conditionally committed, and stores an unconditional commit record in a commit decision repository. A write applier examines the first conditional commit record and the unconditional commit record before propagating the first write to the first partition. | 03-10-2016 |
20160077965 | Categorizing Memory Pages Based On Page Residences - Embodiments of the present invention provide hints for page stealing by prioritizing pages based on the number of residences. Receiving a plurality of pages to be hinted to a hypervisor for page stealing. Determining at least two page types of the plurality of pages. Determining whether any of the at least two page types has a total number of residences less than a total number of potential residences in the virtual environment for all page types and have a total number of residences less than a threshold. Responsive to determining a first page type of the at least two page types has a total number of residences less than a total number of potential residences for all page types and has a total number of residences less than a threshold, notifying the hypervisor of at least one page from the plurality of pages that is the determined first page type. | 03-17-2016 |
20160098210 | PAGE COMPRESSION STRATEGY FOR IMPROVED PAGE OUT PROCESS - A page compression strategy classifies uncompressed pages selected for compression. Similarly classified pages are compressed and bound into a single logical page. For logical pages having pages with more than one classification, a weighting factor is determined for the logical page. | 04-07-2016 |
20160154750 | SEMICONDUCTOR DEVICE INCLUDING A GLOBAL BUFFER SHARED BY A PLURALITY OF MEMORY CONTROLLERS | 06-02-2016 |
20160162199 | MULTI-PROCESSOR COMMUNICATION SYSTEM SHARING PHYSICAL MEMORY AND COMMUNICATION METHOD THEREOF - A multi-processor communication system sharing a memory and a communication method thereof are provided. The multi-processor communication system includes a plurality of processors configured to share data with one another; and the physical memory divided into a plurality of physical memory blocks, wherein each of the processors has one dedicated physical memory block among the plurality of physical memory blocks, wherein a processor among the plurality of processors is configured, as a transmission processor, to transmit data to a dedicated physical memory block of another processor among the plurality of processors, which is configured, as a reception processor, to receive data, and wherein the reception processor reads the data from the dedicated physical memory block of the reception processor. | 06-09-2016 |
20160179375 | ALLOCATING AND CONFIGURING PERSISTENT MEMORY | 06-23-2016 |
20160179389 | RESOURCE SHARING IN A TELECOMMUNICATIONS ENVIRONMENT | 06-23-2016 |
20160188207 | ELECTRONIC SYSTEM WITH LEARNING MECHANISM AND METHOD OF OPERATION THEREOF - An electronic system includes: a storage interface configured to receive system information; a storage control unit, coupled to the storage interface, configured to implement a preprocessing block for partitioning data based on the system information; and a learning block for processing partial data of the data for distributing machine learning processes. | 06-30-2016 |
20180024749 | INFORMATION PROCESSING APPARATUS, NON-TRANSITORY COMPUTER-READABLE RECORDING MEDIUM HAVING STORED THEREIN PROGRAM, AND METHOD FOR PROCESSING INFORMATION | 01-25-2018 |