Abstract: A computer-based method for creating enforced, context-specific sharing of ontologically mapped, aggregated medical data includes storing at least one data field in a database as an entity type ontology, receiving context-specific rule configurations corresponding to the entity type ontology, and identifying any conflict between the received context-specific rule and any applicable rule. The context-specific rule configurations include at least one context, one data source, and one entity type ontology data field. If a conflict is identified, the method receives resolution of the conflict and stores the context-specific rule configurations in the database.

Abstract: A system for managing data sharing and permissioning for a plurality of sensitive information across disparate entities and contexts. The system enables multiple tiers of permission rules that may vary by requesting user, specific data fields, and sharing context. The system provides patients or other users who provide data with an interface to select permission rules so that other users may access that data in a controlled manner. The system is capable of capturing and structuring the logic of written laws, consent agreements, and individual user preferences that enable or restrict data sharing among users. The system provides a requesting user with an interface to query the data about a patient or other entity, where data access is enabled by applicable rules. These rules may be set and controlled by the user, other users with permission to set access controls on the user's behalf, or any laws or consent agreements governing data sharing among users.

Abstract: A mechanism for selectively disabling and enabling read caching based on past performance of the cache and current read/write requests. The system improves overall performance by using an autonomic algorithm to disable read caching for regions of backend disk storage (i.e., the backstore) that have had historically low cache hit ratios. The result is that more cache becomes available for workloads with larger hit ratios, and less time and machine cycles are spent searching the cache for data that is unlikely to be there.

Abstract: An apparatus, system, and method are disclosed for parallelizing access to shared assets. A size module determines if a size of a first spoke of a plurality of spokes is greater than a low threshold. The spokes are arranged in a circular order wherein a global spoke pointer identifies the first spoke as a current spoke. Each spoke is configured as an asset queue. A request module requests an asset from the first spoke if the size of the first spoke is greater than the low threshold. A rotate module rotates the global spoke pointer to a second spoke of the plurality of spokes if the size of the first spoke is not greater than the low threshold, wherein the second spoke becomes the current spoke.

Abstract: An apparatus, system and method to optimize load distribution across logical and physical resources in a storage system. An apparatus in accordance with the invention may include an availability module and an allocation module. The availability module may dynamically assign values to resources in a hierarchical tree structure. Each value may correspond to an availability parameter such as allocated volumes, current resource utilization, and historic resource utilization. The allocation module may serially process the values and allocate a load to a least busy resource in the hierarchical tree structure based on the assigned values.

Abstract: A method, system and computer program product for minimizing read response time in a storage subsystem including a plurality of resources is provided. A middle logical block address (LBA) is calculated for a read request. A preferred resource of the plurality of resources is determined by calculating a minimum seek time based on a closest position to a last position of a head at each resource of the plurality of resources, estimated from the middle LBA. The read request is directed to at least one of the preferred resource or an alternative resource.

Abstract: A method, system and computer program product for minimizing read response time in a storage subsystem including a plurality of resources is provided. A middle logical block address (LBA) is calculated for a read request. A preferred resource of the plurality of resources is determined by calculating a minimum seek time based on a closest position to a last position of a head at each resource of the plurality of resources, estimated from the middle LBA. The read request is directed to at least one of the preferred resource or an alternative resource.

Abstract: An apparatus, system and method to optimize load distribution across logical and physical resources in a storage system. An apparatus in accordance with the invention may include an availability module and an allocation module. The availability module may dynamically assign values to resources in a hierarchical tree structure. Each value may correspond to an availability parameter such as allocated volumes, current resource utilization, and historic resource utilization. The allocation module may serially process the values and allocate a load to a least busy resource in the hierarchical tree structure based on the assigned values.

Abstract: An apparatus, system, and method are disclosed for parallelizing access to shared assets. A size module determines if a size of a first spoke of a plurality of spokes is greater than a low threshold. The spokes are arranged in a circular order wherein a global spoke pointer identifies the first spoke as a current spoke. Each spoke is configured as an asset queue. A request module requests an asset from the first spoke if the size of the first spoke is greater than the low threshold. A rotate module rotates the global spoke pointer to a second spoke of the plurality of spokes if the size of the first spoke is not greater than the low threshold, wherein the second spoke becomes the current spoke.