Abstract: A method, data processing system, and computer program product autonomously migrate clients serviced by a first VIOS to other VIOSes in the event of a VIOS cluster “split-brain” scenario generating a primary sub-cluster and a secondary sub-cluster, where the first VIOS is in the secondary sub-cluster. The VIOSes in the cluster continually exchange keep-alive information to provide each VIOS with an up-to-date status of other VIOSes within the cluster and to notify the VIOSes when one or more nodes loose connection to or are no longer communicating with other nodes within the cluster, as occurs with a cluster split-brain event/condition. When this event is detected, a first sub-cluster assumes a primary sub-cluster role and one or more clients served by one or more VIOSes within the secondary sub-cluster are autonomously migrated to other VIOSes in the primary sub-cluster, thus minimizing downtime for clients previously served by the unavailable/uncommunicative VIOSes.

Abstract: In a data processing system having a plurality of virtual input/output servers (VIOSes) configured within a VIOS cluster, a method, data processing system and computer program product provide for autonomous election of a primary node within a virtual input/output server (VIOS) cluster. A first VIOS performs the functions of: detecting that a primary node is required for the VIOS cluster; and autonomously initiating an election process to elect a next primary node from among the VIOSes within the VIOS cluster. When the first VIOS meets the pre-established requirements for becoming a primary node, the first VIOS obtains a lock on a primary node ID field within a VIOS database (DB) and then initiates a primary node commit process to assign the first VIOS as the primary node. The first VIOS issues a notification to the VIOS cluster to notify the other VIOSes that a primary node has been elected.

Abstract: A first Virtual Input/Output Server (VIOS) of a VIOS cluster performs the functions of: generating, at a sending daemon of the first VIOS, a send message that is to be transmitted to a receiving daemon at a second VIOS; in response to completion of the generating of the send message, forwarding the send message to a sending virtual small computer systems interface (vscsi) kernel extension (VKE) via a system call interface; and in response to the sending VKE receiving the send message from the sending daemon, forwarding the send message to one or more second VIOSes within the VIOS cluster utilizing a kcluster interface. The sending VKE parses at least one of a message header and a sub-header of the send message; and responsive to detection of a broadcast setting for the send message, the VKE forwards the send message to all nodes within the cluster via a cluster broadcast.

Abstract: A method, data processing system and computer program product provide scalable data synchronization for a virtual input/output server (VIOS) cluster and one or more registered callers. A first VIOS is commits as a primary node of the VIOS cluster and performs the functions of: registering one or more callers to receive notification from the first VIOS of specific events occurring within the cluster; receiving notification of an occurrence of one of the specific events; and in response to receiving notification of the specific events, a deamon of the first VIOS retrieving a message payload file from a message payload file directory within the shared VIOS DB and passing the message payload file to the API, which forwards/posts the relevant event notification information from the message payload file to the TCP socket of each registered caller.

Abstract: In a Virtual Input/Output (I/O) Server (VIOS) partition, a method comprises a cluster aware (CA) operating system (OS) of a VIOS partition performing the functions of: responsive to a restore command: retrieving a configuration backup file from storage; comparing a DRC name from the retrieved file with a DRC name of the current VIOS partition performing the restore operation; in response to an occurrence of a DRC name mismatch: retrieving an initial UUID of the VIOS from the configuration backup file; accessing a UUID table within a management tool; locating a matching UUID to the initial UUID within the UUID table; and in response to locating the matching UUID: verifying that the configuration data file belongs to the current VIOS initiating the restore operation; and performing the restore operation to restore the configurations of the hardware, logical and virtual devices of the first VIOS to an earlier configuration state.

Abstract: A method, system, and computer program product provides simultaneous debugging of multiple OS image and/or system dump pairs in a distributed storage repository. A management console receives a terminal debugging session request and a cluster selection from an interface and starts a debugger instance. The debugger instance autonomously identifies client LPARs and loads the system dump images assigned to the client LPARs. In response to receiving a selection of a first and second client LPARs, the debugger analyzes the first and second system dump images, respectively, and calculates relational information between the first analysis and the second analysis via one or more logical reasoning utilities of the management console. The debugger then loads the relational information to the management console interface with an analysis of one or more similarities between the first and second system dumps.

