Class / Patent application number | Description | Number of patent applications / Date published |
717119000 | Parallel | 7 |
20080276220 | Application interface on multiple processors - A method and an apparatus that execute a parallel computing program in a programming language for a parallel computing architecture are described. The parallel computing program is stored in memory in a system with parallel processors. The system includes a host processor, a graphics processing unit (GPU) coupled to the host processor and a memory coupled to at least one of the host processor and the GPU. The parallel computing program is stored in the memory to allocate threads between the host processor and the GPU. The programming language includes an API to allow an application to make calls using the API to allocate execution of the threads between the host processor and the GPU. The programming language includes host function data tokens for host functions performed in the host processor and kernel function data tokens for compute kernel functions performed in one or more compute processors, e.g. GPUs or CPUs, separate from the host processor. Standard data tokens in the programming language schedule a plurality of threads for execution on a plurality of processors, such as CPUs or GPUs in parallel. Extended data tokens in the programming language implement executables for the plurality of threads according to the schedules from the standard data tokens. | 11-06-2008 |
20090125883 | NODE SELECTION FOR EXECUTING A JAVA APPLICATION AMONG A PLURALITY OF NODES - Methods, apparatus, and products are disclosed for node selection for executing a Java application among a plurality of nodes connected together for data communications using a data communication network, the plurality of nodes also connected to a service node, that include: tracking, by the service node, loaded Java classes currently loaded on each of the plurality of nodes; receiving, in the service node, an instruction to execute a Java application using the plurality of nodes; identifying, by the service node, Java classes utilized in executing the Java application; selecting, by the service node, one of the plurality of nodes for executing the Java application in dependence upon the loaded Java classes and the Java classes utilized in executing the Java application; and configuring, by the service node, the Java application for execution on the selected node. | 05-14-2009 |
20100281464 | ASPECT-ORIENTED PARALLEL PROGRAMMING LANGUAGE EXTENSIONS - Techniques for using one or more aspect-oriented parallelism primitives to implement one or more aspects of a program in parallel are provided. The techniques include using one or more aspect-oriented parallelism primitives to implement one or more aspects of a program in parallel, wherein implementing the one or more aspects of a program in parallel comprises implementing the one or more aspects of a program in parallel on a multi-core processor. | 11-04-2010 |
20100306741 | Method for Optimizing Processing of Character String During Execution of a Program, Computer System and Computer Program for the Same - A method, computer system and computer program for optimizing the processing of a character string during execution of the program by using characteristic information that indicates a characteristic of the character string and is associated with the character string. The method includes the steps of determining, on the basis of a characteristic of a first character string and operation for the first character string, a characteristic information of at least one of the first character string and a second character string obtained as a result of the operation, and associating the characteristic information with the at least one character string. | 12-02-2010 |
20100318963 | Hypergraph Implementation - A hypergraph implementation system is described. The hypergraph implementation system provides for a hypergraph template library that contains many hypergraphs and many bulk data areas. The hypergraphs allow a developer to program an application such that the pointers to files are contained in the memory cache. The hypergraphs consist of hyperedges and vertices residing in tables of indices that point into each other in a flat organization. Bulk data is hung directly off hyperedges and vertices via a set of features. Thus, all the relationships among objects are contained within the hypergraphs and all the bulk data such as audio, large tables, geometry and images are directly tied to hyperedges or vertices with one link. | 12-16-2010 |
20120131552 | READ-ONLY COMMUNICATION OPERATOR - A high level programming language provides a read-only communication operator that prevents a computational space from being written. An indexable type with a rank and element type defines the computational space. For an input indexable type, the read-only communication operator produces an output indexable type with the same rank and element type as the input indexable type but ensures that the output indexable type may not be written. The read-only communication operator ensures that any attempt to write to the output indexable type will be detected as an error at compile time. | 05-24-2012 |
20150317140 | METHOD AND SYSTEM FOR PARALLELIZATION OF SEQUENTIAL COMPUTER PROGRAM CODES - Systems and methods for use in parallelization of computer program code are provided. One method includes determining line dependency data indicating a dependency of a plurality of lines of the sequential computer program code. The method further includes determining time data indicating a time required for the execution of a plurality of functions of the sequential computer program code and determining parallelizability of the sequential computer program code using the line dependency data and the time data. The method further includes generating parallel executable computer program code by inserting program instructions in the sequential computer program code based on the determined parallelizability. The step of generating the parallel executable computer program code includes identifying and routing at least a portion of one or more of the plurality of functions to different processors to achieve parallelization of sequential computer program code using the line data and time dependency data. | 11-05-2015 |