IBM Patent Application on Virtual Instance Placement

ChangeBridge: Patent Apps - Business Methods (G06Q)

Detected March 26th, 2026

Summary

The USPTO published IBM's patent application US20260086838A1 concerning an efficient method for placing virtualized instances with intergroup affinity and anti-affinity. The application details a data processing environment designed to optimize resource allocation based on consumer group relationships.

View original document View source feed page

What changed

This document is a publication of a patent application by IBM (US20260086838A1) filed on September 25, 2024. The application describes a system and method for efficiently placing virtualized instances within a data processing environment. Key features include a solver component configured with an intergroup affinity pricing function that influences the placement of consumer pods on provider nodes, aiming to co-locate related consumer groups.

While this is a patent application and not a regulation, it outlines potential technological advancements relevant to cloud infrastructure management. Companies involved in cloud computing, virtualization, and resource orchestration may find the described affinity and anti-affinity placement strategies of interest for optimizing performance and resource utilization. No immediate compliance actions are required as this is a patent application, not a rule or guidance.

Source document (simplified)

← USPTO Patent Applications

EFFICIENT PLACEMENT OF VIRTUALIZED INSTANCES WITH INTERGROUP AFFINITY AND ANTI-AFFINITY

Application US20260086838A1 Kind: A1 Mar 26, 2026

Assignee

International Business Machines Corporation

Inventors

Vaptistis Anogeianakis, Irfan Ur Rehman

Abstract

A data processing environment has a set of consumer pods and a set of provider nodes, and the set of consumers includes a first subset of a first group of consumers and a second subset of a second group of consumers. A pricing function in a solver component in the environment is configured with an intergroup affinity between the first subset and the second subset of consumers such that a member of the first subset of consumers gets placed on a selected provider from the set of providers when the selected provider already hosts a member of the second subset of consumers. The solver uses the intergroup affinity to cause a first placement of a first consumer from the first subset at a first provider from the set of providers, when the first provider already hosts a first consumer from the second subset of consumers.