automatically exploiting cross-invocation parallelism using runtime ...

More documents

Recommendations

Info

in particular. Their professionalism really makes this such a great place to study and todo research. I especially thank Melissa Lawson who, as the highly effective GraduateCoordinator, makes all the bureaucracy so simple and allows us to completely focus on ourstudies. I also thank Bob Dondero for teaching me how to be a good TA and lecturer. Hispatience with students and passion in teaching left a deep impression on me.My studies at Princeton have been financially supported by grants from National ScienceFoundation, Gigascale Systems Research Center, DARPA and SPARCHS and graduatefellowships from Princeton University. I also thank Google for the opportunity to do aSummer internship, which provided me not only great industrial experience, but also fundsto survive the graduate student life.There are a lot of friends I met over the years. I thank all of them for making my lifein Princeton happy and unforgettable. I thank Zhiwei Yang for picking me up at the airportwhen I first came to the US and driving me around for furniture and grocery shopping.Jieqi Yu and Yi Li, being my roommates for many years, helped a lot with the cooking andcleaning especially when I had crazy schedules due to paper deadlines. I also would liketo thank Xiaobai Chen for being a patient listener whenever I had trouble in research orpersonal life. And Ke Wan, I thank him for risking his life to teach me how to drive. He isthe most patient coach I’ve ever seen.I want to thank my parents for their unconditional love and support. Unlike most parentsin Shanghai, They let me, their only child, explore the world in the way I want. I know theywould very much prefer to having me around, but instead, they encouraged me to studyabroad for so many years and to pursue the dreams I have. I cannot imagine how muchthey sacrificed to allow me to achieve what I have today. Everything I achieved today, istruly theirs.Last, but not the least, I want to thank my fiancé Hâkon Ringberg, for making mehappy and strong. We met each other in Princeton Computer Science Department whenhe himself was still a graduate student. Throughout the years, he offered me priceless tipsii
about how to survive the graduate school. His support and encourage helped me overcomedifficulties and move forward. I also thank him for introducing me to his two families. Ithank his American guardian parents, Bruce and Beverly Shriver for inviting me to theirhome and treating me with lots of delicious food. I thank his Norwegian parents, ToreLarsen and Unni Ringberg for inviting me to their home in Norway. My trips to Tromsøwere fantastic. For the first time in my life, I experienced 24-hour daylight and 24-hournight. I would very much love to invite all of them to my Chinese home and show themaround the land I love.iii
Page 1 and 2: AUTOMATICALLY EXPLOITINGCROSS-INVOC
Page 4 and 5: techniques. Among twenty programs f
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?