<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T16:32:54Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/18329" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/18329</identifier><datestamp>2025-03-26T23:33:53Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Buhr, Peter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="79de50b6-c008-42af-90a1-cea5bbfea276" confidence="600">Zulfiqar, Mubeen</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-05-25T18:56:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-05-25T18:56:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-05-25</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2022-05-19</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/18329</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">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.&#xd;
A general-purpose dynamic-allocation algorithm cannot anticipate future allocation requests so its output is rarely optimal.&#xd;
However, memory allocators do take advantage of regularities in allocation patterns for typical programs to produce excellent results, both in time and space (similar to LRU paging).&#xd;
In general, allocators use a number of similar techniques, each optimizing specific allocation patterns.&#xd;
Nevertheless, memory allocators are a series of compromises, occasionally with some static or dynamic tuning parameters to optimize specific program-request patterns.&#xd;
&#xd;
The goal of this thesis is to build a low-latency memory allocator for both kernel and user multi-threaded systems, which is competitive with the best current memory allocators, while extending the feature set of existing and new allocator routines.&#xd;
A new llheap memory-allocator is created that achieves all of these goals, while maintaining and managing sticky allocation properties for zero-filled and aligned allocations without a performance loss.&#xd;
Hence, it becomes possible to use @realloc@ frequently as a safe operation, rather than just occasionally, because it preserves sticky properties when enlarging storage requests.&#xd;
Furthermore, the ability to query sticky properties and information allows programmers to write safer programs, as it is possible to dynamically match allocation styles from unknown library routines that return allocations.&#xd;
The C allocation API is also extended with @resize@, advanced @realloc@, @aalloc@, @amemalign@, and @cmemalign@ so programmers do not make mistakes writing theses useful allocation operations.&#xd;
llheap is embedded into the uC++ and C-for-all runtime systems, both of which have user-level threading.&#xd;
The ability to use C-for-all&amp;apos;s advanced type-system (and possibly C++&amp;apos;s too) to combine advanced memory operations into one allocation routine using named arguments shows how far the allocation API can be pushed, which increases safety and greatly simplifies programmer&amp;apos;s use of dynamic allocation.&#xd;
&#xd;
The llheap allocator also provides comprehensive statistics for all allocation operations, which are invaluable in understanding and debugging a program&amp;apos;s dynamic behaviour.&#xd;
No other memory allocator examined in the thesis provides such comprehensive statistics gathering.&#xd;
As well, llheap provides a debugging mode where allocations are checked with internal pre/post conditions and invariants. It is extremely useful, especially for students.&#xd;
While not as powerful as the @valgrind@ interpreter, a large number of allocations mistakes are detected.&#xd;
Finally, contention-free statistics gathering and debugging have a low enough cost to be used in production code.&#xd;
&#xd;
A micro-benchmark test-suite is started for comparing allocators, rather than relying on a suite of arbitrary programs. It has been an interesting challenge.&#xd;
These micro-benchmarks have adjustment knobs to simulate allocation patterns hard-coded into arbitrary test programs.&#xd;
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.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">memory allocation</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">dynamic memory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">benchmark</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">memory allocator</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">heap</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">malloc</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">High-Performance Concurrent Memory Allocation</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Buhr, Peter</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>