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 9 of 9 for “"Graph traversal"”.

  1. Characterization of Sparsity-aware Optimization Paths for Graph Traversal on FPGA

    … (BFS) is a fundamental building block in many graph-based applications, but it is difficult to optimize for a field-programmable gate array (FPGA) due to its irregular memory-access patterns. Prior work, based on hardware description languages (HDLs) and high-level synthesis (HLS), address the …

    vt Repository record for Characterization of Sparsity-aware Optimization Paths for Graph Traversal on FPGA (opens in a new tab)

  2. Data Science for Mining Patterns in Spatial Events

    … shortest paths, a bi-directional fragment-multi- graph traversal is proposed for discovering linear hotspots on all simple paths, and an apriori-graph traversal algorithm is proposed to detecting spatio-temporal intersection patterns. Extensive theoretical and experimental analyses show that the …

    umn Repository record for Data Science for Mining Patterns in Spatial Events (opens in a new tab)

  3. The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems

    … they provide an opportunity to perform efficient graph analytics on a single machine. Graph analytics is characterised by frequent synchronisation, which is addressed in part by shared memory systems. However, performance is limited by load imbalance and poor memory locality, which originate in …

    qu-belfast Repository record for The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems (opens in a new tab)

  4. MPIOR: A Framework to Analyze File System Performance of MPI Applications

    … the storage subsystem. It uses a novel runtime graph traversal technique to filter and log only those MPI calls that affect I/O, thus substantially reducing both the number of runs and the size of the trace file. Unlike other such tools, MPIOR collects a valid trace in a single run and it does …

    vt Repository record for MPIOR: A Framework to Analyze File System Performance of MPI Applications (opens in a new tab)

  5. Optimal agent cooperation with local information

    … cooperative surveillance context, we formulate a graph traversal problem on an unbounded structured graph, and restrain the agent motion spatially so that only the lateral agent separation is controlled. We model the problem mathematically as a discrete, infinite state, infinite horizon Dynamic …

    mit Repository record for Optimal agent cooperation with local information (opens in a new tab)

  6. Adaptation of business rules in business workflow systems

    … between business rules in the form of AND-OR graphs. The graphs are created through Event, Condition and Action (ECA) components of business rules. The business rule change propagation is implemented as an algorithm of graph traversal through the AND-OR graph patterns. A two-levels inference …

    london-metro Repository record for Adaptation of business rules in business workflow systems (opens in a new tab)

  7. Monitoring and verifying network behavior using data-plane state

    … called VeriFlow, creates a device independent graph model of the network state, and uses standard graph traversal algorithms to detect invariant violations. We tested our tools with real world network data-plane traces, and with large emulated networks. Both of our tools were able to detect …

    uiuc Repository record for Monitoring and verifying network behavior using data-plane state (opens in a new tab)

  8. Veriflow system analysis and optimization

    … of this new rule change. 2. Forwarding Graph Construction phase\textemdash Construct forwarding graph of those rules affected. 3. Graph Traversal phase\textemdash traversing those forwarding graphs to detect problems. In this work, we aim to boost the performance of the Veriflow system …

    uiuc Repository record for Veriflow system analysis and optimization (opens in a new tab)

  9. Towards Knowledge Representation of the Biowaste-to-Chemicals Domain Using Knowledge Graphs

    … that organizing this knowledge as a knowledge graph (KG) provides a powerful framework for capturing and contextualizing this complexity. The need for such a framework is underscored by significant data gaps in the literature, particularly in the biowaste-to-feedstocks domain, where critical …

    cambridge Repository record for Towards Knowledge Representation of the Biowaste-to-Chemicals Domain Using Knowledge Graphs (opens in a new tab)