International Business Machines Corporation

Uri Shani

Aviad Sela

Sergey Krutyolkin

David Harold Berk

Alexey Roytman

Ariel Landau

Dagan Gilat

Joel Arditi

Gal A Shachor

Lev Kozakov

Pnina A Vortman

Samuel Kallner

John Michael Marberg

Nir Mashkif

Israel Gold

Alex Melament

Inna Skarbovsky

Alex Akilov

Yaakov Dolgov

Irit Boldo

Neta Jacob Amit

A computerized method for cross-domain collaborative revision management of a common product. The method comprises: Monitoring a plurality of local revisions for each of a plurality of projects associated with the common product, each of the plurality of projects managed in one of a plurality of domain-specific configuration management tools; creating a collaborative baseline within a collaborative relationship hub synchronizing between a group of the plurality of local revisions selected from each of the plurality of projects; and assembling instructions of generating the common product according to the collaborative baseline.

Cross-domain collaborative configuration management

A data processing method is provided. The method comprises collecting a stream of data records received from one or more data sources connected in a communications network; dividing the stream of data records into sets of data records for parallel processing by a plurality of concurrently running tasks, wherein a first task loads a persistent index associated with a first set of data records into memory to generate an in-memory version of the first persistent index for the first set of data records; and identifying duplicate and non-duplicate data records in the first set of data records, based on searching the in-memory version of the first persistent index.

Duplicate filtering in a data processing environment

A method of scheduling highly parallel jobs with global interdependencies is provided herein. The method includes the following steps: grouping input elements, each group being associated with an interdependency tag reflecting a level of interdependency between data associated with different input elements within a group; clustering the groups into collections of groups, wherein the clustered groups are associated with an interdependency tag reflecting a level of interdependency between groups, above a specified value; applying a conflict check to the collections of groups and to active jobs of a working set, to yield a conflict level between each collection of groups and each active job, by analyzing the interdependency tags of the collections of groups vis &#xe0; vis interdependency tags associated with the active jobs; and adding collections of groups into the working set, wherein added collections of groups are associated with a conflict level below an acceptable conflict level.

Scheduling highly parallel jobs having global interdependencies

A data processing method is provided. The method comprises collecting a stream of data records from one or more devices in a network; loading one or more persistent indexes associated with the stream of data records into memory; identifying duplicate data records in the stream of data records using the in-memory indexes; and updating a repository such that the duplicate data records are not stored in the repository or managed differently than non-duplicate data records.

A relational database architecture with Dynamic Load capability, including a relational database for storing records, a storage unit, a record dispatcher for storing a plurality of objects, each containing at least one record, in the storage unit, and a mapping of the objects to the records which they contain, where the record dispatcher is configured to receive a Dynamic Load Request including a key value of desired records, search the mapping to determine which of the objects in the storage unit contain records that match the key value, and load any of the matching records into the database.

Relational database architecture with dynamic load capability

A method for communication includes receiving a request from a first party, submitted via a first communication service provider to a telephony application, to place a call using the application to a second party. Responsive to a characteristic of the call placed by the first party, a second communication service provider is selected to carry the call between the application and the second party. The second party is then connected via the second communication service provider to communicate with the first party using the application.

Communication endpoint supporting multiple provider models

An inexpensive storage system is disclosed along with methods of managing such a system. In one preferred embodiment, the system includes a high performance high reliability storage medium configured for initial storage of data, a low performance high reliability storage medium configured for backup of data initially stored on the high performance high reliability storage medium, and a high performance low reliability storage medium, configured to receive data transferred from the high performance high reliability storage medium, after the data has been backed up on the low performance high reliability storage medium. This significantly reduces the cost of the system without substantially comprising performance. Reliability is likewise maintained owing to the high reliability backup.

Inexpensive reliable computer storage via hetero-geneous architecture and a staged storage policy

A programming aid for generating interface definition files for client server programs. The system and method are responsive to an input interface definition file and one or more input source code files to extract, from one such input source code file, the semantics of procedures therein intended to be called by a remote procedure call, to detect any conflicts between the extracted semantics and the input interface definition file, to generate an output interface definition file and to report said conflicts to a user. The user can thereby develop a correct interface definition file through an iterative process by modifying the output interface definition file and using it again as the input interface definition file.

Programming system for generating client and server programs from an

A multi-processor computer system executes a single-thread program having a plurality of callable procedures. The local memory of each processor contains a program stack, the object code of each procedure that executes on that processor, and an agent object. In addition, the local memory contains a c-stub module for each procedure executable on a different processor, and a s-stub module for each local procedure that can be called by a remote procedure. When a procedure P1 executing on processor A calls a procedure P2 which executes in processor B, it issues a local call to P2's c-stub in processor A's local memory. The P2 c-stub then invokes the agent process in processor A, which communicates with a corresponding agent process in processor B. The agent process in processor B causes P2's s-stub in processor B to issue a local call to procedure P2. The return from a procedure follows the same path in reverse. Each processor independently maintains its own version of the program stack, with stack entries referencing the locally executable procedures, local stubs, or local agents. As a result, remote procedure calls are not constrained by the past calling history of a process. A procedure P1 in processor A may call a procedure P2 in processor B, which may in turn call another procedure P3 in processor A. It is therefore possible to convert a conventional single-thread program for operation on a multi-processor system without any significant modification to the source code.

Growing community of inventors

Kiriat Motzkin, Israel

Uri Shani