automatically exploiting cross-invocation parallelism using runtime ...

More documents

Recommendations

Info

Bibliography[1] R. Allen and K. Kennedy. Optimizing compilers for modern architectures: Adependence-based approach. Morgan Kaufmann Publishers Inc., 2002.[2] S. P. Amarasinghe and M. S. Lam. Communication optimization and code generationfor distributed memory machines. In Proceedings of the 14th ACM SIGPLANconference on Programming Language Design and Implementation (PLDI), 1993.[3] M. M. Baskaran, N. Vydyanathan, U. K. R. Bondhugula, J. Ramanujam, A. Rountev,and P. Sadayappan. Compiler-assisted dynamic scheduling for effective parallelizationof loop nests on multicore processors. In Proceedings of the 14th ACM SIGPLANsymposium on Principles and Practice of Parallel Programming (PPoPP), 2009.[4] E. D. Berger, T. Yang, T. Liu, and G. Novark. Grace: safe multithreaded programmingfor C/C++. In Proceeding of the 24th ACM SIGPLAN conference on Object OrientedProgramming Systems Languages and Applications (OOPSLA), 2009.[5] M. J. Best, S. Mottishaw, C. Mustard, M. Roth, A. Fedorova, and A. Brownsword.Synchronization via scheduling: techniques for efficiently managing shared state. InProceedings of the 32nd ACM SIGPLAN conference on Programming Language Designand Implementation (PLDI), 2011.[6] C. Bienia, S. Kumar, J. P. Singh, and K. Li. The PARSEC benchmark suite: characterizationand architectural implications. In Proceedings of the 17th internationalconference on Parallel Architectures and Compilation Techniques (PACT), 2008.96
[7] B. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoeflinger, D. Padua, P. Petersen,B. Pottenger, L. Rauchwerger, P. Tu, and S. Weatherford. Polaris: The next generationin parallelizing compilers. In Proceedings of the 6th workshop on Languages andCompilers for Parallel Computing (LCPC), 1994.[8] R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, andY. Zhou. Cilk: An efficient multithreaded <strong>runtime</strong> system. In Proceedings of the5th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming(PPoPP), 1995.[9] D. R. Butenhof. Programming with POSIX threads. Addison-Wesley Longman PublishingCo., Inc., 1997.[10] S. Campanoni, T. Jones, G. Holloway, V. J. Reddi, G.-Y. Wei, and D. Brooks. Helix:automatic parallelization of irregular programs for chip multiprocessing. In Proceedingsof the 10th international symposium on Code Generation and Optimization(CGO), 2012.[11] C. D. Carothers and B. K. Szymanski. Checkpointing multithreaded programs. Dr.Dobbs, August 2002.[12] L. Ceze, J. Tuck, J. Torrellas, and C. Cascaval. Bulk disambiguation of speculativethreads in multiprocessors. In Proceedings of the 33rd annual International Symposiumon Computer Architecture (ISCA), 2006.[13] G. Cong, S. Kodali, S. Krishnamoorthy, D. Lea, V. Saraswat, and T. Wen. Solvinglarge, irregular graph problems <strong>using</strong> adaptive work-stealing. In Proceedings of the37th International Conference on Parallel Processing (ICPP), 2008.[14] J. C. Corbett. Evaluating deadlock detection methods for concurrent software. IEEETransactions on Software Engineering, volume 22, pages 161–180, 1996.97
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 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 ...

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

Delete template?

Save as template?