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 13 of 13 for “"malloc"”.

  1. JEFF and STEVE: Allocator and Analysis Tool The Tales of The Compacting Allocator JEFF and His Friend STEVE, The Malloc Benchmarking and Analysis Tool

    Jeff is a compacting allocator and Steve is an allocator benchmarking tool. Steve can be used to benchmark any application with any allocator. Steve records memory traces of an application during execution and uses those traces to benchmark any number of allocators for which there are drivers. …

    chalmers Repository record for JEFF and STEVE: Allocator and Analysis Tool The Tales of The Compacting Allocator JEFF and His Friend STEVE, The Malloc Benchmarking and Analysis Tool (opens in a new tab)

  2. Automated Compiler Driven Superpage Allocation and its Applications

    … replaces all memory allocation with a custom malloc implementation. This malloc implementation is superpage-aware and supports both statically and dynamically determined superpage allocation. In addition to the advantages afforded by the compiler when making judicious use of superpages, …

    texas-state Repository record for Automated Compiler Driven Superpage Allocation and its Applications (opens in a new tab)

  3. Translating c into java bytecode /

    … a single class which will simulate behavior of malloc() and free() functions. Those functions are custom and implemented only in this work. The developed compiler cannot compile entire COD CIF parser into Java bytecode, but it solves the gap between C and Java. The supported features of …

    vilnius Repository record for Translating c into java bytecode / (opens in a new tab)

  4. Flow Size Prediction With Short Time Gaps

    … I/O) and low-level function call traces (e.g.,malloc(), send()) that are captured during the execution of each workload via host instrumentation using eBPF. These traces are then used to train machine learning models for flow size prediction with varying time gaps ranging from microseconds to …

    calgary Repository record for Flow Size Prediction With Short Time Gaps (opens in a new tab)

  5. Modelling dynamic memory allocation and deallocation using amorphous slicing

    … language (involving heap allocation using malloc) is presented as a context-free, syntax directed transformation. Amorphous program slicing is used to create a Dynamic Memory Model (DMM). The slice is constructed from a transformed version of the original program in which heap access is …

    london-metro

  6. Efficient detection of pointer and array access errors at run-time

    … the program, by calling the C library function malloc(). When the components of such a block are accessed using array or pointer operations, we check for spatial errors (i.e., the access creates a reference to a location outside of the block) and temporal errors (i.e., the block being referenced …

    iastate Repository record for Efficient detection of pointer and array access errors at run-time (opens in a new tab)

  7. Monadic and Substructural Type Systems for Region-Based Memory Management

    … of data, which avoids both the tedium of malloc/free and the overheads of a garbage collector. Type systems for region-based memory management enhance the utility of this scheme by statically determining when a program is guaranteed to not perform any erroneous region operations. We …

    cornell Repository record for Monadic and Substructural Type Systems for Region-Based Memory Management (opens in a new tab)

  8. Coordinated memory management in virtualized environments

    … in intra-VM memory management mechanisms like ‘malloc’. Towards realizing and validating this goal, I have made the following research contributions through my dissertation: (1) I analyzed the memory requirement pattern of prevalent applications, which exhibit bursty behavior and showcased the …

    gatech Repository record for Coordinated memory management in virtualized environments (opens in a new tab)

  9. High-Performance Concurrent Memory Allocation

    … programs. Existing memory allocators, glibc, dlmalloc, hoard, jemalloc, ptmalloc3, rpmalloc, tbmalloc, and the new allocator llheap are all compared using the new micro-benchmark test-suite.

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

  10. Palloc: parallel dynamic memory allocation

    … the boundary-tag / binning strategy used in dlmalloc. We find that, for larger allocation patterns, our implementation exhibits competitive base performance relative to other parallel allocators, superior scaling, and better resistance in practice to fragmentation. PALLOC2 contributes a second …

    uiuc Repository record for Palloc: parallel dynamic memory allocation (opens in a new tab)

  11. mVizion: taking a closer look at memory utilization in C/C++ programs

    Computer system performance depends on the efficiency and precision of all of its components. When it comes to software, the primary goal is to ensure the most effective use of the hardware resources while maintaining the accuracy of the computations being handled. While many software developers …

    uiuc Repository record for mVizion: taking a closer look at memory utilization in C/C++ programs (opens in a new tab)

  12. Nástroj pro analýzu výkonu alokátorů paměti v operačním systému Linux

    Tato diplomová práce prezentuje nástroj, který umožňuje analýzu vlastností dynamických paměťových alokátorů se zaměřením na jejich výkon. Práce identifikuje důležité výkonnostní metriky paměťových alokátorů a také faktory prostředí a programu, které tyto metriky mohou ovlivnit. Na základě těchto …

    brno-tech Repository record for Nástroj pro analýzu výkonu alokátorů paměti v operačním systému Linux (opens in a new tab)

  13. Dynamické přidělování paměti v TinyOS

    Táto práce porovnáva po stránce teoretické i praktické různé způsoby dynamického přidělování paměti v operačním systému TinyOS určeném pro jednoduchá programovatelná zařízení. U jednotlivých způsobů byly sledovány různé aspekty. Mezi hlavní patří efektivita využití zdrojů, rychlost alokace a …

    brno-tech Repository record for Dynamické přidělování paměti v TinyOS (opens in a new tab)