automatically exploiting cross-invocation parallelism using runtime ...

More documents

Recommendations

Info

ContentsAbstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .iiiivii1 Introduction 11.1 Limitations of Existing Approaches . . . . . . . . . . . . . . . . . . . . . 21.2 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81.3 Dissertation Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . 102 Background 112.1 Limitations of Analysis-based Approaches in Automatic Parallelization . . 112.2 Intra-Invocation Parallelization . . . . . . . . . . . . . . . . . . . . . . . . 132.3 Cross-Invocation Parallelization . . . . . . . . . . . . . . . . . . . . . . . 203 Non-Speculatively Exploiting Cross-Invocation Parallelism Using Runtime Information243.1 Motivation and Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . 253.2 Runtime Synchronization . . . . . . . . . . . . . . . . . . . . . . . . . . . 283.2.1 Detecting Dependences . . . . . . . . . . . . . . . . . . . . . . . . 283.2.2 Generating Synchronization Conditions . . . . . . . . . . . . . . . 293.2.3 Synchronizing Iterations . . . . . . . . . . . . . . . . . . . . . . . 303.2.4 Walkthrough Example . . . . . . . . . . . . . . . . . . . . . . . . 30iv
3.3 Compiler Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . 343.3.1 Partitioning Scheduler and Worker . . . . . . . . . . . . . . . . . . 343.3.2 Generating Scheduler and Worker Functions . . . . . . . . . . . . 353.3.3 Scheduling Iterations . . . . . . . . . . . . . . . . . . . . . . . . . 393.3.4 Generating the computeAddr function . . . . . . . . . . . . . . . . 403.3.5 Putting It Together . . . . . . . . . . . . . . . . . . . . . . . . . . 413.4 Enable DOMORE in SPECCROSS . . . . . . . . . . . . . . . . . . . . . . 433.5 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 463.5.1 Cross-invocation Parallelization . . . . . . . . . . . . . . . . . . . 463.5.2 Synchronization Optimizations . . . . . . . . . . . . . . . . . . . . 463.5.3 Runtime Dependence Analysis . . . . . . . . . . . . . . . . . . . . 474 Speculatively Exploiting Cross-Invocation Parallelism 494.1 Motivation and Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . 514.1.1 Limitations of analysis-based parallelization . . . . . . . . . . . . . 514.1.2 Speculative cross-invocation parallelization . . . . . . . . . . . . . 524.1.3 Automatic cross-invocation parallelization with software-only speculativebarrier . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554.2 SPECCROSS Runtime System . . . . . . . . . . . . . . . . . . . . . . . . 604.2.1 Misspeculation Detection . . . . . . . . . . . . . . . . . . . . . . . 604.2.2 Checkpointing and Recovery . . . . . . . . . . . . . . . . . . . . . 634.2.3 Runtime Interface . . . . . . . . . . . . . . . . . . . . . . . . . . . 654.3 SPECCROSS Parallelizing Compiler . . . . . . . . . . . . . . . . . . . . . 694.4 SPECCROSS Profiling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 734.5 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 734.5.1 Barrier Removal Techniques . . . . . . . . . . . . . . . . . . . . . 734.5.2 Alternative Synchronizations . . . . . . . . . . . . . . . . . . . . . 744.5.3 Transactional Memory Supported Barrier-free Parallelization . . . . 74v
Page 1 and 2: AUTOMATICALLY EXPLOITINGCROSS-INVOC
Page 4 and 5: techniques. Among twenty programs f
Page 6 and 7: in particular. Their professionalis
Page 10 and 11: 4.5.4 Load Balancing Techniques . .
Page 12 and 13: 2.4 Sequential Loop Example for DOA
Page 14 and 15: 4.5 Overview of SPECCROSS: At compi
Page 16 and 17: 1.1 Limitations of Existing Approac
Page 18 and 19: advanced forms of parallelism (MPI,
Page 20 and 21: the graph stands for an iteration i
Page 22 and 23: 1.2 ContributionsFigure 1.5 demonst
Page 24 and 25: 1.3 Dissertation OrganizationChapte
Page 26 and 27: alias the array regular via inter-p
Page 28 and 29: 1 for (i = 0; i < M; i++){2 node =
Page 30 and 31: 1 cost = 0;2 node = list->head;3 Wh
Page 32 and 33: example which cannot benefit from e
Page 34 and 35: These techniques are referred to as
Page 36 and 37: unnecessary overhead at runtime.Tab
Page 38 and 39: Chapter 3Non-Speculatively Exploiti
Page 40 and 41: for a variety of reasons. For insta
Page 42 and 43: 12x11x10xDOMOREPthread Barrier9xLoo
Page 44 and 45: Algorithm 1: Pseudo-code for schedu
Page 46 and 47: Algorithm 2: Pseudo-code for worker
Page 48 and 49: 3.3 Compiler ImplementationThe DOMO
Page 50 and 51: to T i . DOMORE’s MTCG follows th
Page 52 and 53: Outer_Preheaderbr BB1ABB1A:ind1 = P
Page 54 and 55: Algorithm 3: Pseudo-code for genera
Page 56 and 57: Scheduler Function SchedulerSync Fu
Page 58 and 59:
SchedulerWorker1 Worker2Worker3Work
Page 60 and 61:
3.5 Related Work3.5.1 Cross-invocat
Page 62 and 63:
ations during the inspecting proces
Page 64 and 65:
for (t = 0; t < STEP; t++) {L1: for
Page 66 and 67:
sequential_func() {for (t = 0; t <
Page 68 and 69:
Workerthread 1Workerthread 2Workert
Page 70 and 71:
library provides efficient misspecu
Page 72 and 73:
Workerthread 1TimeFigure 4.6: Timin
Page 74 and 75:
4.2 SPECCROSS Runtime System4.2.1 M
Page 76 and 77:
takes up to 200MB memory space.To d
Page 78 and 79:
checkpoint, the child spawns new wo
Page 80 and 81:
Operation DescriptionFunctions for
Page 82 and 83:
Main thread:main() {init();create_t
Page 84 and 85:
implemented in the Liberty parallel
Page 86 and 87:
Algorithm 5: Pseudo-code for SPECCR
Page 88 and 89:
CROSS, since SPECCROSS can be appli
Page 90 and 91:
techniques.Synchronization via sche
Page 92 and 93:
Source Benchmark Function % of exec
Page 94 and 95:
applied to the outermost loop, gene
Page 96 and 97:
5.2 SPECCROSS Performance Evaluatio
Page 98 and 99:
and the number of checking requests
Page 100 and 101:
8x7xno misspec.with misspec.Geomean
Page 102 and 103:
This thesisPrevious workSpeedup (x)
Page 104 and 105:
Program Speedup6x5x4x3x2xLOCALWRITE
Page 106 and 107:
for DOMORE and SPECCROSS. Others (e
Page 108 and 109:
programs and it achieves a geomean
Page 110 and 111:
Bibliography[1] R. Allen and K. Ken
Page 112 and 113:
[15] R. Cytron. DOACROSS: Beyond ve
Page 114 and 115:
[31] T. B. Jablin, Y. Zhang, J. A.
Page 116 and 117:
[47] A. Nicolau, G. Li, A. V. Veide
Page 118 and 119:
[62] L. Rauchwerger and D. Padua. T
Page 120:
national conference on Parallel Arc
show all

automatically exploiting cross-invocation parallelism using runtime ...

Create successful ePaper yourself

Delete template?

Save as template?