US 8,799,397 B2 · Shared transport

Abstract

A method and apparatus for processing message is described. In one embodiment, messages are received over a plurality of channels from a plurality of applications in a virtual machine. An identifier is coupled to each message. The identifier refers to the application originating the corresponding message. A shared transport is formed and associated with the channels. The messages are processed with the shared transport with the identifier.

Drawings

Drawings are temporarily unavailable. Open the PDF at USPTO

Drawings

Claims15

Dependent claims

A method comprising:

creating, by a processing device executing a virtual machine (VM), a first channel for a first application executed by the virtual machine, wherein the first channel is identified by a name of a group to which the first application is a member, the first channel providing communications for the first application to all members of the group;
creating, by the processing device, a second channel for a second application executed by the virtual machine, wherein the second channel is identified by a name of another group to which the second application is a member, the second channel providing communications for the second application to all members of the another group;
when a protocol of a transport layer of a protocol stack of each of the first channel and the second channel is the same, sharing, by the processing device, resources to implement a shared transport layer between the first channel and the second channel, wherein the shared resources comprise a default thread pool, an out of bound thread pool, and a timer thread pool, and wherein other protocol layers of the first and second channels operate independently of each other except for the shared transport layer;
receiving, by the processing device, a message from a member application through a network interface device connected to a network;
and
multiplexing, by the processing device, the received message over the shared transport layer to the first application or the second application via the first or second channel in view of a group name identifier located in the received message corresponding to the name of one of the groups to which the first or the second application belongs.

3 more elements

A non-transitory computer-readable medium comprising instructions to cause a processing device to perform operations comprising:

creating, by the processing device executing a virtual machine (VM), a first channel for a first application executed by the virtual machine, wherein the first channel is identified by a name of a group to which the first application is a member, the first channel providing communications for the first application to all members of the group;
creating, by the processing device, a second channel for a second application executed by the virtual machine, wherein the second channel is identified by a name of another group to which the second application is a member, the second channel providing communications for the second application to all members of the another group;
when a protocol of a transport layer of a protocol stack of each of the first channel and the second channel is the same, sharing, by the processing device, resources to implement a shared transport layer between the first channel and the second channel, wherein the shared resources comprise a default thread pool, an out of bound thread pool, and a timer thread pool, and wherein other protocol layers of the first and second channels operate independently of each other except for the shared transport layer;
receiving, by the processing device, a message from a member application through a network interface device connected to a network;
and
multiplexing, by the processing device, the received message over the shared transport layer to the first application or the second application via the first or second channel in view of a group name identifier located in the received message corresponding to the name of one of the groups to which the first or the second application belongs.

3 more elements

An apparatus comprising:

a processing device executing a virtual machine (VM);
a memory storing executable software, when executed by the processing device, is to send and receive messages;
a network interface device connected to a network,
wherein the processing device is to:
create a first channel for a first application executed by the virtual machine, wherein the first channel is identified by a name of a group to which the first application is a member, the first channel providing communications for the first application to all members of the group;
create a second channel for a second application executed by the virtual machine, wherein the second channel is identified by a name of another group to which the second application is a member, the second channel providing communications for the second application to all members of the another group;
when a protocol of a transport layer of a protocol stack of each of the first channel and the second channel is the same, share resources to implement a shared transport layer between the first channel and the second channel, wherein the shared resources comprise a default thread pool, an out of bound thread pool, and a timer thread pool, and wherein other protocol layers of the first and second channels operate independently of each other except for the shared transport layer;
receive a message from a member application through the network interface device connected to the network;
and
multiplexing, by the processing device, the received message over the shared transport layer to the first application or the second application via the first or second channel in view of a group name identifier located in the received message corresponding to the name of one of the groups to which the first or the second application belongs.

7 more elements

Dependencies are inferred from the claim text.

Description4,138 words

Summary150 words

#Embodiments of the present invention relate to group communication, and more specifically to parallel processing of messages.

#Group communication protocol designed for multicast communication may be used to communicate messages between endpoints forming a group. Communication endpoints can be processes or objects, or any entity that can send and receive messages to/from a group.

#Messages from different senders are conventionally processed in a First In First Out (FIFO) order in a single queue for incoming messages by one thread. The messages are processed sequentially in the order they are received. A bottleneck may thus be formed since every message has to wait for its turn to be processed accordingly.

Brief description of the drawings5 figures

#The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:

#FIG. 1 illustrates a network architecture of a group communication in which embodiments of the present invention may be implemented.

#FIG. 2 illustrates a block diagram of one embodiment of a structure of a message.

Detailed description3,884 words

#Described herein is a method and apparatus for processing messages. In one embodiment, messages are received over a plurality of channels from a plurality of applications in a virtual machine. An identifier is coupled to each message. The identifier refers to the application originating the corresponding message. A shared transport is formed and associated with the channels. The messages are processed with the shared transport with the identifier.

#In the following description, numerous details are set forth. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring the present invention.

#Some portions of the detailed descriptions which follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.

Facts

Application

12/154,618Filed 22 May 2008

Published

US 2009/0290586 A126 Nov 2009

Granted

5 Aug 2014

Term ends

17 Mar 2031

Estimated · how

20 years from earliest known nonprovisional domestic filing plus recorded patent term adjustment, including 1,029 days of adjustment. Maintenance-fee lapses, terminal disclaimers and statutory extensions have not been checked. The continuity chain may be incomplete; this is not an enforceability determination.

Classification6 codes

G06F 9/546
Interprogram communication: message passing systems or structures, e.g. queues
H04L 69/14
Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass:…
Y02D 30/50
Reducing energy consumption in communication networks: in wire-line communication networks, e.g. low power modes or reduced link rate
G06F
Computing and data processing

Timeline

22 May 2008Application filedUS 12/154,618
5 Jun 2008Assigned to Red Hat, Inc.assignment of assignor's interest
26 Nov 2009PublishedUS 2009/0290586 A1
5 Aug 2014GrantedUS 8,799,397 B2
12 Oct 2026TodayWithin its term
17 Mar 2031Term endsEstimated, includes 1,029 days of adjustment

Shared transport

Life of this patent

Shared transport

Life of this patent

Life of this patent

Abstract

Drawings

Drawings

Claims15

Description4,138 words

Drawings

Classification6 codes

Life of this patent

Description4,138 words