International Business Machines Corporation

Eric Philip Fried

Lance Warren Russell

Suresh Sabarathinam

Rajeev Kumar Mishra

Amartey S Pearson

Vinit Jain

Swaroop Jayanthi

Vijayasekhar Mekala

David Jones Craft

Thangadurai Muthusamy

John Richard Houlihan

Diane Garza Flemming

Perinkulam I Ganesh

David Blair Whitworth

Dean J Burdick

Carol B Hernandez

Greg Robert Mewhinney

Marc Joel Stephenson

Stephen J Tovcimak

Jorge D Rodriguez

David Glenn Grost

Jeremy J Miller

Natalie J Miller

Silpa Kosanam

Joshua R Teal

Kevin J Kokal

Susan T K Jasinski

Shevaun M Fontenot

Kyle E Johnson

Anand Goyal

Andrew J Lin

Willaim B Huber

Sandeep R Patil

Susann Marie Keohane

Randal Craig Swanberg

Ravi Shankar

Narsimha Reddy Challa

Stephen Bailey Peckham

Chris Alan Schwendiman

Stephen M Tee

Murali Vaddagiri

Ranadip Das

Vamshi Krishna Thatikonda

Manjunath A Pattanshetti

Sailaja R Keshireddy

Srikanth Vishwanathan

Kevin William Monroe

Virginia Ann Wigginton

Kenneth Joseph Burger

Priyanka Jade

Yolimar Doccttel

Kendell D Zahn

Konagalli N Rajesh

Rajeev Mirsha

Jorge D Rodriquez

Jennifer R T Dietrich

Kotaiah Chinnam

Sipla Kosanam

Techniques are provided for automatically generating a hierarchical representation of a navigation order within a web browsing session in conjunction with a traversing of a plurality of websites within the browsing session: flagging a subset of the plurality of websites; displaying a user interface in conjunction with the browser such that the user interface provides a traversal control with respect to the subset in accordance with the hierarchical representation; and traversing the subset utilizing the traversal control.

Browser search result option to facilitate human spidering

A cloned configuration of a source machine is created by determining a first set of physical location codes for a source machine. A map is generated based on the sorted physical location codes that maps the first set of physical location codes to a first set of generic location codes. A second set of physical location codes associated with a second set of adapter slots in a target machine is generated. A second map is generated based on the sorted second set of physical location codes that maps the second set of physical location codes to a second set of generic location codes. A third set of physical location codes is generated based on the first set of generic location codes and the second map. If an entry in the third set of physical location codes is not present the second set of physical location codes, an error is generated.

Generic physical location codes for virtual system and partition cloning

A method and apparatus are provided for implementing enhanced deployment of a virtual machine (VM) in a cloud environment. VM boot profiling is performed and used for providing VM image download prioritization. The VM boot profiling facilitates the transfer of the earliest needed portions of the VM image first, allowing the VM to boot and begin operating quickly while the later needed portions of the VM image are still transferring.

Implementing VM boot profiling for image download prioritization

A method, system, and program product for hypervisor controlled redundancy for Input/Output (I/O) paths using virtualized I/O adapters is provided. A hypervisor detects a virtual machine exceeding a pre-defined bandwidth threshold. The hypervisor searches a shared pool of free virtual functions (VF) for a free VF. If the shared pool of free VFs is not depleted, a free VF is allocated to the virtual machine (VM). If the shared pool of free VFs is depleted, the active VMs are examined for VF capacity that may be donated to the triggering VM.

Hypervisor controlled redundancy for I/O paths using virtualized I/O adapters

Embodiments disclosed herein generally relate to techniques for providing a visualization of connectivity between components in a computer network. One embodiment provides a method which includes receiving a configuration of a network comprising a plurality of components within a physical layer and a virtual layer. The method also includes generating a resource diagram identifying connections that are accessible among the components of the physical layer and components of the virtual layer. The method further includes, upon receiving a selection of one of the components, determining a subset of the plurality of components that are connected to the selected component, and altering the resource diagram to provide a visualization, within the resource diagram, of the connections between the selected component and the determined subset of the plurality of components.

Dynamic highlight

Mechanisms are provided for performing a write operation on a shared resource in a cluster of data processing systems. The mechanisms determine whether a locally cached copy of the shared resource is present in a local cache memory. The mechanisms, in response to a determination that a locally cached copy is present, determine whether the locally cached copy is a latest version of the shared resource. The mechanisms, in response to determining that that locally cached copy is a latest version: perform the write operation on the locally cached copy to generate an updated locally cached copy, and transmit a cluster event notification to other data processing systems of the cluster indicating the shared resource was written to and which data processing system performed the write operation. The cluster event notification is logged in at least one change log data structure associated with the other data processing systems.

Efficient distributed cache consistency

A scheme for monitoring node operational status according to communications transmits messages periodically according to a heartbeat rate among the nodes. The messages may be gossip messages containing the status of the other nodes in the pairs, are received at the nodes and indications of the communications delays of the received messages are stored, which are used to compute statistics of the stored communications delays. Parameters of the node status monitoring, which are used for determining operational status of the nodes, are adjusted according to the statistics, which may include adjusting the heartbeat rate, the maximum wait time before a message is considered missed, and/or the maximum number of missed messages, e.g., the sequence number deviation, before the node is considered non-operational (down).

Dynamic rate heartbeating for inter-node status updating

The present invention provides a computer implemented method for communicating a signature in a received email. Initially, a server receives a source email from a source client, the source email comprising a signature index entry, and a body. The server determines for a first recipient that a first associated destination client is capable of rendering a signature of the signature index entry in response to a selection of an indexed signature. The server, responsive to a determination that the destination client is capable of rendering the signature index entry, forwards the source email to the first recipient as a delivered email using the body of the source email such that an indexed signature is present in the body of the delivered email. In addition, a method for generating a signature header is shown that provides a many to one correspondence between indexed signatures and a signature index entry.

Composing, forwarding, and rendering email system

A unique device name is assigned to each of a plurality of shared storage devices in a cluster configuration database defining membership of nodes in a cluster. A particular node among the nodes defined by the cluster configuration database as a member of the cluster searches the cluster configuration database for a device identifier matching a device identifier of a shared storage device hosted by the particular node. In response to finding a matching device identifier in the cluster configuration database, the particular node renames, in a local configuration maintained at the particular node, a storage device associated with the matching device identifier with the unique name assigned to that storage device in the cluster configuration database.

Propagation of unique device names in a cluster system

In response to a stimulus indicating configuration of a node into a cluster of a plurality of nodes including the node, the node determines whether or not the node has a universally unique identifier (UUID), and if not, the node provides its own persistent self-assigned UUID. The node searches a cluster configuration database for a temporary identifier associated with the node. In response to the node locating the temporary identifier of the node in the cluster configuration database, the node writes its self-assigned UUID into the cluster configuration database and joins the cluster.

Self-assignment of node identifier in a cluster system

A computer implemented method, apparatus, and computer usable program code for managing a software partition in logical partitioned data processing system. A virtual root process is created for the software partition, wherein the virtual root process functions as a root process for the software partition. The set of child processes is re-parented to the virtual root process in response to termination of a process having a set of child processes.

Managing an application software partition

Growing community of inventors

Austin, TX, United States of America

Eric Philip Fried