# US 2012/0254109 A1 · Distributed component runtime

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

- Number: US 2012/0254109 A1
- Document ID: US20120254109A1
- Status: Published application
- Kind: A1
- Application number: 13/073,398
- Filed: 2011-03-28
- Published: 2012-10-04
- Earliest claimed: 2011-03-28
- Assignees: Microsoft Corporation
- Inventors: Dharma Shukla; Akash Jeevan Sagar; Nathan C. Talbert; Muthukaruppan Annamalai; Robert B. Schmidt; Aditya Bhandarkar; Asad Jawahar
- Web page: https://patentgrep.com/patent/US20120254109A1

## CPC

- G06F 9/465: {Distributed object oriented systems (remote method invocation [RMI] G06F9/548)}
- G06F 2209/463: Naming
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method of creating a distributed application in a distributed component runtime is disclosed. An application schema including distributed modules is declaratively defined. Each module hosts a component having a corresponding logical address. Mapping the corresponding logical addresses to physical addresses at runtime virtualizes interactions between the components.

## Claims

### Claim 1

A method of creating a distributed application in a distributed component runtime, comprising:
declaratively defining an application schema including a plurality of distributed modules wherein each module hosts a component having a corresponding logical address; and
virtualizing interactions between the components by mapping the corresponding logical addresses to physical addresses at runtime.

### Claim 2 (depends on 1)

The method of claim 1 wherein each module includes a logical grouping of a plurality of components.

### Claim 3 (depends on 1)

The method of claim 1 wherein the components include component exports and component inputs, and wherein the components are stitched together by the component imports and exports.

### Claim 4 (depends on 3)

The method of claim 3 wherein the components that are stitched together are agnostic of locality of the components.

### Claim 5 (depends on 3)

The method of claim 3 wherein each component export is identified by a contract and a logical address.

### Claim 6 (depends on 3)

The method of claim 3 wherein the component import of one of the components and the component export of a another component are stitched together if the component import and the component export satisfy a matching criteria.

### Claim 7 (depends on 6)

The method of claim 6 wherein matching criteria are expressed as a declarative predicate on the component import.

### Claim 8 (depends on 3)

The method of claim 3 wherein the components are statically stitched together.

### Claim 9 (depends on 8)

The method of claim 8 wherein relationships between components are determined at design time.

### Claim 10 (depends on 3)

The method of claim 3 wherein the components are dynamically stitched together.

### Claim 11 (depends on 19)

The method of claim 19 wherein relationships between components are determined at runtime.

### Claim 12 (depends on 1)

The method of claim 1 wherein the components include stateless components that are cloned at runtime.

### Claim 13 (depends on 1)

The method of claim 1 wherein the components include stateful components that support partitioning.

### Claim 14 (depends on 13)

The method of claim 13 wherein the stateful components include a partitioning scheme.

### Claim 15 (depends on 14)

The method of claim 14 wherein two stateful components that abide by the same partitioning scheme are co-located in one of the plurality of modules.

### Claim 16 (depends on 1)

The method of claim 1 and further comprising managing and procuring proxies at runtime.

### Claim 17

A computer readable storage medium storing computer executable instructions for controlling a computing device to perform a method comprising:
creating a distributed application in a distributed component runtime, the creating comprising:
declaratively defining an application schema including a plurality of distributed modules wherein each module hosts a component having a corresponding logical address, and each module is distributed on a corresponding separate physical tier; and
virtualizing interactions between the components by mapping the corresponding logical addresses to physical addresses at runtime wherein the interactions between the components are agnostic to the corresponding physical tier;
wherein the interactions between the components are dynamically composed at runtime.

### Claim 18 (depends on 17)

The computer readable storage medium of claim 17 wherein each module includes a plurality of components, wherein communications between components within a module is via direct method invocations and communications between components in separate modules is via sending messages.

### Claim 19 (depends on 17)

The computer readable storage medium of claim 17 and further including monitoring and repairing components interactions, and metering component use.

### Claim 20

A method of creating a distributed application in a distributed component runtime, comprising:
declaratively defining an application schema including a plurality of distributed modules wherein each module hosts a component having a corresponding logical address, and each module is distributed on a corresponding separate physical tier in a distributed environment;
virtualizing interactions between the components by mapping the corresponding logical addresses to physical addresses at runtime wherein the interactions between the components are agnostic to the corresponding physical tier;
wherein the virtualizing interactions between components includes an ability to both statically compose components at design time and dynamically compose components at runtime; and
managing and procuring proxies in the distributed environment at runtime.
