Article

Parallelization of Dynamic Segment Trees

January 2001

Authors:

Sridhar Radhakrishnan

University of Oklahoma

Gopal Racherla

Qualcomm

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Full-text available

Performance Analysis of a System that Identifies the Parallel Modules through Program Dependence Gra...

September 2017 · International Journal of Intelligent Systems and Applications

We have proposed a new approach to identify segments, which can be executed simultaneously, or coextending to achieve high computational speed with optimized utilization of available resources. Our suggested approach is divided into four modules. In first module we have represented a program segment using Abstract Syntax Tree (AST) along with an algorithm for constructing AST and in second ... [Show full abstract] module, this AST has been converted into Program Dependence Graph (PDG), the detailed approach has been described in section II, The process of construction of PDG is divided into two steps: First we construct a Control Dependence Graph (CDG, In second step reachability definition algorithm has been used to identify data dependencies between the various modules of a program by constructing Data Dependence Graph (DDG). In third module an algorithm is suggested to identify parallel modules, i.e., the modules that can be executed simultaneously in the section III and in fourth module performance analysis is discussed through our approach along with the computation of time complexity and its comparison with sequential approach is demonstrated in a pictorial form.

View full-text

Chapter

The Mathematical Content of the Rough Draft on Conics

January 1987

Desargues began with the remark that lines will be supposed to contain a point at infinity, which may be reached by travelling in either direction along the line. This enabled him to treat pencils of parallel and intersecting lines on a par; a pencil of parallel lines being regarded as a pencil of lines intersecting at a point at infinity. The use of points at infinity also simplified his ... [Show full abstract] treatment of points in involution, as we shall see. He then unleased a plethora of botanical names for simple configurations of points and lines which, taken together, only serve to obscure the text. Of those terms, we need only say that those which connote line segments, such as trunk, branch, shoot and limb, may be taken to mean ‘line’ or ‘line segment’, whereas those which suggest points, such as knot, butt, post and stump, mean ‘point’. Then he reached his first useful term, the tree.

Conference Paper

Coarse grained parallel next element search

May 1997

The authors present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the coarse grained multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h=O(n/p)), O((n/p) log n) local computation, and O((n/p) log n) storage per processor. The result implies solutions to the point location, ... [Show full abstract] trapezoidal decomposition and polygon triangulation problems. A simplified version for axis parallel segments requires only O(n/p) storage per processor, and they discuss an implementation of this version. As in a previous paper by Develliers and Fabri (1993), their algorithm is based on a distributed implementation of segment trees which are of size O(n log n). The paper improves on the work of Develliers and Fabri which presented a CGM algorithm for the special case of trapezoidal decomposition only and requires O((n/p)*log p*log n) local computation

Chapter

Some lines of poetry viewed as music

January 1991

We propose to take literally the notion that poetry aspires to the state of music. Our point of departure is the “deep parallel” between music and language discussed in section 12.3 of Lerdahl & Jackendoff’s A Generative Theory of Tonal Music (henceforth GTTM), where a mapping is shown between prosodic trees, which represent syllabic stress hierarchies (Liberman & Prince, 1977), and GTTM’s ... [Show full abstract] dine-span trees, which represent pitch-event hierarchies. Figure la illustrates the mapping, figure lb its application to the word “reconciliation”. In addition, the forms of the two theories are similar: each requires prior segmentation of a sequence into hierarchical units, well-fonnedness conditions on trees, and principles of prominence for assigning tree structures for any given sequence.