Abstract: A method enables cluster-level backup and restore functionality of all Virtual Input/Output Server (VIOS) configuration data within a VIOS cluster and the data of a shared VIOS cluster database. The method comprises: performing, via a backup/restore utility of a VIOS partition, a cluster level backup, which creates a first VIOS cluster configuration backup file having configuration information about hardware, logical and virtual devices of each VIOS partition within a VIOS cluster and all cluster data from the shared VIOS database of the VIOS cluster; storing the VIOS cluster configuration backup file within a storage location; and responsive to receipt of a VIOS restore command at a VIOS partition: retrieving the configuration backup file from the storage location; restoring a configuration of the hardware, logical and virtual devices of each VIOS within the VIOS cluster to prior state; and restoring the shared VIOS database with the backed-up cluster data.

Abstract: A method, system, and computer program product utilizes cluster-awareness to effectively maintain and update Persistent Reserve (PR) state data and provide nodes with notification of changes to PR state data within a Virtual Input/Output (I/O) Server (VIOS) cluster. A Persistent Reserve (PR) utility identifies a database that is accessible to other VIOSes in the cluster, in which database information about the current state of the Persistent Reservation is maintained. The PR utility checks the current Persistent Reserve state in the database to verify whether an initiator of a PR command is allowed to perform the command. If the initiator is allowed to perform the command, the PR utility modifies/updates the Persistent Reserve state in the database to reflect the received Persistent Reserve command. The PR utility updates the initiator's local copy of the modified PR state data and sends a corresponding notification message to other VIOSes in the cluster.

Abstract: In some embodiments, a partitioned database is stored in a plurality of logical or physical partitions on at least a logical or physical first data storage node, and a subset of a first partition among the plurality of logical partitions is configured as a virtual partition. An input indicating an allocation of a second physical data storage node to store the partitioned database is received. A second partition is configured on the second data storage node. In response to the input, the partitioned database is redistributed over the first and second data storage nodes by moving data within the virtual partition on the first partition to the second partition.

Abstract: A method of serialization in a data processing system includes serializing a mutable object utilizing a full serialization process, caching primitive data and metadata regarding the mutable object in binary format in cache and then checking whether primitive fields of the mutable object are modified. Thereafter, the mutable object is again serialized utilizing an abbreviated serialization process by reference to the cached primitive data and metadata if the primitive fields of the object are not modified. In the event that primitive fields of the object are modified, the full serialization process is utilized. Thereafter, the serialized mutable object is communicated to a distributed code element.

Abstract: A method for performing refresh operations is disclosed. In response to a completion of a memory operation, a determination is made whether or not a refresh backlog count is greater than a first predetermined value. In a determination that the refresh backlog count is greater than the first predetermined value, a refresh operation is performed as soon as possible. In a determination that the refresh backlog count is not greater than the first predetermined value, a refresh operation is performed after a delay of an idle count value.

Abstract: In a computer system supporting memory compression, wherein memory compressed data is managed in units of memory sectors of size S, wherein data is stored on disk in a different compressed format, and wherein data on said disk is managed in units of disk sectors of size D, a method for storing memory compressed data on a compressed disk includes combining at least one of compressed memory directory information, a system header, compressed data controls, and pads into a data structure having a same size S as a memory sector, grouping the data structure and the data contained in the desired memory sectors into groups of D/S items, and storing each of the groups in a separate disk sector.

Abstract: A method, a system and a computer program product for effectively accelerating loop iterators using speculative execution of iterators. An Efficient Loop Iterator (ELI) utility detects initiation of a target program and initiates/spawns a speculative iterator thread at the start of the basic code block ahead of the code block that initiates a nested loop. The ELI utility assigns the iterator thread to a dedicated processor in a multi-processor system. The speculative thread runs/executes ahead of the execution of the nested loop and calculates indices in a corresponding multidimensional array. The iterator thread adds all the precomputed indices to a single queue. As a result, the ELI utility effectively enables a multidimensional loop to be replaced by a single dimensional loop. At the beginning of (or during) each iteration of the iterator, the ELI utility “dequeues” an entry from the queue to use the entry to access the array upon which the ELI utility iterates.

