notes = "p1 Chapter 1 Introduction This thesis is about the
aggressive optimization of high-performance code. We
describe a non-traditional approach to the problem and
focus on application domains where every choice of
instruction and register matters. The key result of
this work is that the high volume application of small
random transformations is sufficient for producing very
highly optimized code sequences that are capable of
outperforming both the code produced by production
compilers, and in many cases expert hand-written
assembly.
p2 'in Chapter 2 where we reformulate the competing
constraints of correctness and performance improvement
as terms in a cost function defined over the space of
all code sequences, and re-characterise the
optimization task as a cost minimization
problem.'
Supervisor: Alexander Aiken",