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 20 of 71 for “"Temporal locality"”.

  1. Design of platforms for computing context with spatio-temporal locality

    … in platforms for storing and querying spatio-temporal events where queries exhibit locality. Recent advances in sensor technologies have made possible gathering a variety of information on the status of users, the environment machines, etc. Combining this information with computation we are …

    texas Repository record for Design of platforms for computing context with spatio-temporal locality (opens in a new tab)

  2. An architecture for an ATM network continuous media server exploiting temporal locality of access

    … exploits reuse of data among streams that are temporally close to each other within the same clip; the data fetched on behalf of the leading stream may be cached and reused by the following streams. Therefore, only the leading stream requires access to the physical disk and the potential level …

    kent Download PDF for An architecture for an ATM network continuous media server exploiting temporal locality of access (opens in a new tab)

  3. An Architecture for an ATM Network Continuous Media Server Exploiting Temporal Locality of Access

    … exploits reuse of data among streams that are temporally close to each other within the same clip; the data fetched on behalf of the leading stream may be cached and reused by the following streams. Therefore, only the leading stream requires access to the physical disk and the potential level …

    kent Download file for An Architecture for an ATM Network Continuous Media Server Exploiting Temporal Locality of Access (opens in a new tab)

  4. A hybrid cache for a popularity-based cache management scheme for a RAID storage system

    … each time period, it is not able to exploit the temporal locality hidden in the I/O requests, which leads to a reduced cache hit rate. In this paper, we propose a method of using a SSD-Battery Backed DRAM hybrid cache to reach both a high cache hit rate and low write size count on SSD. DRAMs have …

    umn Repository record for A hybrid cache for a popularity-based cache management scheme for a RAID storage system (opens in a new tab)

  5. Cooperation paradigms for overcoming communication limitations in multirobot wide area coverage

    … robots that are farther apart. Spatial and temporal locality can be instrumental in determining relevance in subsequent action selection; (2) an approach in which observation leverages spatial and temporal locality to infer state rather than rely on digital messaging; and (3) an approach in …

    alabama Repository record for Cooperation paradigms for overcoming communication limitations in multirobot wide area coverage (opens in a new tab)

  6. Graph Locality Prefetcher for Graph Database

    … memory hierarchies that exploit spatial and temporal locality, we observe that graph traversals do not necessarily exhibit these same notions of locality. This results in degraded performance of the memory hierarchy. Consequently, our hardware prefetcher exploits locality that is intrinsic to …

    waterloo Repository record for Graph Locality Prefetcher for Graph Database (opens in a new tab)

  7. Energy efficient architectures for irregular data streams

    … around conventional assumptions on spatio-temporal locality are inefficient for these important domain areas. This PhD thesis finds that energy efficiency and performance of such data irregular applications can be improved via near memory and near processor sparse data stream acceleration …

    gatech Repository record for Energy efficient architectures for irregular data streams (opens in a new tab)

  8. Machine learning feature selection for tuning memory page swapping

    … repeatedly in a sequence. This is an example of temporal locality. In this instance, we can predict pages that will not be recalled again from the backing store with a precision and recall of 0.82 and 0.81, respectively, with a baseline of 0.30. The second is trying to predict when the system has …

    nps Repository record for Machine learning feature selection for tuning memory page swapping (opens in a new tab)

  9. Workload-aware live storage migration for clouds

    … virtual machine's storage I/O workload such as temporal locality, spatial locality and popularity characteristics to compute an efficient data transfer schedule. Using a trace-driven framework, we show that our algorithm provides large performance benefits across a wide range of popular virtual …

    rice Repository record for Workload-aware live storage migration for clouds (opens in a new tab)

  10. Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs

    … regular memory access patterns and minimal temporal locality, making their accesses easily predictable by prefetchers. In this thesis, we propose Scan Promotion replacement policy that takes into account the regular access patterns and low temporal reuse characteristics of ML workloads while …

    tamu Repository record for Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs (opens in a new tab)

  11. Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs

    … regular memory access patterns and minimal temporal locality, making their accesses easily predictable by prefetchers. In this thesis, we propose Scan Promotion replacement policy that takes into account the regular access patterns and low temporal reuse characteristics of ML workloads while …

    tamu Repository record for Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs (opens in a new tab)

  12. Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs

    … regular memory access patterns and minimal temporal locality, making their accesses easily predictable by prefetchers. In this thesis, we propose Scan Promotion replacement policy that takes into account the regular access patterns and low temporal reuse characteristics of ML workloads while …

    tamu Repository record for Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs (opens in a new tab)

  13. Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs

    … regular memory access patterns and minimal temporal locality, making their accesses easily predictable by prefetchers. In this thesis, we propose Scan Promotion replacement policy that takes into account the regular access patterns and low temporal reuse characteristics of ML workloads while …

    tamu Repository record for Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs (opens in a new tab)

  14. Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs

    … regular memory access patterns and minimal temporal locality, making their accesses easily predictable by prefetchers. In this thesis, we propose Scan Promotion replacement policy that takes into account the regular access patterns and low temporal reuse characteristics of ML workloads while …

    tamu Repository record for Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs (opens in a new tab)

  15. Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs

    … regular memory access patterns and minimal temporal locality, making their accesses easily predictable by prefetchers. In this thesis, we propose Scan Promotion replacement policy that takes into account the regular access patterns and low temporal reuse characteristics of ML workloads while …

    tamu Repository record for Enhancing System Level Cache Policies to Improve ML Inference on Heterogeneous SoCs (opens in a new tab)

  16. Increasing TLB reach using TCAM cells

    … aggregation exploits both the spatial and temporal locality inherent in most application programs. To support dynamic aggregation, we introduce the use of ternary-CAM (TCAM) cells at the second-level TLB. The modified TLB architecture results in an increase of TLB reach without additional …

    tamu Repository record for Increasing TLB reach using TCAM cells (opens in a new tab)

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

    … is limited by load imbalance and poor memory locality, which originate in the irregular structure of small-world graphs.<br/>This dissertation demonstrates how graph partitioning can be used to optimise (i) load balance, (ii) Non-Uniform Memory Access (NUMA) locality and (iii) temporal …

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

  18. Improving Data Locality in Applications using Message Passing

    … of program components. However it improves the temporal locality of data in a program by facilitating temporal and spatial reorganization of program components. Temporal reorganization refers to the batched execution of program components. Spatial reorganization refers to the scheduling of …

    waterloo Repository record for Improving Data Locality in Applications using Message Passing (opens in a new tab)

  19. No inclusion in multi level caches

    … second one filters out non-stack data of poor temporal locality. The two techniques not only reduce the L1-L2 traffic but also improve the efficiency of L2 cache as a backup storage. The simulation results show that these optimizations may reduce the main memory accesses by up to 23% and …

    iastate Repository record for No inclusion in multi level caches (opens in a new tab)

  20. Main-memory near-data acceleration with concurrent host access

    … is attractive for applications that exhibit low temporal locality and low arithmetic intensity. By bringing computation close to data, PIMs utilize proximity to overcome the bandwidth bottleneck of a main memory bus. Unlike discrete accelerators, such as GPUs, PIMs can potentially accelerate …

    texas Repository record for Main-memory near-data acceleration with concurrent host access (opens in a new tab)

Page 1 of 4