Abstract: A data processing system establishes a mapping between each of a plurality of plurality of internal data sources within a service organization and a respective one of multiple service quality factors. The data processing system determines a mathematical transformation of internal service quality data obtained from the plurality of internal data sources to obtain a customer satisfaction value. The data processing system estimates and reports a service quality delivered by the service organization by applying the mathematical transformation to at least some of the internal service quality data obtained from the plurality of internal data sources.

Abstract: The invention includes methods and software for presenting a user with a set of interfaces that reveal what events are to occur, or are likely to occur, in a transaction, and provide the ability to program the automatic monitoring of these anticipated events with a customizable set of alerts. A merchant encodes events that are possible for the transaction as part of developing an online transaction system such as an online catalog. The data regarding these events is encoded in an electronic communication, such as an email or onsite transaction history item, such that this data can be detected by a receiving system. The method includes presenting and setting monitoring options for event notices that have not yet been received. The chosen options for event notices that have not yet been received are used to program the monitoring and alerting of the user when such event notices have or have not been received.

Abstract: Disclosed is a system and method for validating and repairing flow diagrams using a process modeling validation method in conjunction with a process modeling repair method. The process modeling validation method points out structural ambiguities in a flow diagram that can make its automatic interpretation difficult. It also proposes fix to resolve such ambiguities. The method discloses a process semantic annotation scheme that can interpret process semantics in a flow graph implicit in a flow diagram. Further, the validation process compares one or more components of one or more drawings to a set of rules determined by a business process modeling standards and provides a set of semantic errors describing faulty parts of the drawing that do not comply with the business process modeling standards. The process modeling repair method corrects the drawing to ease and enable its automatic interpretation of the flow diagram and make the faulty parts of the drawing comply with the business process modeling standards.

Abstract: A computer-implemented method, system, and program product for automatically reviewing a mapping between information models. The method includes: receiving a mapping between an element in the first information model to an element in the second information model. Each element is associated with an element identifier and an element value, and the mapping signifies a relationship between the element in the first information model and the element in the second information model. The method further includes comparing the received mapping against one or more known indications of suspicious mappings to determine if the received mapping resembles one of the indications of suspicious mappings. If the received mapping is determined to be suspicious, identifying the received mapping as one that requires review.

Abstract: A method, system, and computer program product for creating and implementing file clones using reverse ditto references. A clone inode is created as a copy of an original inode. The clone inode and the original inode are indistinguishable to an end user. Each additional file clone created spawns a clone inode. An immutable clone-parent inode is created that contains the disk block addresses, while writable clones inode instead contain dittos linking the clone inode to data blocks referenced in the clone-parent inode. Data block address links in the original inode are moved to the new clone-parent inode and dittos replace the original data block address links in the original inode. When a clone file is updated, the new data is written to a new disk location and a corresponding ditto in the clone inode is replaced with a data block link address, keeping the data of the clone-parent inode intact.

Abstract: According to one embodiment of the present invention, a method for echocardiogram view classification is provided. According to one embodiment of the present invention, a method comprises: obtaining a plurality of video images of a subject; aligning the plurality images; using the aligned images to generate a motion magnitude image; filtering the motion magnitude image using an edge map on image intensity; detecting features on the motion magnitude image, retaining only those features which lie in the neighborhood of intensity edges; encoding the remaining features by generating, x, y image coordinates, a motion magnitude histogram in a window around the feature point, and a histogram of intensity values near the feature point; and using the encoded features to classify the video images of the subject into a predetermined classification.

Abstract: The likelihood of a problem report being escalated to a critical status in a customer service environment is predicted by receiving historical Problem Management Records for which associated problems have been resolved and final criticality statuses have been determined, analyzing the historical Problem Management Records using at least one trainable data mining process to produce a prediction output for each historical Problem Management Record, validating the prediction output against the final criticality statuses, training the data mining process according to the validation, and, subsequently, analyzing an unresolved Problem Management Record by the trained analysis module to produce a prediction indicator and a confidence indicator for unresolved Problem Management Record to be re-classified as critical status. The unresolved Problem Management Record is escalated to critical status level responsive to the prediction indicator and the confidence indicator exceeding a predetermined threshold.