Sökning: "data locality"
Visar resultat 1 - 5 av 62 avhandlingar innehållade orden data locality.
1. Methods for Creating and Exploiting Data Locality
Sammanfattning : The gap between processor speed and memory latency has led to the use of caches in the memory systems of modern computers. Programs must use the caches efficiently and exploit data locality for maximum performance. LÄS MER
2. Exploiting data locality in adaptive architectures
Sammanfattning : The speed of processors increases much faster than the memory access time. This makes memory accesses expensive. To meet this problem, cache hierarchies are introduced to serve the processor with data. However, the effectiveness of caches depends on the amount of locality in the application's memory access pattern. LÄS MER
3. Multithreaded PDE Solvers on Non-Uniform Memory Architectures
Sammanfattning : A trend in parallel computer architecture is that systems with a large shared memory are becoming more and more popular. A shared memory system can be either a uniform memory architecture (UMA) or a cache coherent non-uniform memory architecture (cc-NUMA). LÄS MER
4. Software Techniques for Distributed Shared Memory
Sammanfattning : In large multiprocessors, the access to shared memory is often nonuniform, and may vary as much as ten times for some distributed shared-memory architectures (DSMs). This dissertation identifies another important nonuniform property of DSM systems: nonuniform communication architecture, NUCA. LÄS MER
5. Methods for run time analysis of data locality
Sammanfattning : The growing gap between processor clock speed and DRAM access time puts new demands on software and development tools. Deep memory hierarchies and high cache miss penalties in present and emerging computer systems make execution time sensitive to data locality. LÄS MER