International Business Machines Corporation

Joshua S Auerbach

David Francis Bacon

Perry S Cheng

Rodric Rabbah

Marc Adam Kaplan

Stephen Fink

Vasanth Bala

Todd W Mummert

Bowen L Alpern

Thomas V Frauenhofer

Jobi George

Michael A Pigott

Marcia Lambert Peters

Robert Evan Strom

Michael James Ward

John E Drake, Jr

David Paul Grove

Sumeer K Bhola

Mark C Astley

Elizabeth A Hervatic

Yuanyuan Zhao

Chee-Seng Chow

Prabandham M Gopal

Soumitra Sarkar

Kathryn Heninger Britton

Diane Phylis Pozefsky

James P Gray

Harold D Dykeman

Simon Antony Holdsworth

Shay Kutten

Willibald A Doeringer

John H Wilson

Allan K Edwards

Raymond F Bird

Neil George Young

Roger D Turner

Johny Mathew

Perry Sze-Din Cheng

Jeffrey Charles Crigler

Yue T Yeung

Winston W Chung

Tein-Yaw D Chung

Winston W-K Chung

Compile-time recognition of graph structure where graph has arbitrary connectivity and is constructed using recursive computations is provided. In one aspect, the graph structure recognized at compile time may be duplicated at runtime and can then operate on runtime values not known at compile time.

Extracting stream graph structure in a computer language by pre-executing a deterministic subset

Extraction of functional semantics and isolated dataflow from imperative object oriented languages, in one aspect, may include identifying one or more methods and/or classes associated with one or more of a plurality of property labels in a computer code written in object oriented language to extract functional and isolation characteristics in the computer code. The plurality of property labels supported by one or more checking rules, are used to verify that the one or more methods and/or classes identified with the plurality of property labels have isolation characteristics. An object oriented language compiler is provided for supplying the plurality of property labels and checking rules. The object oriented language compiler further may include capability to transform methods into compute tasks and connect the compute tasks so as to create a dataflow graph.

Extraction of functional semantics and isolated dataflow from imperative object oriented languages

A technique for compiling and running high-level program on heterogeneous computers may include partitioning a program code into two or more logical units, and compiling each of the logical units into one or more executable entities. At least some of the logical units are compiled into two or more executable entities, the two or more executable entities being different compilations of the same logical unit. The two or more executable entities are compatible to run on respective two or more platforms that have different architecture.

Technique for compiling and running high-level programs on heterogeneous computers

An information processing system includes a preparation machine with an installed image; an execution machine on which the installed image is virtually installed; and a virtualizer for virtualizing the installed image on the execution machine to produce a virtually installed image by using a hierarchy of selective virtualizers, wherein the virtualizing is selective such that not all operations of the executing software of the installed image at any particular level are virtualized.

Simplifying the deployment and serviceability of commercial software environments

Techniques are disclosed for schedule management. By way of example, a method for managing performance of tasks of a thread associated with a processor comprises the following steps. A request to execute a task of a first task type within the thread is received. A determination is made whether the processor is currently executing a critical section of a task of a second task type within the thread. When it is determined that the processor is not executing a critical section of the second task type within the thread, the task of the first task type is executed within the thread. When it is determined that the processor is executing a critical section of the first task type within the thread, a determination is made whether the request for execution of the task of the first task type within the thread is deferrable based on a prior execution of one or more units of the first task type. The first task type may be an overhead task type such as a garbage collection task type, and the second task type may be an application task type.

Lock deferral for real-time garbage collection

Techniques are disclosed for schedule management. By way of example, a method for managing performance of tasks in threads associated with at least one processor comprises the following steps. One or more units of a first task type are executed. A count of the one or more units of the first task type executed is maintained. The count represents one or more credits accumulated by the processor for executing the one or more units of a first task type. One or more units of a second task type are executed. During execution of the one or more units of a second task type, a request to execute at least one further unit of the first task type is received. The amount of credits in the count is checked. When it is determined that there is sufficient credit in the count, the request to execute the at least one further unit of the first task type is forgone, and execution of the one or more units of the second task type continues. When it is determined that there is insufficient credit in the count, the at least one further unit of the first task type is executed. The first task type may be an overhead task type such as a garbage collection task type, and the second task type may be an application task type.

Scheduling for real-time garbage collection

The invention relates to a communications manager, method and computer program for receiving publications and forwarding these on to parties who have subscribed to receive such publications. A subscription request of a first type is received and includes a filter expression having at least one attribute. It is possible to map at least part of such an attribute(s) to a generic format (generic format filter attribute(s)). It is also possible to receive a publication message of a second type and to compare the publication received with the subscription request to determine whether the publication is appropriate for forwarding onto the subscriber originating the request. To enable such a comparison, a generic format filter attribute(s) is identified and is mapped to a format corresponding to the second message type. Once a match is found, the publication can then be transmitted to the originating subscriber.

Message filtering

A method for executing on a first computer an application having an installed image prepared on a second computer, wherein the installed image is virtually installed on the first computer, is disclosed. The method includes emulating on the first computer a native environment of the second computer. The method further includes detecting an operation of the application upon data, wherein the operation requires an operation on data located on the first computer, and wherein a copy of the data is located in the virtually installed image. The method further includes directing the operation of the application to operate on the data located in the virtually installed image.

Method and apparatus for simplifying the deployment and serviceability of commercial software environments

A content-based publish/subscribe system for providing gapless message delivery from a publishing client to a subscribing client is disclosed. The system includes a plurality of brokers operatively coupled to one another via a network. Each of the brokers include at least one processor and are configured as a publisher-hosting broker, a subscriber-hosting broker or an intermediate broker. The subscriber-hosting broker may be operatively coupled to the publisher-hosting broker via the network through the intermediate broker. At least a portion of the plurality of brokers are configured so as to eliminate a need for persistent storage of messages at the intermediate broker and to substantially guarantee a gapless delivery of one or more messages transmitted by the publishing client to the subscribing client, even in the presence of a failure in the publish/subscribe system.

Gapless delivery and durable subscriptions in a content-based publish/subscribe system

The invention improves processing time when accessing information in a byte stream and avoids the step of deserializing unneeded portions of the byte stream when the byte stream encodes an information structure corresponding to a schema with arbitrarily nested lists and tuples. It facilitates efficient keyed access when lists of tuples represent tables with key columns by storing tables in nested column order, which extends the well-known concept of column-order so as to apply to arbitrarily nested tables. Using well-known offset calculation techniques within the nested lists that result from nested column order, the invention achieves greater efficiency by grouping together all scalar information items that correspond to the same node in a tree representation of the schema.

Byte stream organization with improved random and keyed access to information structures

Growing community of inventors

Ridgefield, CT, United States of America

Joshua S Auerbach