automatically exploiting cross-invocation parallelism using runtime ...
automatically exploiting cross-invocation parallelism using runtime ... automatically exploiting cross-invocation parallelism using runtime ...
unnecessary overhead at runtime.Table 2.1 summarizes the related work. All existing cross-invocation parallelizationtechniques are either limited by the conservative nature of static analysis or require programmers’effort to achieve parallelization. This motives this thesis work to propose novelautomatic parallelization techniques which bridge the gap in the existing solution space.22
Technique Name Synchronization Speculative Runtime Software AutomaticInserted System Used OnlyStaticallyExploiting Intra-Invocation ParallelizationDOALL [1] None × None ̌ ̌DOANY [55, 75] Lock × None ̌ ̌DOACROSS [15] Thread-wise Syncs × None ̌ ̌DSWP [51] Produce and Consume × None ̌ ̌IE [53, 60, 65] None × Shadow Array ̌ ̌LRPD [62] None ̌ Shadow Array ̌ ̌STMLite [42] None ̌ STM ̌ ̌SMTX [58] None ̌ SMTX ̌ ×Exploiting Cross-Invocation ParallelizationFerrero et al. [22] None × None ̌ ̌Tseng [72] None × None ̌ ̌TCC [25] None ̌ Hardware TM × ×BOP [19] None ̌ Software TM ̌ ×DOMORE (this thesis work) None × Shadow Array ̌ ̌SPECCROSS (this thesis work) None ̌ Software Speculative Barrier ̌ ̌Table 2.1: Compared to related work, DOMORE and SPECCROSS improve the performance by automatically exploiting cross-invocationparallelism. Both take advantage of runtime information to synchronize threads only when necessary. And neither requires any specialhardware support.23
- 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 8 and 9: ContentsAbstract . . . . . . . . .
- 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 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
unnecessary overhead at <strong>runtime</strong>.Table 2.1 summarizes the related work. All existing <strong>cross</strong>-<strong>invocation</strong> parallelizationtechniques are either limited by the conservative nature of static analysis or require programmers’effort to achieve parallelization. This motives this thesis work to propose novelautomatic parallelization techniques which bridge the gap in the existing solution space.22
Change language