Now showing items 1-4 of 4
Programming models for speculative and optimistic parallelism based on algorithmic properties
(Georgia Institute of Technology, 2011-08-24)
Today's hardware is becoming more and more parallel. While embarrassingly parallel codes, such as high-performance computing ones, can readily take advantage of this increased number of cores, most other types of code ...
Some approximation algorithms for multi-agent systems
(Georgia Institute of Technology, 2011-08-29)
This thesis makes a number of contributions to the theory of approximation algorithm design for multi-agent systems. In particular, we focus on two research directions. The first direction is to generalize the classical ...
Dynamic program analysis algorithms to assist parallelization
(Georgia Institute of Technology, 2012-08-24)
All market-leading processor vendors have started to pursue multicore processors as an alternative to high-frequency single-core processors for better energy and power efficiency. This transition to multicore processors ...
Turing machine algorithms and studies in quasi-randomness
(Georgia Institute of Technology, 2011-11-09)
Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely used in eliminating/reducing the randomness from randomized ...