# US 2012/0254886 A1 · Reducing Overheads in Application Processing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0254886 A1
- Document ID: US20120254886A1
- Status: Published application
- Kind: A1
- Application number: 13/452,489
- Filed: 2012-04-20
- Published: 2012-10-04
- Earliest claimed: 2009-12-15
- Assignees: International Business Machines Corporation
- Inventors: Gaurav Mahrotra; Abhinay R. Nagpal
- Web page: https://patentgrep.com/patent/US20120254886A1

## CPC

- G06F 9/5061: {Partitioning or combining of resources}
- G06F 2209/505: Clust
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method, a system and a computer program of reducing overheads in multiple applications processing are disclosed. The method includes identifying resources interacting with each of the applications from a set of applications and grouping the applications from the set of applications, resulting in at least one application cluster, in response to the identified resources, wherein overheads associated with re-initialization of agents assigned to the identified resources are reduced. The method further includes assigning an agent corresponding to each of the identified resources and initializing the agent corresponding to each of the identified resources. The method further includes identifying parameters associated with the identified resources, pre-processing the identified parameters for each of the identified resources, and also includes selecting a clustering means for the clustering.

## Claims

### Claim 1

A method for reducing overheads in multiple applications processing, the method comprising:
identifying resources interacting with each of the applications from a set of applications; and
grouping the applications from the set of applications based on the identified resources, resulting in at least one application cluster, in response to the identified resources, wherein overheads associated with re-initialization of agents assigned to the identified resources are reduced.

### Claim 2 (depends on 1)

The method of claim 1, wherein the identified resource is at least one selected from a database object, a set of statements, a set of queries, database metadata and a database.

### Claim 3 (depends on 1)

The method of claim 1, further comprises:
assigning an agent to each of the identified resources; and
initializing the agent of the identified resources.

### Claim 4 (depends on 1)

The method of claim 1, wherein the grouping comprises:
identifying parameters associated with the identified resources; and
clustering the applications using the identified parameters.

### Claim 5 (depends on 4)

The method of claim 4, wherein the parameters are selected from a pre-defined set comprising a statement heap, an index heap, queries, and a query heap.

### Claim 6 (depends on 4)

The method of claim 4, wherein the clustering the applications further comprises:
pre-processing the identified parameters for each of the identified resources, wherein the pre-processing is selected from a pre-defined set comprising modifying the parameters, altering the parameters, logically modifying the parameters, and combining the parameters.

### Claim 7 (depends on 4)

The method of claim 4, wherein the clustering further comprises:
computing the application clusters using a clustering means and the identified parameters.

### Claim 8 (depends on 7)

The method of claim 7, wherein the clustering means is selected from a set consisting of: a supervised clustering means and an unsupervised clustering means.

### Claim 9 (depends on 8)

The method of claim 8, wherein the unsupervised clustering means comprises a k-means clustering.

### Claim 10 (depends on 7)

The method of claim 7, further comprises:
sharing the agents corresponding to each of the identified resources; and
interacting with the applications in the at least one application cluster.

### Claim 11

A system for reducing overheads in multiple applications processing, the system comprising at least one processor and at least one memory, wherein the processor is adapted to:
identify resources interacting with each of the applications from a set of applications; and
group the applications from the set of applications, resulting in at least one application cluster, in response to the identified resources, wherein overheads associated with re-initialization of agents assigned to the identified resources are reduced.

### Claim 12 (depends on 11)

The system of claim 11, the processor is further adapted to:
assign an agent corresponding to each of the identified resources, wherein the identified resource is at least one selected from a database object, a set of statements, a set of queries, database metadata and a database; and
initialize the agent corresponding to each of the identified resources.

### Claim 13 (depends on 12)

The system of claim 12, the processor is further adapted to:
identify parameters associated with the identified resources, wherein the parameters are selected from a pre-defined set comprising a statement heap, an index heap, queries, and a query heap; and
cluster the applications using the identified parameters.

### Claim 14 (depends on 13)

The system of claim 13, the processor is further adapted to:
pre-process the identified parameters for each of the identified resources, wherein the pre-processing is selected from a pre-defined set comprising modifying the parameters, altering the parameters, logically modifying the parameters, and combining the parameters.

### Claim 15 (depends on 13)

The system of claim 13, the processor is further adapted to:
select a clustering means for the clustering, wherein the clustering means is selected from a set comprising a supervised clustering means and an unsupervised clustering means, and wherein the unsupervised clustering means comprises a k-means clustering;
compute the application clusters using the selected clustering means and the identified parameters; and
share the agents corresponding to each of the identified resources interacting with the applications in the at least one application cluster.

### Claim 16

A storage medium tangibly embodying a program of machine-readable instructions executable by a digital processing apparatus to carry out a method of reducing overheads in multiple applications processing, the storage medium is configured to:
identify resources interacting with each of the applications from a set of applications; and
group the applications from the set of applications, resulting in at least one application cluster, in response to the identified resources, wherein overheads associated with re-initialization of agents assigned to the identified resources are reduced.

### Claim 17 (depends on 16)

The storage medium of claim 16, further configured to:
assign an agent corresponding to each of the identified resources, wherein the identified resource is at least one selected from a database object, a set of statements, a set of queries, database metadata and a database; and
initialize the agent corresponding to each of the identified resources.

### Claim 18 (depends on 17)

The storage medium of claim 17, further configured to:
identify parameters associated with the identified resources, wherein the parameters are selected from a pre-defined set comprising a statement heap, an index heap, queries, and a query heap; and
cluster the applications using the identified parameters.

### Claim 19 (depends on 18)

The storage medium of claim 18, further configured to:
pre-process the identified parameters for each of the identified resources, wherein the pre-processing is selected from a pre-defined set comprising modifying the parameters, altering the parameters, logically modifying the parameters, and combining the parameters.

### Claim 20 (depends on 19)

The storage medium of claim 19, further configured to:
select a clustering means for the clustering, wherein the clustering means is selected from a set consisting of, a supervised clustering means and an unsupervised clustering means, and wherein the unsupervised clustering means comprises a k-means clustering;
compute the application clusters using the selected clustering means and the identified parameters; and
share the agents corresponding to each of the identified resources interacting with the applications in the at least one application cluster.
