Patent application number | Description | Published |
20090063614 | Efficiently Distributing Class Files Over A Network Without Global File System Support - A system and method for distributing class files in a network to multiple recipients without global file system support are provided. A root node includes a virtual machine, is configured to receive network topology information for all nodes in the network, and obtains class files. First level nodes include virtual machines, are coupled to the root node, and are one distribution level below the root node. Second level nodes include virtual machines, are coupled to the first level nodes, and are one distribution level below the first nodes. Nth level nodes include virtual machines, are coupled to the second level nodes. N is representative of a continuous succession of distribution levels for nodes through a last node in network. The root node distributes the class files to first level nodes, which distribute the class files to the second level nodes, which distribute the class files to the nth level nodes. | 03-05-2009 |
20090249316 | COMBINING STATIC AND DYNAMIC COMPILATION TO REMOVE DELINQUENT LOADS - A method for combined static and dynamic compilation of program code to remove delinquent loads can include statically compiling source code into executable code with instrumented sections each being suspected of including a delinquent load, and also into a separate intermediate language representation with annotated portions each corresponding to one of the instrumented sections. The method also can include executing the instrumented sections repeatedly and monitoring cache misses for each execution. Finally, the method can include dynamically recompiling selected ones of the instrumented sections using corresponding ones of the annotated portions of the separate intermediate language representation only after a threshold number of executions of the selected ones of the instrumented sections, each recompilation include a pre-fetch directive at a pre-fetch distances tuned to avoid the delinquent load. | 10-01-2009 |
20110055808 | GENERATING OBJECT CODE THAT USES CALCULATED CONTENTS FOR A VARIABLE DETERMINED FROM A PREDICATE - In an embodiment, a predicate condition that compares a predicate variable to a compared value is determined. The predicate condition is in a predicate block that exists on a path to a current block that accesses a current variable. A decision is made whether the current variable and the predicate variable are defined by a sub-clique and whether a member of the sub-clique sets the predicate variable to a predicate value that causes control flow to take the path from the predicate block to the current block. Upon a determination that the current variable and the predicate variable are defined by the sub-clique and the member of the sub-clique sets the predicate variable to the predicate value that causes control flow to take the path from the predicate block to the current block, then contents for the current variable are calculated and first object code is generated, which loads the contents. | 03-03-2011 |
20110191761 | Control Flow Analysis Using Deductive Reaching Definitions - A computer-implemented process for deductive reaching definition analysis receives a control flow graph to form a set of received blocks and edges, performs traditional reaching definitions to produce bit-vectors OUT(b), GEN(b) and KILL(b) for each block in the set of received blocks and receives impossibility indicators for a set of definitions that are impossible on specific edges. The computer-implemented process further performs deduction operations using a combination of the bit-vectors and impossibility indicators to deduce that additional definitions cannot reach certain blocks to create resulting reachability information and provides the resulting reachability information as a result to a requestor. A related system and program product is also provided. | 08-04-2011 |
20120117553 | PROGRAMMATIC DISPATCH TO FUNCTIONS WITH MATCHING LINKAGE - An enhanced function-descriptor-based dispatch in a multi-linkage environment receives user code containing a function compiled in a supplementary linkage convention of a caller to form an invoked function and determines whether the supplementary linkage convention of the caller for the invoked function matches a supplementary linkage implementation provided by a library. Responsive to a determination that the supplementary linkage convention of the caller for the invoked function matches a supplementary linkage implementation provided by the library, an embodiment selects the supplementary linkage implementation provided by the library and dispatches the invoked function in the selected supplementary linkage implementation provided by the library. | 05-10-2012 |
20130311978 | CONDITIONAL SEQUENTIAL SELECTION OF EXTERNAL REFERENCE RESOLUTIONS - External references are resolved in a software compiling and linking environment by identifying a group of related external references and by processing the group of external references until a stopping condition is satisfied. The external references are processed by selecting a next external reference from the group of external references as a current external reference and by resolving the current external reference with a matching definition if a matching definition for the current external reference exists. The stopping condition is designated as being satisfied if either the selected external reference is resolved, or if each external reference in the group of external references has been selected. | 11-21-2013 |
20130311979 | CONDITIONAL SEQUENTIAL SELECTION OF EXTERNAL REFERENCE SOLUTIONS - External references are resolved in a software compiling and linking environment by identifying a group of related external references and by processing the group of external references until a stopping condition is satisfied. The external references are processed by selecting a next external reference from the group of external references as a current external reference and by resolving the current external reference with a matching definition if a matching definition for the current external reference exists. The stopping condition is designated as being satisfied if either the selected external reference is resolved, or if each external reference in the group of external references has been selected. | 11-21-2013 |
20140075423 | EFFICIENTLY SOLVING THE "USE-DEF" PROBLEM INVOLVING LABEL VARIABLES - A method for efficiently solving the “use-def” problem involving label variables performs a data-flow analysis on a control flow graph that includes calculating an inset for each node as follows: if a predecessor node directly branches to the node, the method includes an outset of the predecessor node in the inset of the node; if a predecessor node indirectly branches to the node via a label variable and the node is in definitions of the label variable in the outset of the predecessor node, the method includes the outset of the predecessor node in the inset of the node; if a predecessor node indirectly branches to the node via a label variable and the node is not in definitions of the label variable in the outset of the predecessor node, the method does not include the outset of the predecessor node in the inset of the node. | 03-13-2014 |