automatically exploiting cross-invocation parallelism using runtime ...

More documents

Recommendations

Info

[15] R. Cytron. DOACROSS: Beyond vectorization for multiprocessors. In Proceedingsof the 11th International Conference on Parallel Processing (ICPP), 1986.[16] F. H. Dang, H. Yu, and L. Rauchwerger. The R-LRPD test: Speculative parallelizationof partially parallel loops. In Proceedings of the 16th International Parallel andDistributed Processing Symposium (IPDPS), 2002.[17] C. Demartini, R. Iosif, and R. Sisto. A deadlock detection tool for concurrent Javaprograms. Software: Practice and Experience, volume 29, pages 577–603, 1999.[18] W. R. Dieter and J. E. Lumpp Jr. A user-level checkpointing library for posix threadsprograms.In Proceedings of the 29th annual international symposium on Fault-Tolerant Computing (FTCS), 1999.[19] C. Ding, X. Shen, K. Kelsey, C. Tice, R. Huang, and C. Zhang. Software behaviororiented parallelization. In Proceedings of the 28th ACM SIGPLAN conference onProgramming Language Design and Implementation (PLDI), 2007.[20] A. J. Dorta, C. Rodriguez, F. de Sande, and A. Gonzalez-Escribano. The OpenMPsource code repository. In Proceedings of the 13th Euromicro conference on Parallel,Distributed and Network-Based Processing (PDP), 2005.[21] P. A. Emrath and D. A. Padua. Automatic detection of nondeterminacy in parallelprograms. In Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop onParallel and Distributed Debugging, 1988.[22] R. Ferrer, A. Duran, X. Martorell, and E. Ayguadé. Unrolling loops containing taskparallelism. In Proceedings of the 21st workshop on Languages and Compilers forParallel Computing (LCPC), 2009.[23] T. C. Grosser. Enabling polyhedral optimizations in llvm. Diploma thesis, Departmentof Informatics and Mathematics, University of Passau, Germany, April 2011.98
[24] R. Gupta. The fuzzy barrier: a mechanism for high speed synchronization of processors.In Proceedings of the 3rd international conference on Architectural Support forProgramming Languages and Operating Systems (ASPLOS), 1989.[25] L. Hammond, V. Wong, M. Chen, B. D. Carlstrom, J. D. Davis, B. Hertzberg, M. K.Prabhu, H. Wijaya, C. Kozyrakis, and K. Olukotun. Transactional memory coherenceand consistency. In Proceedings of the 31st annual International Symposium onComputer Architecture (ISCA), 2004.[26] H. Han and C.-W. Tseng. Improving compiler and run-time support for irregularreductions using local writes. In Proceedings of the 11th international workshop onLanguages and Compilers for Parallel Computing (LCPC), 1999.[27] M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lockfreedata structures. In Proceedings of the 20th annual International Symposium onComputer Architecture (ISCA), 1993.[28] J. Huang, T. B. Jablin, S. R. Beard, N. P. Johnson, and D. I. August. Automaticallyexploiting cross-invocation parallelism using runtime information. In Proceedingsof the 2013 International Symposium on Code Generation and Optimization, April2013.[29] J. Huang, A. Raman, Y. Zhang, T. B. Jablin, T.-H. Hung, and D. I. August. DecoupledSoftware Pipelining Creates Parallelization Opportunities. In Proceedings of the 8thinternational symposium on Code Generation and Optimization (CGO), 2010.[30] K. Z. Ibrahim and G. T. Byrd. On the exploitation of value predication and produceridentification to reduce barrier synchronization time. In Proceedings of the 15th InternationalParallel & Distributed Processing Symposium (IPDPS), 2001.99
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 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 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 ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?