Abstract: A computer-programming tool for generating an implementation of a first data structure, the first data structure representing at least a portion of a computer-programming language. The implementation includes a second data structure and implementation rules which define the syntax rules of the first data structure to be enforced in relation to nodes of the second data structure during a subsequent processing operation which utilizes the implementation in order to establish compliance with the syntax rules represented by the first data structure. Links between nodes of the first data structure are representative of paths of inheritance of substitutability but not implementation and interface between those nodes.

Abstract: A database query is received including a logical table identifier at a distributed database node within a distributed network of databases. The logical table identifier includes a dynamically-updatable constant column identifier. Local logical table definitions are filtered based upon the logical table identifier and the dynamically-updatable constant column identifier to identify a local logical table associated with the logical table identifier and the dynamically-updatable constant column identifier. A local query response is formed including data retrieved from a local physical database table mapped by the local logical table in response to identifying the local logical table associated with the logical table identifier and the dynamically-updatable constant column identifier. The database query is responded to, in response to forming the local query response, with at least the local query response.

Abstract: Techniques are disclosed for automating the generation of parallel SIMD native source code in three major functional areas of data transmission, synchronization, and SIMD operations. An annotation standard is defined that is independent from native compilers and, coupled with a source-to-source compiler that provides high-level abstractions of data transmission, synchronization, and SIMD operations, relieves the need for programmers to work in a hardware-specific manner, while addressing issues of productivity and portability in a parallel SIMD computing environment.

Abstract: A stripped-down version of a library is generated from server source code extracted from a server project. The transitive closure of program entities extracted from the server source code and referenced by the extracted program entities can be computed. A placeholder entity can be inferred for an entity defined by the transitive closure computation if a definition of the entity cannot be found in the server source code. The stripped-down library generated from the extracted server source code is received by a reflection-based component that uses reflection to generate documentation and disclosure information helpful in the development of the client source code. A placeholder entity can be marked or decorated to signal to the reflection-based component that client source code is not to be generated for the decorated entities.

Abstract: A system and method for scheduling software updates on data processing systems. In an embodiment, software updates are scheduled on a data processing system by identifying a list of software updates; scheduling at least one primary software update for execution within a scheduled outage time based on an estimated execution time and an estimated rollback time for the at least one primary software update; executing the at least one primary software update during the scheduled outage time; and ordering the list of software updates for possible execution of at least one secondary software update in any remaining outage time in dependence upon the estimated execution times and estimated rollback times for each of the remaining software updates. The list of software updates may also be ordered in further dependence upon evaluation of relative priorities between the software updates, any prerequisite software updates, and a performance scaling factor for the data processing system.

Abstract: A method for deploying a software product comprising a plurality of components is provided. The method can include reading a topological description of the software product and its components, wherein the topological description defines characteristics and dependencies of the components. The method can further include reading characteristics of a plurality of publishers and matching each of the plurality of components to one of the plurality of publishers according to the characteristics and dependencies of the components and the characteristics of the plurality of publishers. A publisher may be a computer connected to a network. The method can further include distributing the plurality of components among the plurality of publishers responsive to the step of matching and validating each set of components distributed to each publisher.