http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Compiler integration of speculative run time parallelization techniques
viii, 61 leaves : illustrations ; 28 cm.
(sure) overhead that, will have to be paid. This work
access patterns. As parallelizable loops arise
Benchmark suites which substantiate our claim that.
between a speculated potential benefit and a certain
Current parallelizing compilers cannot. identify a raphics.
currently available compiler methods which will reduce
dependence test, to determine if it had any cross-
for ('heir identification: speculatively execute the
frequently in practice, we advocate a novel framework
implementation of a compiling system that employs run-
irregular, dynamic applications. We will show that
iteration dependently; if the test fails, then the
loop as a doall, and apply a fully parallel data
loop is re-executed serially. In this thesis we will
outcome of speculation in favor of significant
performance gains. We present experimental results on
present the principles of the design and
run-time optimizations always represent a tradeoff
significant fraction of parallelizable loops because
techniques to automatically parallelize and optimize
that, can produce performance gains. More specifically
the cost of run-time optimization, thus tilting the
these techniques can yield significant speedups not
they have complex or statically insufficiently defined
this optimization technique and a guiding strategy
time techniques in tandem with classic static
tries to establish and model the competing factors of
we will present techniques that, take advantage of
Includes bibliographical references: pages 56-60.