International Business Machines Corporation

Walter Church, Iv

Kenneth Galbraith

John Michael Hollenbeck

Scott Mason

Jason J Herne

Kevin Meeks

Ronald C Pierson

Thomas B Mathias

Kevin Scott Adams

Examples described herein provide a computer-implemented method that includes establishing, by a second processing system, a first connection with a first processing system. The method further includes receiving, by the second processing system, a first postcard from the first processing system via the first connection, the first postcard comprising information associated with the first processing system. The method further includes establishing, by the second processing system, a second connection with a third processing system. The method further includes transmitting, by the second processing system, a second postcard to the third processing system via the second connection, the second postcard comprising information associated with the second processing system. The method further includes transmitting, by the second processing system, the first postcard to the third processing system via the second connection.

Connecting computer processing systems and transmitting data

Examples described herein provide a computer-implemented method that includes assigning each of a plurality of processing systems to one of a plurality of groups. Each group of the plurality of groups cycles, based on an offset time period, between an advertiser state, a listener state, and a sleep state. The method further includes connecting a first processing system of a first group of the plurality of groups to a second processing system of a second group of the plurality of groups when the first group is in one of the listener state or the advertiser state and the second group is in the other of the listener state or the advertiser state.

An aspect of the invention includes a method for receiving a request to reclaim a portion of a memory assigned to a virtual machine (VM). In response to receiving the request, an increment of the plurality of increments to vacate is selected. The selecting is based at least in part on the failure counts corresponding to each of the plurality of increments. An attempt is made to vacate all contents of the selected increment. Based at least in part on determining that all contents of the selected increment were not vacated, a failure count corresponding to the selected increment is incremented. Based at least in part on determining that all contents of the selected increment were vacated, an assignment of the selected increment to the VM is removed.

Virtual machine memory removal increment selection

Examples described herein provide a computer-implemented method that includes converting, by a first processing system, a binary data stream into a string using encoding. The method further includes advertising, by the first processing system, standard characteristics to a second processing system. The method further includes receiving, by the first processing system, a request from the second processing system for a payload size and payload characteristics for the data to be transmitted from the first processing system to the second processing system. The method further includes transmitting, by the first processing system, the payload size and the payload characteristics to the second processing system.

In an approach, a processor receives a request to vacate a first page volume of a plurality of page volumes. A processor causes data stored to the first page volume to be moved to a second page volume of the plurality of page volumes. A processor monitors paging rate between a primary storage device and the plurality of page volumes. A processor, responsive to the paging rate exceeding a first predetermined threshold, adjusts a rate of data transfer from the first page volume to the second page volume.

Self-determination for in-progress volume draining

An aspect of the invention is a method that includes receiving a request from a requestor to reclaim a portion of a memory assigned to a virtual machine (VM). The memory includes real memory that is divided into a plurality of increments. An amount of paging space that will be occupied by the VM subsequent to reclaiming the portion of the memory is predicted. Based on the predicted amount of paging space exceeding a threshold, the requestor is notified that the portion of the memory cannot be reclaimed. Based on the predicted amount of paging space not exceeding the threshold, a reclamation of the portion of the memory is initiated. The reclamation includes vacating an increment of the plurality of increments and removing an assignment of the increment to the VM.

Growing community of inventors

Binghamton, NY, United States of America

Walter Church, Iv