automatically exploiting cross-invocation parallelism using runtime ...

More documents

Recommendations

Info

techniques. Among twenty programs from seven benchmark suites, DOMORE is automaticallyapplied to parallelize six of them and achieves a geomean speedup of 2.1× overcodes without cross-invocation parallelization and 3.2× over the original sequential performanceon 24 cores. SPECCROSS is found to be applicable to eight of the programs and itachieves a geomean speedup of 4.6× over the best sequential execution, which comparesfavorably to a 1.3× speedup obtained by parallel execution without any cross-invocationparallelization.iv
AcknowledgmentsFirst, I would like to thank my advisor David I. August for guiding me throughout myyears in graduate school. I appreciate the opportunities and challenges he gave me, whichmade this dissertation possible. David’s passion in research and his insightful vision onresearch direction inspired me to find the research topic I am really interested in. Duringthe years I worked in his research group, I learnt from him how to conduct research and towrite scientific papers. More importantly, I learnt from him never to give up and alwaysto pursue a bigger goal. I could not have made my way today without his encourage andsupport. I believe I will continue to benefit from the knowledge he taught me even after Igraduate.I would like to thank Prof. David Walker and Prof. Kai Li for reading this dissertationand providing insightful comments. I thank Kai also for his giving me advice and helpduring my first semester in Princeton when I was really stressed and frustrated by study,research and language problems. Additionally, I want to thank Prof. Jaswinder Singh andProf. Doug Clark for serving as my thesis committee member and their feedbacks thathelped me to polish and refine my thesis.This dissertation would not have existed without the help and support from everyonein the Liberty Research Group. I have found great friendship with everyone in the Libertyresearch group. I would like to thank some senior group members, Neil Vachharajani, MattBridges, and Guilherme Ottoni for their guide and help in my early years into my PhDstudy. I must also thank Thomas Jablin, who spent a lot of time helping me improve mylistening and spoken English at my early days in Princeton. I also want to thank PrakashPrabhu, Souymadeep Ghosh, Jae W. Lee, Stephen Beard, Matthew Zoufaly, Nick Johnsonand Yun Zhang for helping me with my research. Throughout the years, we engaged innumerous brainstormings, discussions and presentations. I will never forget the sleeplessnights we spent together before paper deadlines and the coffee and junk food we shared.I also thank the entire staff of Princeton, and of the Department of Computer Sciencei
Page 1 and 2: AUTOMATICALLY EXPLOITINGCROSS-INVOC
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 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?