diff options
| author | Yann Herklotz <git@yannherklotz.com> | 2022-06-15 00:32:29 +0100 |
|---|---|---|
| committer | Yann Herklotz <git@yannherklotz.com> | 2022-06-15 00:32:43 +0100 |
| commit | cbeacc561da5f600b6058be7854cb428605f2cce (patch) | |
| tree | f38d884e0d726e65c0b325e7d533ee9e06d011d5 | |
| parent | b93723f5d4391333b6ed12cea8c3f49871976927 (diff) | |
| download | lsr22_fvhls-cbeacc561da5f600b6058be7854cb428605f2cce.tar.gz lsr22_fvhls-cbeacc561da5f600b6058be7854cb428605f2cce.zip | |
Add
| -rw-r--r-- | chapters/scheduling.tex | 3 | ||||
| -rw-r--r-- | lsr_refs.bib | 18 |
2 files changed, 19 insertions, 2 deletions
diff --git a/chapters/scheduling.tex b/chapters/scheduling.tex index 4b897ef..52a1a63 100644 --- a/chapters/scheduling.tex +++ b/chapters/scheduling.tex @@ -76,8 +76,7 @@ end, the key points of this paper are the following: \draw[->] (rtl) -- node[above,midway,align=center,font=\small] {basic block \\[-0.3em] creation} - node[below,yshift=-3mm,xshift=-0.75cm,anchor=west,fill=VenetianRed,minimum width=1.5cm] {} - node[below,yshift=-3mm,xshift=-0.75cm,anchor=west,fill=ForestGreen,minimum width=0.6cm] {} + node[below,yshift=-3mm,xshift=-0.75cm,anchor=west,fill=ForestGreen,minimum width=1.5cm] {} (rtlblock); \draw[->] (rtlblock) -- node[above,midway,font=\small] {scheduling} diff --git a/lsr_refs.bib b/lsr_refs.bib index 992410d..47d291e 100644 --- a/lsr_refs.bib +++ b/lsr_refs.bib @@ -66,6 +66,24 @@ year = {2012} } +@inproceedings{ball93_branc_predic_free, + keywords = {hyperblocks, static scheduling, scheduling}, + author = {Ball, Thomas and Larus, James R.}, + title = {Branch Prediction for Free}, + year = {1993}, + isbn = {0897915984}, + publisher = {Association for Computing Machinery}, + address = {New York, NY, USA}, + url = {https://doi.org/10.1145/155090.155119}, + doi = {10.1145/155090.155119}, + abstract = {Many compilers rely on branch prediction to improve program performance by identifying frequently executed regions and by aiding in scheduling instructions. Profile-based predictors require a time-consuming and inconvenient compile-profile-compile cycle in order to make predictions. We present a program-based branch predictor that performs well for a large and diverse set of programs written in C and Fortran. In addition to using natural loop analysis to predict branches that control the iteration of loops, we focus on heuristics for predicting non-loop branches, which dominate the dynamic branch count of many programs. The heuristics are simple and require little program analysis, yet they are effective in terms of coverage and miss rate. Although program-based prediction does not equal the accuracy of profile-based prediction, we believe it reaches a sufficiently high level to be useful. Additional type and semantic information available to a compiler would enhance our heuristics.}, + booktitle = {Proceedings of the ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation}, + pages = {300–313}, + numpages = {14}, + location = {Albuquerque, New Mexico, USA}, + series = {PLDI '93} +} + @article{banerjee14_verif_code_motion_techn_using_value_propag, author = {{Banerjee}, K. and {Karfa}, C. and {Sarkar}, D. and {Mandal}, C.}, doi = {10.1109/TCAD.2014.2314392}, |