Patent
Fast tree-based generation of a dependence graph
Reads0
Chats0
TLDR
In this article, a dependence graph is generated by constructing a tree of nodes, receiving requests to create cut and/or fan vertices corresponding to each node, adjusting a frontier of nodes up or down, and creating one or more cut or fan nodes, zero or more tie vertices, and at least one predecessor edge.Abstract:
A dependence graph having a linear number of edges and one or more tie vertices is generated by constructing a tree of nodes, receiving requests to create cut and/or fan vertices corresponding to each node, adjusting a frontier of nodes up or down, and creating one or more cut or fan vertices, zero or more tie vertices, and at least one predecessor edge.read more
Citations
More filters
Patent
Systems and Methods for Graph Rendering
TL;DR: In this article, the authors propose a method for generating edge draw commands, node draw commands and graph shading commands from graph data, which can be used to draw a first and a second edge as a display object.
Patent
Least movement WSAN topology repair method
TL;DR: The least movement WSAN topology repair method as discussed by the authors replaces a faulty node by selecting a neighbor node belonging to the smallest disjointed block, while imposing no constraints to sustain the path length between any pair of nodes at pre-failure.
Patent
Program analyzing method, program analyzing apparatus and program analyzing program
TL;DR: In this paper, a dependent element group which is invertibly contractible is found by using program analysis information including a plurality of dependent elements representing dependent relationships of statement and control, the statement and the control being included in a program.
Patent
Prefetching instruction blocks
TL;DR: In this article, the technology related to prefetching instruction blocks is disclosed and a processor comprises a block-based processor core for executing a program comprising a plurality of instruction blocks.
Patent
Systems and Methods for Graphical Layout
TL;DR: In this article, a method comprises selecting a first and a second predetermined number of points of graphical data; determining an initial distance between each of the first and second predetermined numbers of points, generating a fast approximate distance oracle comprising identifiers of points and oracle distances between at least one point and another point, determining a graphical distance for each of a second set of points relative to other points, calculating a potential error between the determined graphical distance and a topologic distance between them, approximating a correction for at least 1 of the points, and adjusting a position of the at least
References
More filters
Journal ArticleDOI
Compiler transformations for high-performance computing
TL;DR: This survey is a comprehensive overview of the important high-level program restructuring techniques for imperative languages, such as C and Fortran, and describes the purpose of each transformation, how to determine if it is legal, and an example of its application.
Patent
Parent-child query indexing for xml databases
TL;DR: In this article, a method for processing queries for a document of elements is provided, which includes a plurality of subsections where each subsection includes at least a portion of elements in the document.
Patent
Unified compiler framework for control and data speculation with recovery code
TL;DR: In this article, a method and system for scheduling computer instructions for execution as part of a compilation process in which an original computer program that defines a set of operations is compiled to produce an executable program.
Patent
Method and system for storage and retrieval of multimedia objects
TL;DR: In this paper, the authors propose a method for storing and organizing multimedia objects by decomposing a multi-level tree structure into a graph map using single-link graph nodes, assigning a name or address to each node in the tree structure in ascending order from a root node to the last leaf node.
Patent
Method for providing a pipeline interpreter for a variable length instruction set
John S. Yates,Stephen C. Root +1 more
TL;DR: In this article, a run-time system collects profile data in response to execution of the native instructions to determine execution characteristics of the non-native instruction and then feeds them to a binary translator operating in a background mode and which is responsive to the profile data generated by the runtime system to form a translated native image.