<?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-22T18:33:06Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/6481" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/6481</identifier><datestamp>2017-03-21T18:49:39Z</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="author" authority="c1df324b-1cb4-4c71-9df7-45a87cc26d8d" confidence="600">Sheikh, Muhammad Bilal</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-01-20T15:21:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-01-20T15:21:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2012-01-20T15:21:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2012-01-18</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/6481</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Distributed and parallel applications not only have distributed state but are often&#xd;
inherently non-deterministic, making them significantly more challenging to monitor and&#xd;
debug. Additionally, a significant challenge when working with distributed and parallel&#xd;
applications has to do with the fundamental requirement of determining the order in which&#xd;
certain actions are performed by the application. A naive approach for ordering actions&#xd;
would be to impose a single order on all actions, i.e., given any two actions or events, one&#xd;
must happen before the other. A global order, however, is often misleading, e.g., two events&#xd;
in two different processes may be causally independent yet one may have occurred before&#xd;
the other. A partial order of events, therefore, serves as the fundamental data structure&#xd;
for ordering events in distributed and parallel applications.&#xd;
Traditionally, Fidge/Mattern timestamps have been used for representing event partial&#xd;
orders. The size of the vector timestamp depends on the number of parallel entities (traces)&#xd;
in the application, e.g., processes or threads. A major limitation of Fidge/Mattern time-&#xd;
stamps is that the total size of timestamps does not scale for large systems with hundreds&#xd;
or thousands of traces. Taylor proposed an efficient offset-based scheme for representing&#xd;
large event partial orders by representing deltas between timestamps of successive events.&#xd;
The offset-based schemes have been shown to be significantly more space efficient when&#xd;
traces that communicate the most are close to each other for generating the deltas (offsets).&#xd;
In Taylor’s offset-based schemes the optimal order of traces is computed offline. In this&#xd;
work we adapt the offset-based schemes to dynamically reorder traces and demonstrate&#xd;
that very efficient scalable representations of event partial orders can be generated in an&#xd;
online setting, requiring as few as 100 bytes/event for storing partial order event data for&#xd;
applications with around 1000 processes.</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="title" lang="en">Online Trace Reordering for Efficient Representation of Event Partial Orders</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</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>