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 15 of 15 for “"Memory allocator"”.

  1. Features of a Multi-Threaded Memory Allocator

    … performance. Providing high-performance memory-management is important for multi-threaded programs. This thesis looks at memory allocation of dynamic-allocation memory in concurrent C and C++ programs. The challenges facing the design of any memory allocator include minimizing …

    waterloo Repository record for Features of a Multi-Threaded Memory Allocator (opens in a new tab)

  2. Efficient Memory Allocator for Restricting Use-After-Free Exploitations

    Attacks on heap memory, encompassing memory overflow, double and invalid free, use-after-free (UAF), and various heap-spraying techniques are ever-increasing. Existing secure memory allocators can be generally classified as complete UAF-mitigating allocators that focus on detecting and stopping UAF …

    waterloo Repository record for Efficient Memory Allocator for Restricting Use-After-Free Exploitations (opens in a new tab)

  3. POSEIDON: The First Safe and Scalable Persistent Memory Allocator

    With the advent of byte-addressable Non-Volatile Memory (NVMM), the need for a safe, scalable and high-performing memory allocator is inevitable. A slow memory allocator can bottleneck the entire application stack, while an unsecure memory allocator can render underlying systems and applications …

    vt Repository record for POSEIDON: The First Safe and Scalable Persistent Memory Allocator (opens in a new tab)

  4. A Fault-Tolerant, Multi-Heap Dynamic Memory Allocator For FreeRTOS

    The use of dynamic memory allocation presents a significant challenge for embedded systems, particularly in applications that require high reliability. The software controlling these systems needs to perform critical operations within strict timing constraints, and memory management plays a …

    calpoly Repository record for A Fault-Tolerant, Multi-Heap Dynamic Memory Allocator For FreeRTOS (opens in a new tab)

  5. Xmalloc: a scalable lock-free dynamic memory allocator for many-core machines

    … However, most of past research, on scalable memory allocators such as atomic operation based lock-free algorithms, can be scalable with number of processors growing, but have poor scalability with the number of vector units in one SIMD processor growing. As a result, they are not truly …

    uiuc Repository record for Xmalloc: a scalable lock-free dynamic memory allocator for many-core machines (opens in a new tab)

  6. General-purpose Programming Techniques for Emerging Systems with Non-volatile Byte-addressable Random Access Memory

    … byte-addressable non-volatile random access memory (NVRAM) technologies allow persistent data to be accessed and manipulated using CPU load and store instructions. The persistent data in NVRAM can be persisted in the same format as it is manipulated and re-used across execution cycles. In …

    rice Repository record for General-purpose Programming Techniques for Emerging Systems with Non-volatile Byte-addressable Random Access Memory (opens in a new tab)

  7. High-Performance Concurrent Memory Allocation

    Memory management takes a sequence of program-generated allocation/deallocation requests and attempts to satisfy them within a fixed-sized block of memory while minimizing the total amount of memory used. A general-purpose dynamic-allocation algorithm cannot anticipate future allocation requests so …

    waterloo Repository record for High-Performance Concurrent Memory Allocation (opens in a new tab)

  8. Formal memory models for verifying C systems code

    … or a variant. C has a very low level of type and memory abstraction and formal reasoning about C systems code requires a memory model that is able to capture the semantics of C pointers and types. At the same time, proof-based verification demands abstraction, in particular from the aliasing and …

    unsw Repository record for Formal memory models for verifying C systems code (opens in a new tab)

  9. Optimizing Foundational System Building Blocks of Datacenter Applications

    … we delve into a foundational system library, the memory allocator. Datacenter applications typically share the usage of certain low-level software libraries, and memory allocation constitutes a substantial component of datacenter computation. Optimizing the memory allocator can improve application …

    cornell Repository record for Optimizing Foundational System Building Blocks of Datacenter Applications (opens in a new tab)

  10. Framework for Evaluating Dynamic Memory Allocators Including a New Equivalence Class Based Cache-conscious Allocator

    … factors, but most notably by the well-known CPU-memory speed gap (often known as the memory wall). This results in the CPU sitting idle waiting for data to be brought from memory to processor caches. The addressing used by caches cause non-uniform accesses to various cache sets. The …

    unt Repository record for Framework for Evaluating Dynamic Memory Allocators Including a New Equivalence Class Based Cache-conscious Allocator (opens in a new tab)

  11. Simple, safe, and efficient memory management using linear pointers

    Efficient and safe memory management is a hard problem. Garbage collection promises automatic memory management but comes with the cost of increased memory footprint, reduced parallelism in multi-threaded programs, unpredictable pause time, and intricate tuning parameters balancing the program's …

    bu Repository record for Simple, safe, and efficient memory management using linear pointers (opens in a new tab)

  12. Understanding NUMA Effects on Memory Allocation and Reclamation

    Memory management in multicore systems is a well studied area. Many approaches to memory management have been developed and tuned with specific hardware architectures in mind, capitalizing on hardware characteristics to improve performance. In this thesis, the focus is on memory allocation and …

    waterloo Repository record for Understanding NUMA Effects on Memory Allocation and Reclamation (opens in a new tab)

  13. Mitigating the performance impact of memory bloat

    Memory bloat is loosely defined as an excessive memory usage by an application during its execution. Due to the complexity of efficient memory management that developers have to deal with, memory bloat is pervasive and is often neglected in favor of lower application development cost. …

    gatech Repository record for Mitigating the performance impact of memory bloat (opens in a new tab)

  14. Pushing the Limits of Compiler Verification

    … about the calling convention and the system memory allocator. Verifying peephole optimizations in Peek requires proving only a set of local properties, which my collaborators and I have proved are sufficient to ensure global transformation correctness. We have proven these local properties …

    washington Repository record for Pushing the Limits of Compiler Verification (opens in a new tab)

  15. Design and Analysis of an Extreme-Scale, High-Performance, and Modular Agent-Based Simulation Platform

    … three key performance challenges for shared-memory parallelism, for which we present solutions. 1) To maximize parallelization, we present an optimized grid to search for neighbors and parallelize the merging of thread-local results. 2) We reduce the memory access latency with a non-uniform …

    ethz Repository record for Design and Analysis of an Extreme-Scale, High-Performance, and Modular Agent-Based Simulation Platform (opens in a new tab)