IBM Patent Applications

CONTROLLING VALVE OPERATION USING PRESSURE

Granted: September 7, 2017
Application Number: 20170251613
A valve body has a piston that slides within the body through four successive positions. The piston has a head, and an upper and lower skirt, with a port in the upper skirt. In the first position, a bias force urges the piston to the first of four positions, in which the piston port is closed. In a second position, the piston port aligns with a low pressure port in the valve body, when a low pressure supply of water is connected. In a third position, greater pressure again closes the…

USER-DEFINED FAILURE DOMAINS FOR SOFTWARE-DEFINED STORAGE SYSTEMS

Granted: September 7, 2017
Application Number: 20170255530
Methods, computing systems and computer program products implement embodiments of the present invention that include defining a plurality of failure domains for sets of storage devices in a storage facility, and defining, using the failure domains, one or more limitations for distributing data on the storage devices. Upon identifying a data distribution configuration for a software defined storage system that is compliant with the one or more limitations, the identified data distribution…

Multi-Section Garbage Collection

Granted: September 7, 2017
Application Number: 20170255551
The embodiments relate to a computer system, computer program product and method for managing a garbage collection process. Processing control is obtained based on execution of a load instruction and a determination that an object pointer to be loaded indicates a location within a selected portion of memory undergoing a garbage collection process. The determination includes identifying a base address and size of a first memory block subject to the garbage collection, subdividing the…

ENHANCING DATA CACHING PERFORMANCE

Granted: September 7, 2017
Application Number: 20170255568
For a cache in which a plurality of frequently accessed data segments are temporarily stored, reference count information of the plurality of data segments, in conjunction with least recently used (LRU) information, is used to determine a length of time to retain the plurality of data segments in the cache according to a predetermined weight, where notwithstanding the LRU information, those of the plurality of data segments having a higher reference counts are retained longer than those…

ANTIVIRUS SCAN DURING A DATA SCRUB OPERATION

Granted: September 7, 2017
Application Number: 20170255774
For an antivirus scan during a data scrub operation, an antivirus scan is concurrently performed as an overlap with the data scrub operation, wherein the data scrub operation periodically inspects and corrects memory errors. The antivirus scan concurrently performing as an overlap with the data scrub operation is increased if a reduction in disk access by a host application is detected. A number of antivirus scan input/output (I/O) operations and data scrub I/O operations is reduced.

CHANNEL OWNERSHIP IN A PUBLISH-SUBSCRIBE SYSTEM

Granted: September 7, 2017
Application Number: 20170257421
To manage channel ownership in a publish-subscribe data processing environment, a determination is made at a first server that a subscription request from a client relates to a channel, the channel having a channel identifier. At an exchange component in a messaging middleware, a session queue associated with the client is bound to the channel. A mandatory delivery message is configured to be routed using a publisher identifier by the exchange component, the publisher identifier being…

DYNAMIC CLIENT-BASED LEADER ELECTION

Granted: September 7, 2017
Application Number: 20170257430
A method, including deploying multiple servers as a distributed computing system (DCS) configured to provide a service to clients. At a first time, a given server is configured as an active node in the DCS, the active node configured to and to process requests for the service received from the clients. At the first time, one or more remaining first servers are configured as one or more semi-active nodes in the DCS, each given semi-active node configured to receive, from the clients,…

Hybrid Tracking of Transaction Read and Write Sets

Granted: August 31, 2017
Application Number: 20170249154
Tracking a processor instruction is provided to limit a speculative mis-prediction. A non-speculative read set indication and/or write set indication are maintained for a transaction. The indication(s) are stored in cache. In addition, a queue(s) of at least one address corresponding to a speculatively executed instruction is maintained. For a received request from a processor, a transaction resolution process takes place, and a resolution is performed if an address match in the queue is…

Disaster Recovery As A Service Using Virtualization Technique

Granted: August 31, 2017
Application Number: 20170249221
Embodiments of the invention relate to recovering from a disaster associated with an information technology environment. An information technology environment is replicated to a service provider. A recovery plan is generated for the environment. The recovery plan includes two processes. In response to the service provider receiving a disaster recovery request associated with the environment, the service provider executes a disaster recovery protocol. The protocol includes simultaneously…

IMAGING SEGMENTATION USING MULTI-SCALE MACHINE LEARNING APPROACH

Granted: August 31, 2017
Application Number: 20170249746
A robust segmentation technique based on multi-layer classification technique to identify the lesion boundary is described. The inventors have discovered a technique based on training several classifiers such that to classify each pixel as lesion versus normal Each classifier is trained on a specific range of image resolutions. Then, for a new test image, the trained classifiers are applied on the image. Then by fusing the prediction results in pixel level a probability map is generated.…

MANAGING SERVICE LEVELS PROVIDED BY SERVICE PROVIDERS

