International Business Machines Corporation

Moshe M E Matsa

Eric David Perkins

Joseph H Allen

Jeffrey M Peters

Christopher R Vincent

Naoto Sato

David Zachary Maze

Scott Boag

Kristoffer H Rose

Ryan Betts

Julius Q Quiaot

Lionel A S Villard

A Web service description can be extended to cross reference a front-side port associated with a client using a Web service and a back-side port associated with a server providing the Web service. The extending of the Web service description can occur in a standards compliant manner for a programming language within which the Web service description is specified and for a repository in which the Web service description is maintained.

Unifying related web service ports using port pointers in proxy mediation

Aspects of the present invention provide a solution for compiling data. In an embodiment, an input query is received in a first language. The input query is translated to a nested relational algebra (NRA) in the form of a first intermediate representation (IR), wherein the first IR comprises a high-level functional language including algebraic operators. A set of algorithms of the algebraic operators is implemented to compile at least some of the first IR into a second IR, wherein the second IR comprises a data-flow language. At least one of the first IR and the second IR is compiled into a low-level code.

Compiling nested relational algebras with multiple intermediate representations

Provided are techniques for a garbage-collected interned string table. Reference objects that each reference strings in the interned string table are created. The reference objects and the strings referenced by the reference objects in the interned string table are marked with a current generation. Garbage collection is performed by: advancing the current generation to a next generation; in response to the reference objects in a previous generation from the current generation advancing to an acquired references state, promoting the reference objects and the strings referenced by the reference objects in the previous generation to the current generation; and deleting the strings that are marked with the previous generation in the interned string table.

Garbage collection of interned strings

Object are created such that each of the objects stores a bit that designates eventual removal of one of the objects. Further, the objects are added to a data structure that includes a set that comprises a union of a plurality of subsets such that each subset in the plurality of subsets is stored separately according to a corresponding thread and such that an added object that is added to the set by a given thread is stored in the corresponding subset. In addition, one of the objects is logically removed, without physical removal, from the set by activating the bit. Each subset is periodically swept. All objects marked with the activated bit are physically removed.

Concurrent add-heavy set data gathering

A memory allocation message for each primary memory allocation in a primary memory made by a primary processor is received at a hardware memory management module. A representation of each primary memory allocation is allocated within a second memory in response to each memory allocation message. A determination is made, based upon the allocated representations of each primary memory allocation within the second memory, to free a primary memory allocation in the primary memory. A memory free message is sent to the primary processor instructing the primary processor to free the primary memory allocation in the primary memory.

Hardware off-load memory garbage collection acceleration

A memory allocation message for each primary memory allocation in a primary memory made by a primary processor is received at a hardware memory management module, including an indication of whether a finalizer routine is associated with each primary memory allocation. A representation of each primary memory allocation is allocated within a second memory in response to each memory allocation message, including the indication of whether there is the associated finalizer routine. A determination is made, based upon the allocated representations of each primary memory allocation within the second memory, to free a primary memory allocation in the primary memory. A call object finalizer message is sent to the primary processor instructing the primary processor to call the finalizer routine associated with the primary memory allocation in the primary memory in response to determining that the primary memory allocation has the associated finalizer routine.

Hardware off-load garbage collection acceleration for languages with finalizers

Configurable, pluggable delivery managers are responsible for routing instant messages to intended recipients. A delivery manager is selected for a particular message, and that delivery manager defines, at runtime, a delivery policy to be used to route the instant message to an intended recipient of the message. The delivery policy is based upon a configuration of the delivery manager, a user configuration of the intended recipient, and one or more available delivery mechanisms. The delivery manager routes the instant message using the delivery policy.

Growing community of inventors

Cambridge, MA, United States of America

Moshe M E Matsa