Abstract: Rebuilding lost data in a distributed redundancy data storage system including multiple nodes, is provided. User data is stored as a collection of stripes, each stripe comprising a collection of data strips and associated parity strips, the stripes distributed across multiple corresponding data owner nodes and multiple corresponding parity owner nodes. A data owner node maintains the associated data strip holding a first copy of data, and a parity owner node maintains a parity strip holding a parity for the collection of data strips. Upon detecting a failure condition, the owner node initiates a rebuilding protocol for recovery of lost data and/or parity it owns. The protocol includes reconstruction of lost data or parity by a computation involving data and/or parity from a recovery strip set in a stripe, wherein a recovery strip set contains at least one surviving data or parity strip. The recovery strip set for a lost data strip contains at least one surviving parity strip.

Abstract: A personalized electronic healthcare management system and computer-implemented method thereof. The system includes a user interface configured to receive user profile information associated with a user as input by the user, and a server interfacing with the user interface. The server retrieves healthcare information from at least one external source, and provides the retrieved healthcare information to the user at the user interface. The healthcare information may be personalized to the user's needs. The server further retrieves social service program information from at least one host site, provides the retrieved social service program information to the user, and applies to at least one social service program of the at least one host site using the user profile information, when desired by the user, and retrieves interactive information to be presented to the user at the user interface.

Abstract: A computer program product and a system are provided. The product and system provide associations between individuals having health care needs and available social services. The providing is efficient and cost effective.

Abstract: A method for increasing the performance and utilization of cache memory by combining the data block frequency map generated by data de-duplication mechanism and page prefetching and eviction algorithms like Least Recently Used (LRU) policy. The data block frequency map provides weight directly proportional to the frequency count of the block in the dataset. This weight is used to influence the caching algorithms like LRU. Data blocks that have lesser frequency count in the dataset are evicted before those with higher frequencies, even though they may not have been the topmost blocks for page eviction by caching algorithms. The method effectively combines the weight of the block in the frequency map and its eviction status by caching algorithms like LRU to get an improved performance and utilization of the cache memory.

Abstract: Method and apparatus for performing distributed processing in a multi-processing unit environment. A first processing unit modifies a complex operation to provide an operational request packet comprising a corresponding simplex operation and remainder. The packet is communicated to a second processing unit which processes the packet to arrive at a result for the complex operation, preferably by arriving at a result for the simplex operation and combining this result with the remainder. In this way, inter-processor operations can be efficiently encoded and distributed to meet the requirements of a given architecture. Preferably, the first processing unit determines the remainder by separately arriving at the result for the complex operation. The complex operation is preferably characterized as a mathematical operation on a non-power of two operand (e.g., 30), and the simplex operation is characterized as a mathematical operation on a power of two operand (e.g., 32).

Abstract: A data storage system is provided comprising memory allocation information associated with a change in a system configuration of memory allocation within a memory space, and means for updating the system configuration by saving the memory allocation information before updating the system configuration. A recovery record comprises memory allocation information associated with the change in system configuration of memory allocation, and a completion indicator comprises a first value if the memory allocation information is included in the system configuration and comprises a second value if the memory allocation information is not included in the system configuration.

Abstract: A data storage system is provided comprising memory allocation information associated with a change in a system configuration of memory allocation within a memory space, and means for updating the system configuration by saving the memory allocation information before updating the system configuration. A recovery record comprises memory allocation information associated with the change in system configuration of memory allocation, and a completion indicator comprises a first value if the memory allocation information is included in the system configuration and comprises a second value if the memory allocation information is not included in the system configuration.

Abstract: A data storage system and associated method comprising system configuration information; a first processor adapted for identifying a portion of the system configuration information in response to a configuration change request to the memory space, and for signaling an update request incident with the configuration change request to a second processor; and a second processor adapted for updating the portion in response to the update request and independently of the first processor.

Abstract: Method and apparatus for performing distributed processing in a multi-processing unit environment. A first processing unit modifies a complex operation to provide an operational request packet comprising a corresponding simplex operation and remainder. The packet is communicated to a second processing unit which processes the packet to arrive at a result for the complex operation, preferably by arriving at a result for the simplex operation and combining this result with the remainder. In this way, inter-processor operations can be efficiently encoded and distributed to meet the requirements of a given architecture. Preferably, the first processing unit determines the remainder by separately arriving at the result for the complex operation. The complex operation is preferably characterized as a mathematical operation on a non-power of two operand (e.g., 30), and the simplex operation is characterized as a mathematical operation on a power of two operand (e.g., 32).