Granted: August 31, 2017
Application Number: 20170250878
A method and system for managing at least one service level of a service provided by a service provider to a customer of the service provider under a service level agreement. The service level agreement is a contract between the service provider and the customer. Measurement data and at least one adjudication element associated with a service level of the at least one service level are retrieved in an electronic format. The measurement data and the at least one adjudication element are…

DETERMINING MAXIMUM VOLUME SIZE

Granted: August 24, 2017
Application Number: 20170242610
Methods, computing systems and computer program products implement embodiments of the present invention that include receiving a request including a specified number of logical volumes, and identifying, in a storage system including multiple storage pools having storage space, respective first amounts of the storage space that are available in the multiple storage pools. Based on the specified number of logical volumes and the first amounts of the storage space, a set of volume sizes…

CONFIDENCE WEIGHTING OF COMPLEX RELATIONSHIPS IN UNSTRUCTURED DATA

Granted: August 24, 2017
Application Number: 20170243118
For confidence weighting relationships between complex entities in unstructured data an expressed relationship between a subset of a set of tokens is extracted from a knowledge graph corresponding to the unstructured data. The knowledge graph includes the set of tokens. The tokens in the subset of tokens are related in the expressed relationship by a set of predicates. A number of occurrences of the set of predicates in the unstructured data is determined. A number of occurrences of the…

COGNITIVE OPTIMAL AND COMPATIBLE GROUPING OF USERS FOR CARPOOLING

Granted: August 24, 2017
Application Number: 20170243172
A method for scheduling a carpool, including the steps of: receiving data representing carpooling reviews of a plurality of carpool users; determining, from the carpooling review data, a plurality of questions directed to ascertaining at least one preferences of a carpool user; retrieving from a plurality of reviews of a single carpool user at least one answer, where each retrieved answer corresponds to at least one of the plurality of questions; scheduling a carpool from a plurality of…

SERVICE MANAGEMENT MODES OF OPERATION IN DISTRIBUTED NODE SERVICE MANAGEMENT

Granted: August 24, 2017
Application Number: 20170244794
A distributed node service management system utilizes multiple existing processor nodes of a distributed computing system, in support of the primary data processing functions of the distributed computing system. The distributed node service management system coordinates and manages service functions on behalf of processor nodes of the distributed computing system. Other features and aspects may be realized, depending upon the particular application.

CLUSTER FAMILIES FOR CLUSTER SELECTION AND COOPERATIVE REPLICATION

Granted: August 17, 2017
Application Number: 20170235508
Cluster families for cluster selection and cooperative replication are created. The clusters are grouped into family members of a cluster family base on their relationships and roles. Members of the cluster family determine which family member is in the best position to obtain replicated information and become cumulatively consistent within their cluster family. Once the cluster family becomes cumulatively consistent, the data is shared within the cluster family so that all copies within…

DISTRIBUTED LOAD PROCESSING USING FORECASTED LOCATION-BASED INTERNET OF THINGS DEVICE CLUSTERS

Granted: August 17, 2017
Application Number: 20170235603
For distributed processing using forecasted location-based IoT device clusters, at a central IoT device, a data source that is to be used and a duration for processing a workload is determined. A set of IoT devices operating within a threshold distance from the data source at a first time is selected. A first subset of the IoT devices is selected to form a cluster of IoT devices where each IoT device satisfies a clustering condition. A second subset of the first subset is selected to…

DISTRIBUTED LOAD PROCESSING USING CLUSTERS OF INTERDEPENDENT INTERNET OF THINGS DEVICES

Granted: August 17, 2017
Application Number: 20170235604
For distributed processing using clustering of interdependent Internet of Things (IoT) devices, at a central device, a data source to be used for processing a workload is determined. A set is selected of devices operating within a threshold distance from the data source at a first time. A first subset of the set of devices is selected. Each device in the first subset satisfies a clustering condition. A first device in the subset is instructed to configure a lightweight application to…

DISTRIBUTED LOAD PROCESSING USING SAMPLED CLUSTERS OF LOCATION-BASED INTERNET OF THINGS DEVICES

Granted: August 17, 2017
Application Number: 20170235616
For distributed processing using sampled clusters of location-based Internet of Things (IoT) devices, at a central device, a data source to be used for processing a workload is determined. A set is selected of devices operating within a threshold distance from the data source at a first time. A first subset including a first sample number of devices is selected from the set. A ratio is determined of a first amount of a computing resource needed to process the workload and a second amount…

DISTRIBUTED LOAD PROCESSING USING DRIFT-BASED DYNAMIC CLUSTERS OF INTERNET OF THINGS DEVICES

Granted: August 17, 2017
Application Number: 20170237804
For distributed processing using drift-based dynamic clustering of Internet of Things (IoT) devices, at a central device, a data source to be used for processing a workload is determined. A set is selected of devices operating within a threshold distance from the data source at a first time. A first subset of the set of devices is selected to form a cluster of devices. Each device in the first subset satisfies a clustering condition. A first device in the first subset is instructed to…