<?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-22T14:19:14Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5283" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5283</identifier><datestamp>2017-03-21T17:03:13Z</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="c2a54a03-c94d-4834-8f18-8795bb9230ad" confidence="600">Rodriguez, Jonathan David</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-06-28T15:55:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-06-28T15:55:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-06-28T15:55:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5283</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">There has recently been a resurgence in interest in techniques for effective programming&#xd;
of multi-core computers. Most programmers find general-purpose concurrent programming to be&#xd;
extremely difficult. This difficulty severely limits the number of applications that&#xd;
currently benefit from multi-core computers.&#xd;
There already exist many concurrent solutions for the class of regular applications,&#xd;
which include various algorithms for linear algebra.&#xd;
For the class of irregular applications, which operate on dynamic and pointer- and graph-based&#xd;
structures, efficient concurrent solutions have so far remained elusive.&#xd;
Dataflow analysis applications, which are often found in compilers and&#xd;
program analysis tools, have received particularly little attention&#xd;
with regard to execution on multi-core machines.&#xd;
Operating on the theory that the Actor model, which structures computations&#xd;
as systems of asynchronously-communicating entities, is a more appropriate&#xd;
method for representing irregular algorithms than the shared-memory model,&#xd;
this work presents a concurrent Actor-based formulation of the IFDS,&#xd;
or Interprocedural Finite Distributive Subset, dataflow analysis algorithm.&#xd;
The implementation of this algorithm is done using the Scala language and its Actors&#xd;
library. This algorithm achieves significant speedup on multi-core machines without using&#xd;
any optimistic execution.&#xd;
This work contributes to Actor research by showing how the Actor model can be practically&#xd;
applied to a dataflow analysis problem.&#xd;
This work contributes to static analysis research by showing how a dataflow analysis&#xd;
algorithm can effectively make use of multi-core machines,&#xd;
allowing the possibility of faster and more precise analyses.</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">concurrency</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">static analysis</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">actors</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">irregular parallelism</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">actor model</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">dataflow analysis</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">IFDS</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">A Concurrent IFDS Dataflow Analysis Algorithm Using Actors</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="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>