Browse Dissertations and Theses - Computer Science by Title

• (2013-08-22)
Synchronization takes an important role in multi-threaded programs. Due to the non-deterministic nature of concurrency, it is always difficult for developers to make synchronizations correct. As a consequence, concurrent ...
PDF (1MB)
• (1991)
This thesis introduces a parallel computer architecture known as task flow. Simple replicated cells contain both memory packets and processing logic. Each memory packet contains a data field, the next instruction, and a ...
PDF (7MB)
• (1996)
High-level synthesis becomes increasingly important in the area of VLSI CAD. This thesis addresses scheduling and allocation in high-level synthesis. Specifically, we study the problem of register allocation in the presence ...
PDF (3MB)
• (2012-05-22)
PDF (170KB)
• (2009-01)
Networked Tablet PCs have great potential for improving the learning environment in classrooms. By increasing the capacity for communication among participants, they can raise student engagement in, and teacher awareness ...
PDF (23MB)
• (2009-12-02)
Performance analysis tools are essential to the maintenance of efficient parallel execution of scientific applications. As scientific applications are executed on larger and larger parallel supercomputers, it is clear that ...
PDF (6MB)
• (2010-01-06)
Performance analysis tools are essential to the maintenance of efficient parallel execution of scientific applications. As scientific applications are executed on larger and larger parallel supercomputers, it is clear ...
PDF (6MB)
• (2013-08-22)
Multicore machines have become pervasive and, as a result, parallel programming has received renewed interest. Unfortunately, writing correct parallel programs is notoriously hard. One challenging problem is how to ship ...
PDF (2MB)
• (1996)
Rewriting is a computational process in which one term is derived from another by replacing a subterm with another subterm in accordance with a set of rules. If such a set of rules (rewrite system) has the property that ...
PDF (5MB)
• (2007-07)
As robots interact with the physical world, their usefulness depends directly on how effectively they can sense and move through their environments. Unfortunately, sensors provide only limited (and sometimes incorrect) ...
PDF (2MB)
• (2013-05-24)
This thesis studies the techniques of tiling optimizations for stencil programs. Traditionally, research on tiling optimizations mainly focuses on tessellating tiling, atomic tiles and regular tile shapes. This thesis ...
PDF (2MB)
• (2010-05-18)
Data races are a common type of concurrency bug in parallel programs. An important type of race that has not received much attention is Asymmetric data races. In these races, the state of well tested, correct threads is ...
PDF (951KB)
• (2013-02-03)
In many hard real-time avionics systems, more and more features are being added to faster but cheaper hardware. Thus, hardware resources such as computation and network bandwidth are increasingly being shared by multiple ...
PDF (4MB)
• (2012-02-06)
Building an automated refactoring tool for a new programming language is an expensive and time-consuming process. Usually, only a small fraction of the tool's code is devoted to refactoring transformations; most of the ...
PDF (2MB)
• (2012-02-01)
Recent advancement in research and technology on virtual environments has significantly escalated users' expectations on this matter. This trend is easily witnessed, for example, by websites like twitter or facebook. ...
PDF (6MB)
• (1995)
This thesis consists of two parts dealing with combinatorial and computational problems in geometry, respectively. In the first part three independent problems are considered: (1) We determine an upper bound $\lfloor ... PDF (6MB) • (1989) This thesis studies several topics in theoretical computer science. First, the author shows that$5n-4\$ is a tight lower bound on the number of edges in the visibility graph of n non-intersecting line segments in the plane.
PDF (6MB)
• (1989)
In this dissertation we investigate three topics. The first is a structural parameter for partially ordered sets (posets). The parameter that we study is the interval number of a poset, denoted by i(P) for a poset P. The ...
PDF (5MB)
• (1990)
The distribution-independent model of concept learning from examples ("PAC-learning") due to Valiant is investigated. It has previously been shown that the existence of an Occam algorithm for a class of concepts is a ...
PDF (7MB)
• (1994)
Simplicial complexes are useful for modeling shape of a discrete geometric domain and for discretizing continuous domains. A geometric triangulation of a point set S is a simplicial complex whose vertex set is contained ...
PDF (4MB)