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 24 for “"memory allocation"”.
-
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 …
-
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
-
Memory Allocation for Embedded Systems with a Compile-Time-Unknown Scratch-Pad Size
This paper presents the first memory allocation scheme for embedded systems having a scratch-pad memory(SPM) whose size is unknown at compile-time. All existing memory allocation schemes for SPM require the SPM size to be known at compile-time; therefore tie the resulting executable to that size of …
-
Integer overflow discovery using goal-directed conditional branch enforcement
… generating inputs that trigger overflows at memory allocation sites. DIODE is designed to identify relevant sanity checks that inputs must satisfy to trigger overflows at target memory allocation sites, then generate inputs that satisfy these sanity checks to successfully trigger the …
-
Hardware Memory Compression for Large-scale Systems
Memory has become an increasingly costly resource for both users and service providers, while also contributing significantly to global energy consumption and environmental impact. Memory compression offers a promising solution to mitigate these costs, as memory values exhibit an average …
-
Electrostatic simulations of interactions between a scanning probe and quantum Hall liquid
… systems, but also optimize running times and memory allocation we developed two electrostatic simulators one for cylindrically symmetric and second for arbitrary 3D geometries. Our electrostatic solver was based on successive over relaxation algorithm, but it was optimized for better stability …
-
Redesigning the memory hierarchy for memory-safe programming languages
We present Hotpads, a new memory hierarchy designed from the ground up for modern, memory-safe languages like Java, Go, and Rust. Memory-safe languages hide the memory layout from the programmer. This prevents memory corruption bugs, improves programmability, and enables automatic memory …
-
Security and performance analysis of custom memory allocators
Computer programmers use custom memory allocators as an alternative to built-in or general-purpose memory allocators with the intent to improve performance and minimize human error. However, it is difficult to achieve both memory safety and performance gains on custom memory allocators. In this …
-
Region-based Program Specialization
… languages by combining techniques from dynamic memory management with program specialization. Our approach is based on the region calculus of Tofte and Talpin, a polymorphically typed lambda calculus with annotations that make memory allocation and deallocation explicit. The formal correctness …
-
Randomized Data Structures: New Perspectives and Hidden Surprises
… structures; and answer a 20-year-old question on memory allocation that was left as the central open problem in the first paper on history independence.
-
A Hybrid Soft Soil Tire Model (HSSTM) For Vehicle Mobility And Deterministic Performance Analysis In Terramechanics Applications
… of the code, different techniques were used in memory allocation, parameter initialization, code sequence, and multi-processing. This has resulted in significant improvements in efficiency of the code that can now run close to real time and therefore it is suitable for use by commercially …
-
SUDS : automatic parallelization for raw processors
… in the sense that it may introduce dynamic memory allocation operations into code that would not otherwise dynamically allocate memory. Thus, SUDS also includes a transactional runtime system that periodically checkpoints machine state, executes code speculatively, checks if the speculative …
-
Characterization of containers in emerging applications: Microservices, FAAS and GPUS
… overheads at function granularity. The virtual memory management aspects of Docker containers are also characterized with a focus on container infrastructure, page tables and page faults. This thesis reports on average 59.86% duplicated page table entries and 35.7% duplicated page faults across …
-
Software-defined Significance-Driven Computing
… it to operate seamlessly on top of unreliable memory and provide a<br/>user-space interface for memory allocation from the unreliable portion of the physical memory. Having this framework in place<br/>allowed us to identify what we call the refresh-by-access property of applications that use …
-
Split array and scalar data cache: A comprehensive study of data cache organization.
… movement of data among the levels of the memory hierarchy and increases in miss ratio. In this dissertation I propose a split data cache architecture that will group memory accesses as scalar or array references according to their inherent locality and will subsequently map each group to a …
-
Top: An Infrastructure for detecting Application-Specific Program Errors by Binary Runtime Instrumentation
… System that can trace movement of pointers to memory locations or 32-bit data values and keeps track of all their copies. It also provides an Event Framework that reports the occurrence of events such as function calls or returns. Top provides a programming interface which allows querying for …
-
FDTD subgridding with higher order derivative approximations
… problem without the need for excessive large memory allocation. Subgridding allows for the problem space to be divided into fine grids around articles of interest and then coarse grids elsewhere. Further accuracy improvements can be achieved with a higher order FDTD method in the coarse grids. …
-
Compiler and runtime techniques for optimizing dynamic scripting languages
… interpreter level specialization to do object allocation removal and path length reduction, and evaluates its effectiveness for GNU R VM. The approach uses profiling to translate R byte-code into a specialized byte-code to improve running speed, and uses data representation specialization to …
-
dPool : a distributed data structure for factored operating systems
… and the possible lack of scalable shared memory motivate the reevaluation of operating system design. This thesis work takes place in the context of Factored Operating Systems which leverage distributed system ideas to increase the scalability of multicore processor operating systems. fos, …
Page 1 of 2