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 6 of 6 for “"dynamic 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
-
SUDS : automatic parallelization for raw processors
… speculative, 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 …
-
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 …
-
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 …
-
Architecture design and performance analysis of practical buffered-crossbar packet switches
… under admissible traffic. However, the amount of memory required in the crossbar of an N x N switch is N^2x k x L, where k is the crosspoint buffer size and needs to be of size RTT in cells, L is the packet size. RTT is the round-trip time which is defined by the distance between line cards and …