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 20 of 31 for “"Dynamic Memory Allocation"”.

  1. Palloc: parallel dynamic memory allocation

    In this thesis, we describe two related memory allocators, each with novel properties. PALLOC1 contributes a unique strategy based on the traversal of a parallel tree data structure for allowing concurrent allocations and frees to proceed within a single thread's heap. PALLOC1 also provides a …

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

  2. Improving locality with dynamic memory allocation

    Dynamic 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)

  3. Dynamic Memory Allocation within a Behavioural Synthesis System

    … MOODS system that allows direct conversion of dynamic memory constructs within the source language into a fully structural design with run-time memory representation.</p><p>VHDL is used as the source language for design descriptions, and is capable of directly describing dynamic memory …

    soton Download PDF for Dynamic Memory Allocation within a Behavioural Synthesis System (opens in a new tab)

  4. Dynamic Memory Allocation in a Virtual Memory Computer

    Made available in DSpace on 2014-12-12T20:54:35Z (GMT). No. of bitstreams: 1 7714931.pdf: 4829139 bytes, checksum: 386c7fa650ae638ba69231cf0d111b2b (MD5) Previous issue date: 1977

    uiuc Repository record for Dynamic Memory Allocation in a Virtual Memory Computer (opens in a new tab)

  5. Modelling dynamic memory allocation and deallocation using amorphous slicing

    … the way in which a system allocates and releases dynamic memory present significant challenges to the software maintainer. Because the questions underlying these problems are undecidable, no system can provide a completely fail safe certification. For example, in checking for memory leaks, a …

    london-metro

  6. Compiler-Decided Dynamic Memory Allocation for Scratch-Pad Based Embedded Systems

    … a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-managed SRAM memory that replaces the hardware-managed cache. It is motivated by its better real-time guarantees vs cache and by its …

    maryland Repository record for Compiler-Decided Dynamic Memory Allocation for Scratch-Pad Based Embedded Systems (opens in a new tab)

  7. 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)

  8. Node-oriented dynamic memory management for real-time systems on ccNUMA architecture systems

    … and programming languages have been able to use dynamic memory allocation and deallocation. Although memory allocation has always required explicit interaction with an allocator, deallocation can be either explicit or implicit. Surprisingly, even though memory allocation/deallocation algorithms …

    whiterose Download PDF for Node-oriented dynamic memory management for real-time systems on ccNUMA architecture systems (opens in a new tab)

  9. Eigensystem Assignment Using Singular Value Decomposition

    … methods, for improved numerical accuracy. Dynamic memory allocation is implemented to reduce system core requirements for matrix storage. Interactive plant parameter modification is implemented to allow user interaction with the program~ reducing design time. Finally, disk input-output is …

    odu Repository record for Eigensystem Assignment Using Singular Value Decomposition (opens in a new tab)

  10. Generalized Portable SHMEM library for high performance computing

    … SHMEM and GPSHMEM realize the distributed shared memory programming model, that is, a shared memory programming model in environments in which memory is physically distributed. It is intended for use on a large variety of hardware platforms, including distributed systems with a network …

    iastate Repository record for Generalized Portable SHMEM library for high performance computing (opens in a new tab)

  11. Enabling behavior-based energy consumption and memory footprint optimizations in native contexts

    … through the lens of energy consumption and memory footprint: (i) a central aspect of program behavior is its dynamic requests for memory, (ii) approximately optimal solutions to memory allocation can be computed offline and (iii) software is the result of iterative decision-making over …

    greece Repository record for Enabling behavior-based energy consumption and memory footprint optimizations in native contexts (opens in a new tab)

  12. Computation and visualization of invariant manifolds

    … this thesis, we start with the basic concepts of dynamical systems. Then we introduce the general types of problems that the well-known software package AUTO solves. AUTO uses a boundary value algorithm with Gauss collocation and pseudo-arclength continuation. These two features distinguish AUTO …

    concordia Download PDF for Computation and visualization of invariant manifolds (opens in a new tab)

  13. An Investigation of Deletion Schemes for Dynamically Allocated Objects in ORBSLAM3

    … does not have a scheme in place to free/reuse dynamically allocated memory. Dynamic memory allocation is used widely for storing image data/keyframes and marking 3D locations of features shared by several keyframes (also called map points). The lack of such a scheme could potentially cause heap …

    buffalo Repository record for An Investigation of Deletion Schemes for Dynamically Allocated Objects in ORBSLAM3 (opens in a new tab)

  14. CLIPPING AND CAPPING ALGORITHM FOR AN N-SIDED POLYHEDRAL FINITE ELEMENT

    … routines in the program have taken advantage of dynamic memory allocation via FORTRAN subroutine argument calls. Through this latter feature new capability can be concatenated to the end of the current processing in a prototype manner for rapid implementation and exploration.

    arizona-thes Repository record for CLIPPING AND CAPPING ALGORITHM FOR AN N-SIDED POLYHEDRAL FINITE ELEMENT (opens in a new tab)

  15. Dynamic Memory Management for Embedded Real-Time Multiprocessor System-on-a-Chip

    … and huge (tens of Mega Bytes) amount of memory, all on the same chip. Dealing with the global on-chip memory allocation/deallocation in a dynamic yet deterministic way is an important issue for upcoming billion transistor multiprocessor SoC designs. To achieve this, we propose a memory …

    gatech Repository record for Dynamic Memory Management for Embedded Real-Time Multiprocessor System-on-a-Chip (opens in a new tab)

  16. High-Performance Computing in Next-Generation Sequencing Read Alignment

    … studies. First, we introduce a novel approach to dynamic memory allocation tailored for massively parallel systems, particularly Graphical Processing Units (GPUs), to support NGS alignment and other applications. Unlike traditional memory allocators that rely on global data structures which can …

    usf Repository record for High-Performance Computing in Next-Generation Sequencing Read Alignment (opens in a new tab)

  17. Away From Linear Models of Concurrent Programs

    … how each individual statement modifies the memory state, and then composing these definitions into a whole program via the interpretation of the sequential composition operator: the humble semicolon. The creation of the multiprocessor and advent of parallelism began to challenge this model. …

    kent Download PDF for Away From Linear Models of Concurrent Programs (opens in a new tab)

  18. Top: An Infrastructure for detecting Application-Specific Program Errors by Binary Runtime Instrumentation

    … the application to check for program properties dynamically whereas others analyze the program statically. We use a technique that analyzes a program's execution by binary runtime instrumentation. Unlike tools that work on a particular language or an intermediate representation of a language, our …

    vt Repository record for Top: An Infrastructure for detecting Application-Specific Program Errors by Binary Runtime Instrumentation (opens in a new tab)

  19. SlimGuard: Design and Implementation of a Memory Efficient and Secure Heap Allocator

    … severe threat. State-of-the-art secure dynamic memory allocators can offer protection, however their memory consumption is high, making them suboptimal in many situations. We introduce sys, a secure allocator whose design is driven by memory efficiency. Among other features, sys uses an …

    vt Repository record for SlimGuard: Design and Implementation of a Memory Efficient and Secure Heap Allocator (opens in a new tab)

  20. Modular verification of shared-memory concurrent system software

    … written in a low-level programming language with dynamic memory allocation and pointer manipulation, and system software is also highly concurrent, with shared-memory communication being the main concurrent programming paradigm. Available verification tools usually perform poorly when dealing with …

    ubc Repository record for Modular verification of shared-memory concurrent system software (opens in a new tab) Download PDF for Modular verification of shared-memory concurrent system software (opens in a new tab)

Page 1 of 2