Compiler integration of speculative run time parallelization techniques /
(sure) overhead that, will have to be paid. This work
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1998.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | (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 loops from the PERFECT, SPEC and XCSA' obtainable by any other known method. 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 |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | viii, 61 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references: pages 56-60. |