-
Notifications
You must be signed in to change notification settings - Fork 3
/
paper.bib
236 lines (216 loc) · 9.21 KB
/
paper.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
@book{afmh,
editor = {Meyer, Ulrich and Sanders, Peter and Sibeyn, Jop},
isbn = {3-540-00883-7},
location = {Berlin and Heidelberg},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
subtitle = {Advanced Lectures},
title = {Algorithms for Memory Hierarchies},
year = {2003},
}
@online{ithare-paadl,
author = {Ignatchenko, Sergey},
date = {2016-05-23},
title = {\cpp{} for Games: Performance, Allocations and Data Locality},
url = {http://ithare.com/c-for-games-performance-allocations-and-data-locality/},
urldate = {2017-05-11},
}
@online{ithare-wisdoms,
author = {Ignatchenko, Sergey},
date = {2016-05-30},
title = {\cpp{} Performance: Common Wisdoms and Common “Wisdoms”},
url = {http://ithare.com/c-performance-common-wisdoms-and-common-wisdoms/},
urldate = {2017-05-20},
}
% I used to have the `file` field as
% file = {https://accu.org/var/uploads/journals/Overload134.pdf#page=6},
% but this is intended to be a "local link" (see the biblatex manual). An alternative
% `url` could be <https://accu.org/index.php/journals/2268>.
@article{bigos,
author = {Ignatchenko, Sergey},
date = {2016-08},
issn = {1354--3172},
journal = {Overload},
note = {Big-O notation is often used to compare algorithms. Sergey Ignatchenko
reminds us that asymptotic limits might not be generally applicable.},
number = {134},
pages = {4--7},
publisher = {ACCU},
title = {Some Big-Os are Bigger Than Others},
url = {https://accu.org/var/uploads/journals/Overload134.pdf#page=6},
urldate = {2017-05-11},
}
@online{ithare-bigos,
author = {Ignatchenko, Sergey},
date = {2017-02-21},
title = {Some Big-Os are Bigger Than Others},
url = {http://ithare.com/some-big-os-are-bigger-than-others/},
urldate = {2017-05-11},
}
@online{ithare-cycles,
author = {Ignatchenko, Sergey},
date = {2016-09-12},
title = {Infographics: Operation Costs in CPU Clock Cycles},
url = {http://ithare.com/infographics-operation-costs-in-cpu-clock-cycles/},
urldate = {2017-05-19},
}
@online{gallery,
author = {Ostrovsky, Igor},
date = {2010-01-19},
title = {Gallery of Processor Cache Effects},
url = {https://igoro.com/archive/gallery-of-processor-cache-effects/},
urldate = {2017-05-15},
}
@online{zen,
organization = {AMD},
title = {The “Zen” Core Architecture},
url = {https://www.amd.com/en-gb/innovations/software-technologies/zen-cpu#Microarchitecture},
urldate = {2017-05-19},
}
% http://udrepper.livejournal.com/19557.html
% https://lwn.net/Articles/250967/
% https://en.wikipedia.org/wiki/LWN.net
% https://people.redhat.com/drepper/cpumemory.pdf
% https://www.akkadia.org/drepper/cpumemory.pdf
% https://scholar.google.com/scholar?cluster=12331297869318119122
% http://stackoverflow.com/q/8126311
% https://news.ycombinator.com/item?id=3919429
@booklet{drepper2007,
author = {Drepper, Ulrich},
date = {2007-11-21},
editor = {Corbet, Jonathan},
origdate = {2007-09-21/2007-11-14},
pagetotal = {114},
publisher = {LWN.net},
title = {What Every Programmer Should Know About Memory},
url = {https://people.redhat.com/drepper/cpumemory.pdf},
urldate = {2017-05-15},
version = {1.0},
% howpublished = {First published at LWN.net},
% howpublished = {Red Hat, Inc.},
}
% A version given slightly later is at <https://vimeo.com/97337258>. See
% <https://scholar.google.com/scholar?cluster=14059030639791738114> for lots of PDFs for
% the talk given on different occasions.
@unpublished{scott-meyers-talk,
author = {Meyers, Scott},
date = {2014-11-05},
file = {http://www.aristeia.com/TalkNotes/codedive-CPUCachesHandouts.pdf},
howpublished = {Talk given at the code::dive conference},
location = {Hala Stulecia, Wrocław, Poland},
note = {\url{http://codedive.pl/index/year2014}},
title = {CPU Caches and Why You Care},
url = {https://youtu.be/WDIkqP4JbkE},
urldate = {2017-05-13},
}
% https://en.wikipedia.org/wiki/Intel_Technology_Journal
% http://www.intel.com/content/www/us/en/research/intel-technology-journal/intel-technology-journal.html
% http://www.intel.com/content/www/us/en/research/intel-technology-journal/intel-technology-journal-archive.html
% http://www.intel.com/content/www/us/en/research/intel-technology-journal/2001-volume-05-issue-01-intel-technology-journal.html
% http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2991
%
% See <https://tex.stackexchange.com/q/354759> for a discussion of biblatex's `number` and
% `issue` entry fiels.
@article{pentium4,
author = {Glenn Hinton and Dave Sager and Mike Upton and Darrell Boggs and Doug
Carmean and Alan Kyker and Patrice Roussel},
date = {2001},
issue = {Q1},
journal = {Intel Technology Journal},
number = {1},
title = {The Microarchitecture of the Pentium\textsuperscript{®} 4 Processor},
url = {http://www.ecs.umass.edu/ece/koren/ece568/papers/Pentium4.pdf},
urldate = {2017-05-13},
volume = {5},
}
@manual{14h,
date = {2012-02-17},
organization = {AMD},
pagetotal = {470},
title = {BIOS and Kernel Developer’s Guide (BKDG) for AMD Family 14h Models
00h-0Fh Processors},
url = {https://support.amd.com/TechDocs/43170_14h_Mod_00h-0Fh_BKDG.pdf},
version = {3.13},
}
% https://google.com/search?q=intel+skylake+architecture
@manual{skylake,
date = {2016-06},
organization = {Intel},
pagetotal = {672},
title = {Intel\textsuperscript{®} 64 and IA-32 Architectures Optimization
Reference Manual},
url = {https://www.intel.com/content/dam/www/public/us/en/documents/manuals/64-ia-32-architectures-optimization-manual.pdf},
}
@software{oprofile,
author = {Levon, John and Elie, Philippe and Johnson, Maynard and Cohen, Will and
Suthikulpanit, Suravee and Deacon, Will and Allard, Gilles and Hansel,
Daniel and Richter, Robert},
date = {2015-08-03},
title = {OProfile},
type = {software},
url = {http://oprofile.sourceforge.net},
version = {1.1.0},
}
% Based on the BibTeX entry in <http://erikdemaine.org/papers/edemaine.bib>.
@incollection{erikcom,
address = {BRICS, University of Aarhus, Denmark},
author = {Erik D. Demaine},
booktitle = {Lecture Notes from the EEF Summer School on Massive Data Sets},
bookurl = {http://www.brics.dk/MassiveData02/},
date = {2002-06-27/2002-07-01},
pagetotal = {29},
title = {Cache-Oblivious Algorithms and Data Structures},
url = {http://erikdemaine.org/papers/BRICS2002/},
urldate = {2017-06-16},
}
% Based on the BibTeX entry from <http://ieeexplore.ieee.org/abstract/document/814600>.
% The PDF is at <http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=814600> and also at
% <http://supertech.csail.mit.edu/papers/FrigoLePr99.pdf> Lastly, see
% <https://scholar.google.com/scholar?q=Cache-Oblivious+Algorithms>.
@inproceedings{coa-paper,
author = {Matteo Frigo and Charles E. Leiserson and Harald Prokop and Sridhar
Ramachandran},
booktitle = {40th Annual Symposium on Foundations of Computer Science},
date = {1999-10-17/1999-10-19},
doi = {10.1109/SFFCS.1999.814600},
issn = {0272--5428},
organization = {IEEE},
pages = {285--297},
title = {Cache-Oblivious Algorithms},
}
% [This][1] appears to be an earlier version of `coa-paper`. It's referenced in the MA
% thesis about cache-oblivious algorithms (with a date of May 1999). I found it
% [here][2].
% [1]: https://pdfs.semanticscholar.org/19ed/9795adc7204d3c9745b3c9f71f8496d26bb6.pdf
% [2]: https://www.semanticscholar.org/paper/Cache-Oblivious-and-Cache-Aware-Algorithms-Dagstuh-Arge-Bender/75eb40a2e19b9d1050be7abbdbbbd983a1215cdc
@unpublished{coa-for-publication,
author = {Matteo Frigo and Charles E. Leiserson and Harald Prokop and Sridhar
Ramachandran},
date = {1999-05},
pagetotal = {15},
subtitle = {Extended abstract submitted for publication},
title = {Cache-Oblivious Algorithms},
}
% See <https://scholar.google.com/scholar?q=Cache-Oblivious+Algorithms>.
@thesis{coa-thesis,
author = {Prokop, Harald},
date = {1999-06},
school = {Massachusetts Institute of Technology},
title = {Cache-Oblivious Algorithms},
type = {mathesis},
url = {http://supertech.csail.mit.edu/papers/Prokop99.pdf},
urldate = {2017-06-16},
}
% https://channel9.msdn.com/Events/GoingNative/GoingNative-2012
@misc{stroustrup-talk,
author = {Stroustrup, Bjarne},
date = {2012-02-02},
% howpublished = {Talk given at the GoingNative 2012 conference},
location = {Redmond, WA, USA},
organization = {Microsoft},
title = {\cpp{}11 Style},
type = {Talk given at the GoingNative 2012 conference},
url = {https://channel9.msdn.com/Events/GoingNative/GoingNative-2012/Keynote-Bjarne-Stroustrup-Cpp11-Style},
urldate = {2017-06-19},
}
vim: tw=90 sts=-1 sw=3 et