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 19 of 19 for “"locality of reference"”.

  1. Certificate Revocation Table: Leveraging Locality of Reference in Web Requests to Improve TLS Certificate Revocation

    … is competitive with or exceeds alternative state-of-the-art solutions in effectiveness, efficiency, certificate growth scalability, mass revocation event scalability, revocation timeliness, privacy, and deployment requirements. The CRT periodically checks the revocation status of X.509 …

    byu Repository record for Certificate Revocation Table: Leveraging Locality of Reference in Web Requests to Improve TLS Certificate Revocation (opens in a new tab) Download PDF for Certificate Revocation Table: Leveraging Locality of Reference in Web Requests to Improve TLS Certificate Revocation (opens in a new tab)

  2. Comparing Strength of Locality of Reference: Popularity, Temporal Correlations, and Some Folk Theorems for the Miss Rates and Outputs of Caches

    The performance of demand-driven caching is known to depend on the locality of reference exhibited by the stream of requests made to the cache. In spite of numerous efforts, no consensus has been reached on how to formalize this notion, let alone on how to compare streams of requests on the basis …

    maryland Repository record for Comparing Strength of Locality of Reference: Popularity, Temporal Correlations, and Some Folk Theorems for the Miss Rates and Outputs of Caches (opens in a new tab)

  3. Alternative Measures for the Analysis of Online Algorithms

    … and evaluate several new models for the analysis of online algorithms. In an online problem, the algorithm does not know the entire input from the beginning; the input is revealed in a sequence of steps. At each step the algorithm should make its decisions based on the past and without any …

    waterloo Repository record for Alternative Measures for the Analysis of Online Algorithms (opens in a new tab)

  4. RAIDX: RAID EXTENDED FOR HETEROGENEOUS ARRAYS

    … market has diversified with the establishment of solid state disks (SSDs) as an alternative to magnetic hard disks (HDDs). Each hard drive technology has its advantages: the SSDs are faster than HDDs but the HDDs are cheaper. Our goal is to construct a parallel storage system with HDDs and SSDs …

    unh-thes Repository record for RAIDX: RAID EXTENDED FOR HETEROGENEOUS ARRAYS (opens in a new tab)

  5. Register Transfer Level Simulation Acceleration via Hardware/Software Process Migration

    The run-time reconfiguration of Field Programmable Gate Arrays (FPGAs) opens new avenues to hardware reuse. Through the use of process migration between hardware and software, an FPGA provides a parallel execution cache. Busy processes can be migrated into hardware-based, parallel processors, and …

    vt Repository record for Register Transfer Level Simulation Acceleration via Hardware/Software Process Migration (opens in a new tab)

  6. Spatiotemporal Indexing With the M-Tree

    … GIS applications for transportation and defense often require the ability to store the evolving positions of a large number of objects as they are observed in motion, and to support queries on this spatiotemporal data in real time. Because the M-Tree has been proven as an index for spatial …

    uno Repository record for Spatiotemporal Indexing With the M-Tree (opens in a new tab)

  7. Analysis and Modeling of World Wide Web Traffic

    … monitoring, collecting, analyzing, and modeling of World Wide Web (WWW) traffic and client interactions. The rapid growth of WWW usage has not been accompanied by an overall understanding of models of information resources and their deployment strategies. Consequently, the current Web …

    vt Repository record for Analysis and Modeling of World Wide Web Traffic (opens in a new tab)

  8. High Performance Large Graph Analytics by Enhancing Locality

    Graphs are widely used in a variety of domains for representing entities and their relationship to each other. Graph analytics helps to understand, detect, extract and visualize insightful relationships between different entities. Graph analytics has a wide range of applications in various domains …

    odu Repository record for High Performance Large Graph Analytics by Enhancing Locality (opens in a new tab)

  9. On Designing Adaptive Data Structures with Adaptive Data "Sub"-Structures

    This thesis proposes the use of "Adaptive" Data-Structures (ADSs) that invoke reinforcement learning schemes from the theory of Learning Automata (LA). The ADSs work in conjunction with select re-organization rules to update themselves as they receive queries from the Environment. The result of …

    carleton Repository record for On Designing Adaptive Data Structures with Adaptive Data "Sub"-Structures (opens in a new tab)

  10. Improved implementation of some coloring algorithms for the determination of large and sparse Jacobian matrices

    When we solve a system of nonlinear equations or nonlinear least-squares problem by Newton's method or one of its many variants, the most computationally expensive operations per iteration are the evaluation of the Jacobian and solving the associated linear system. Many real-life problems are …

    lethbridge Repository record for Improved implementation of some coloring algorithms for the determination of large and sparse Jacobian matrices (opens in a new tab)

  11. Pre-fetch document caching to improve World-Wide Web user response time

    The World-Wide Web, or the Web, is currently one of the most highly used network services. Because of this, improvements and new technologies are rapidly being developed and deployed. One important area of study is improving user response time through the use of caching mechanisms. Most prior work …

    vt Repository record for Pre-fetch document caching to improve World-Wide Web user response time (opens in a new tab)

  12. Development of a new prediction algorithm and a simulator for the Predictive Read Cache (PRC)

    … discrepancy without incurring the hardware cost of a second-level cache. Although the PRC can provide an improvement over a memory hierarchy using only a first-level cache, previous studies have shown that its performance is degraded due to the poor locality of reference caused by program …

    nps Repository record for Development of a new prediction algorithm and a simulator for the Predictive Read Cache (PRC) (opens in a new tab)

  13. Improving locality with dynamic memory allocation

    … memory allocators are a determining factor of an application's performanceand have the opportunity to improve a major performance bottleneck ontoday's computer hardware: data locality. To approach this problem, a memoryallocator must rst oer strategies that allow the locality problem to be …

    tamu Repository record for Improving locality with dynamic memory allocation (opens in a new tab)

  14. Parallel prefetching and caching

    … from the cache, thus reducing the effectiveness of the cache, while a block cached too long may reduce the effectiveness of prefetching by denying opportunities to the prefetcher. Using both analytical and experimental methods, we study the problem of integrated prefetching and caching for an I/O …

    washington Repository record for Parallel prefetching and caching (opens in a new tab)

  15. Automatically Optimizing Tree Traversal Algorithms

    … datasets, their performance suffers from poor locality and parallelism. Programmers are burdened with the arduous task of manually tuning such applications for better performance. Generally applicable techniques to optimize irregular applications are highly desired, yet scarce.</p> <p>In this …

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

  16. Data allocation design in computer networks.

    … improve the efficiency and effectiveness of the use of distributed database systems to satisfy geographically dispersed data processing demands. Among several issues related to distribution design in distributed databases, data allocation design is of major importance. Choices of a …

    arizona-thes Repository record for Data allocation design in computer networks. (opens in a new tab)

  17. Virtual Cadaver Navigation System: Using Virtual Reality For Learning Human Anatomy

    The use of virtual reality (VR) for visualization can revolutionize medical training by simulating real world medical training procedures through intuitive and engaging user interface. Existing virtual reality based visualization systems for human anatomy are based on 3D surface and volumetric …

    usf Repository record for Virtual Cadaver Navigation System: Using Virtual Reality For Learning Human Anatomy (opens in a new tab)

  18. Split array and scalar data cache: A comprehensive study of data cache organization.

    … the inability to distinguish different types of localities, and non-selectively cache all data rather than making any attempt to take special advantage of the locality type. This causes unnecessary movement of data among the levels of the memory hierarchy and increases in miss ratio. In this …

    unt Repository record for Split array and scalar data cache: A comprehensive study of data cache organization. (opens in a new tab)

  19. Adaptation of the MapReduce programming framework to compute-intensive data-analytics kernels

    … applications have become a major component of many different business domains, as well as scientific computing applications. These algorithms stem from domains as diverse as web analysis and social networks, machine learning and data mining, text analysis, bio-informatics, astronomy image …

    uiuc Repository record for Adaptation of the MapReduce programming framework to compute-intensive data-analytics kernels (opens in a new tab)