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 16 of 16 for “"Address Mapping"”.

  1. Reducing main memory access latency through SDRAM address mapping techniques and access reordering mechanisms

    … memory controllers. In this thesis, SDRAM address mapping techniques and memory access reordering mechanisms are studied and applied to memory controller design with the goal of reducing observed main memory access latency. The proposed bit-reversal address mapping attempts to distribute …

    mtu Repository record for Reducing main memory access latency through SDRAM address mapping techniques and access reordering mechanisms (opens in a new tab)

  2. The Performance And Power Impact Of Using Multiple Dram Address Mapping Schemes In Multicore Processors

    … satisfied by the main memory through a specific address mapping scheme that is hard-coded in the memory controller. A dynamic address mapping scheme technique is investigated to provide higher performance and lower power consumption, and a method to throttle memory to meet a specific power …

    ucf Repository record for The Performance And Power Impact Of Using Multiple Dram Address Mapping Schemes In Multicore Processors (opens in a new tab)

  3. MEMORYISLANDS: A FEDERATED APPROACH FOR EFFICIENT MEMORY MAPPINGS

    … all requests with the same set of rules. Memory mapping is a clear example of this failing "one-size-fits-all" memory approach. Encompassing several parallelism levels (channels, ranks, groups, and banks), the memory performance of an application depends heavily on its particular memory access …

    mcmaster Repository record for MEMORYISLANDS: A FEDERATED APPROACH FOR EFFICIENT MEMORY MAPPINGS (opens in a new tab)

  4. Flash memory management with cooperation, adaptation and assistance

    … with the cooperation between wear leveling and address mapping. The second approach is to be workload-adaptive. ADPAT and TreeFTL have been devised. They are for address mapping and RAM buffer management, respectively, and can adapt to different workloads for data access. The third approach is …

    nus Repository record for Flash memory management with cooperation, adaptation and assistance (opens in a new tab) Download file for Flash memory management with cooperation, adaptation and assistance (opens in a new tab)

  5. Energy-efficient and cost-effective reliability design in memory systems

    … proposes a novel BCRM (Biased Chinese Remainder Mapping) to resolve the address mapping issue in page-interleaving scheme. The proposed BCRM scheme provides an opportunity for building flexible reliability system, which favors the consumer-level computers to save power consumption.</p> <p>Within …

    iastate Repository record for Energy-efficient and cost-effective reliability design in memory systems (opens in a new tab)

  6. The Applications of Workload Characterization in The World of Massive Data Storage

    … system. Third, we design several novel static address mapping schemes for shingled write disks (SWDs) to minimize the write amplification overhead in hard drives adopting SMR technology. Fourth, we propose a track-level shingled translation layer (T-STL) for SWDs with hybrid update strategy …

    umn Repository record for The Applications of Workload Characterization in The World of Massive Data Storage (opens in a new tab)

  7. Software-only Rowhammer Attacks and Countermeasures

    … rowhammer vulnerability. As understanding a DRAM address mapping is a necessity to perform efficient and effective rowhammer tests, it is not publicly available in Intel-based microarchitectures. DRAMDig efficiently and deterministically uncovers the DRAM address mapping on any Intel-based …

    unsw Repository record for Software-only Rowhammer Attacks and Countermeasures (opens in a new tab)

  8. Program relocation in a multiprogramming environment.

    … for the relocation, or movement, including address mapping, of programs within a multiprogrammed digital computer. The aim of doing so is to determine the best method for use in the limited time-shared computing system proposed for development in the Digital Control Laboratory of the Naval …

    nps Repository record for Program relocation in a multiprogramming environment. (opens in a new tab)

  9. System Optimization for 3D-Stacking Memories

    … are co-optimized, encompassing the MMU and address mapping, a twofold improvement in the performance of a standard computer system can be attained, relative to a system devoid of application awareness with an RISC-V prototype based on FPGA.

    penn Repository record for System Optimization for 3D-Stacking Memories (opens in a new tab)

  10. Improving Memory Performance for Both High Performance Computing and Embedded/Edge Computing Systems

    … dynamic simulations etc. My research on optimal address mapping improves the memory performance by increasing the channel and bank level parallelism. In an another research direction, I proposed and evaluated adaptive page migration techniques that obviates the need for offline analysis of an …

    unt Repository record for Improving Memory Performance for Both High Performance Computing and Embedded/Edge Computing Systems (opens in a new tab)

  11. High-Performance DRAM System Design Constraints and Considerations

    … are used to look at runtimes. The process of mapping a memory location to a physical location, the algorithm for choosing the ordering of commands to be sent to the DRAMs and the method of managing the row buffers are examined in detail. We find that the choice in these algorithms and policies …

    maryland Repository record for High-Performance DRAM System Design Constraints and Considerations (opens in a new tab)

  12. Techniques to maximize memory bandwidth on the Rigel compute accelerator

    … can be achieved by the programmer if the address mapping bits are understood, so that neighboring threads create memory requests that do not conflict. MIMD hardware as implemented in Rigel avoids the SIMD costs of serialization of conditional execution paths and load imbalance from varying …

    uiuc Repository record for Techniques to maximize memory bandwidth on the Rigel compute accelerator (opens in a new tab)

  13. A Manycore Architecture for Scalability, Programmability, and Compute Density

    … memory hierarchy, memory-level parallelism, address mapping and translation, synchronization, and thread management. Its flexibility has been demonstrated with a parallel benchmark suite representing a broad range of computational and communication patterns. Network-on-Chip (NoC) has become …

    washington Repository record for A Manycore Architecture for Scalability, Programmability, and Compute Density (opens in a new tab)

  14. Performance and Leakage: Covert and Side Channels from TrustZone, cache coherence, prefetching, and hugepages

    … lookaside buffers (TLBs), and large-page memory mappings. While these mechanisms significantly enhance speed and efficiency, they also introduce unintended covert and side-channel communication paths across privilege domains, cores, and memory regions. This dissertation provides a unified, …

    iastate Repository record for Performance and Leakage: Covert and Side Channels from TrustZone, cache coherence, prefetching, and hugepages (opens in a new tab)

  15. Exploration and mapping with mobile robots

    … the map learning problem, a robot has to <br>address mapping, localization, and path planning at the same time. In <br>general, these three tasks cannot be decoupled and solved <br>independently and map learning is thus referred to as the simultaneous <br>planning, localization, and mapping …

    freiburg-diss Repository record for Exploration and mapping with mobile robots (opens in a new tab)

  16. An associative backend machine for data base management

    … application programs and a sophisticated address mapping methods. This accounts for a large software overhead and the resulting semantic gap between the high level language and the underlying machine architecture. To overcome the difficulties of the von Neumann machines, Slotnick suggested …

    ucf Repository record for An associative backend machine for data base management (opens in a new tab)