Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"tree traversals"”.

  1. Faster XML query processing using path index

    … evaluate queries. For XML documents modelled by tree structures, the retrieval of data requires substantial tree traversals. Thus, the fundamental differences between query processors are the organisation of the structural summary leading to the extent of the search space reduction, and the …

    uvic Repository record for Faster XML query processing using path index (opens in a new tab)

  2. Accelerating Tree-Based Irregular Applications by Exploiting SIMD Parallelism

    Tree structures are one of the most pervasive data structures. Many tree-based applications feature abundant amount of data level parallelism (DLP), and modern SIMD architectures, such as GPUs and the SIMD instruction extension to CPUs, appear well-suited. However, due to the high irregularity in …

    unsw Repository record for Accelerating Tree-Based Irregular Applications by Exploiting SIMD Parallelism (opens in a new tab)

  3. Automatically Optimizing Tree Traversal Algorithms

    … and traverse complex data structures like trees and graphs. As irregular applications operate on ever larger datasets, their performance suffers from poor locality and parallelism. Programmers are burdened with the arduous task of manually tuning such applications for better performance. …

    purdue-thes Repository record for Automatically Optimizing Tree Traversal Algorithms (opens in a new tab)

  4. Algorithmic skeletons for exact combinatorial search at scale

    … challenging due to both highly irregular search trees and sensitivity to search order, leading to anomalies that can cause unexpected speedups and slowdowns. As core counts continue to grow, parallel search becomes increasingly useful for improving the performance of existing searches, and …

    glasgow Download PDF for Algorithmic skeletons for exact combinatorial search at scale (opens in a new tab)

  5. Interconnect-centric design issues in nanometer IC technology

    … our methods, the large number of timeconsuming tree traversals becomes unnecessary for high order moment computations. Instead, moment values can be obtained from simple algebraic computations. Although gate delay no longer dominate stage delay in the nanometer technology ICs, the gate modeling …

    texas Repository record for Interconnect-centric design issues in nanometer IC technology (opens in a new tab) Restricted access

  6. ThinkInk - Developing and Evaluating a Digital-Ink Based Interactive Data Structures Tutoring tool

    … - Prototype 2 was developed which had tasks for tree traversals and Binary Search Trees (BST).This prototype included changes based on the feedback from the analyses of Prototype 1. A between groups A/B experiment was conducted to compare a keyboard & mouse data structure tutoring tool JSAV with …

    auckland-ms Repository record for ThinkInk - Developing and Evaluating a Digital-Ink Based Interactive Data Structures Tutoring tool (opens in a new tab)

  7. GPU-enhanced power flow analysis

    … load-balancing, for implementing the so-called treefix operations; (ii) a study of the impact of the representation format over performance and accuracy, for fuzzy interval algebraic operations; and (iii) the utilization of architecture-specific design, as a novel strategy to improve performance …

    liege Repository record for GPU-enhanced power flow analysis (opens in a new tab)