/
cite.html
312 lines (285 loc) · 10.1 KB
/
cite.html
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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
<!doctype html>
<html lang="en">
<head>
<title>p4est Citations and Bibliography</title>
<meta name="author" content="Carsten Burstedde">
<link type="text/css" rel="stylesheet" href="p4est.css">
<link type="text/css" rel="stylesheet" href="added.css">
<!-- mathjax !-->
<script type="text/javascript"
src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
</head>
<body>
<header>
<h1><tt>p4est</tt> Citations and Bibliography</h1>
<nav>
<div class="nav-container">
<h2 class="nav-item"><a href="index.html" alt="p4est main page">Main</a></h2>
<h2 class="nav-item">
<a href="gallery.html" alt="p4est Gallery of Research Results">Gallery</a></h2>
<h2 class="nav-item-self">Cite</h2>
<h2 class="nav-item">
<a href="school.html" alt="p4est 2020 HCM Summer School">School</a></h2>
</div>
</nav>
</header>
<main>
<p>
The <tt>p4est</tt> software library enables the dynamic management of
a collection of adaptive octrees, conveniently called a forest of
octrees. <tt>p4est</tt> is designed to work in parallel and scales to
hundreds of thousands, even millions, of processor cores.
It is actively maintained and used by researchers worldwide.
</p>
<p>
<tt>p4est</tt> is free software released under the GNU General Public
Licence version 2.
</p>
<p>
A DOI:
<div align="center">
<a href="https://doi.org/10.5281/zenodo.10839051"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.10839051.svg" alt="DOI"></a>
</div>
is available for citations and as an immutable code reference.
Note however that the zipfile linked does <strong>not</strong> compile as is.
Please use our own tarballs instead at
<a href="https://github.com/p4est/p4est.github.io/tree/master/release/">github.io</a>,
or work directly with the source.
</p>
<div class="citation">
<h3>Technical papers / Citations</h3>
<!--
<p>
The original technical paper on <tt>p4est</tt> is
<a href="https://p4est.github.io/papers/BursteddeWilcoxGhattas11.pdf">paper1 available as pdf</a> [1a].
We have recently submitted a second technical paper to cover additional
API functions;
<a href="https://arxiv.org/abs/1406.0089">see here for paper2</a> [1b].
Recently, the 2:1 balance algorithm has been rewritten; see
<a href="https://p4est.github.io/papers/IsaacBursteddeGhattas12.pdf"
>this article</a> [1c] on the new logic.
</p>
//-->
<p>
If you use <tt>p4est</tt> for your publications, please cite it as follows [1a].
The reference [1b] is for people specifically using the topology iterator, the
high-order node numbering, or the top-down search.
[1c] is for people interested in the 2:1 balance details, the strong scaling
limit and/or memory footprint.
Recent algorithms for searching remote objects in the partition and
partition-independent load and save are in press [1d].
</p>
<p class="cite">
[1a]
Carsten Burstedde, Lucas C. Wilcox, and Omar Ghattas,<br>
<em>p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on
Forests of Octrees.</em><br>
Published in SIAM Journal on Scientific Computing 33 no. 3 (2011),
pages 1103-1133
(<a href="https://p4est.github.io/papers/BursteddeWilcoxGhattas11.pdf">download</a>).
</p>
<pre class="bibtex">
@ARTICLE{BursteddeWilcoxGhattas11,
author = {Carsten Burstedde and Lucas C. Wilcox and Omar Ghattas},
title = {{\texttt{p4est}}: Scalable Algorithms for Parallel Adaptive Mesh
Refinement on Forests of Octrees},
journal = {SIAM Journal on Scientific Computing},
volume = {33},
number = {3},
pages = {1103-1133},
year = {2011},
doi = {10.1137/100791634}
}
</pre>
<p class="cite">
[1b]
Tobin Isaac, Carsten Burstedde, Lucas C. Wilcox, and Omar Ghattas,<br>
<em>Recursive algorithms for distributed forests of octrees.</em><br>
Published in SIAM Journal on Scientific Computing 37 no. 5 (2015),
pages C497-C531
(<a href="https://p4est.github.io/papers/IsaacBursteddeWilcoxEtAl15.pdf">download</a>).
</p>
<pre class="bibtex">
@ARTICLE{IsaacBursteddeWilcoxEtAl15,
author = {Tobin Isaac and Carsten Burstedde and Lucas C. Wilcox and Omar Ghattas},
title = {Recursive algorithms for distributed forests of octrees},
journal = {SIAM Journal on Scientific Computing},
volume = {37},
number = {5},
pages = {C497-C531},
year = {2015},
doi = {10.1137/140970963}
}
</pre>
<p class="cite">
[1c]
Tobin Isaac, Carsten Burstedde, and Omar Ghattas,<br>
<em>Low-Cost Parallel Algorithms for 2:1 Octree Balance.</em><br>
Published in Proceedings of the 26th IEEE International Parallel &
Distributed Processing Symposium, 2012
(<a href="https://p4est.github.io/papers/IsaacBursteddeGhattas12.pdf">download</a>).
<em>Erratum:</em>
In Algorithm 7, line 3 reads
\(\text{for all}\ o\in R\ \text{do}\);
it should read
\(\text{for all}\ o\in R\cup R^{\text{new}}\ \text{do}\).
</p>
<p class="cite">
[1d]
Carsten Burstedde,<br>
<em>Parallel tree algorithms for AMR and non-standard data access.</em><br>
Published in ACM Transactions on Mathematical Software, 2020
(<a href="https://arxiv.org/abs/1803.08432">preprint</a>).
<!--
@MISC{Burstedde18,
journal = {ACM Transactions on Mathematical Software},
volume = 46,
issue = 4,
number = 32,
pages = {1-31},
doi = {10.1145/3401990}
author = {Carsten Burstedde},
title = {Parallel tree algorithms for {AMR} and non-standard data access},
year = {2018},
note = {https://arxiv.org/abs/1803.08432. Accepted for publication
in ACM Transactions on Mathematical Software}
}
//-->
</p>
<pre class="bibtex">
@article{Burstedde20,
author = {Carsten Burstedde},
title = {Parallel tree algorithms for {AMR} and non-standard data access},
year = {2020},
month = {November},
journal = {ACM Transactions on Mathematical Software},
volume = 46,
issue = 4,
number = 32,
pages = {1--31},
doi = {10.1145/3401990}
}
</pre>
</div>
<div class="citation">
<h3>ForestClaw</h3>
<p>
The <a href="http://www.forestclaw.org/">ForestClaw</a> project is an
ongoing collaboration with
<a href="https://math.boisestate.edu/~calhoun/www_personal/">Donna Calhoun</a>
to solve hyperpolic PDEs.
Please cite the initial article below; an updated paper is in preparation
with initial versions <a href="https://arxiv.org/abs/1703.03116">on the
arxiv</a>.
</p>
<pre class="bibtex">
@INPROCEEDINGS{BursteddeCalhounMandliEtAl14,
author = {Carsten Burstedde and Donna Calhoun
and Kyle T. Mandli and Andy R. Terrel},
title = {ForestClaw: Hybrid forest-of-octrees {AMR}
for hyperbolic conservation laws},
booktitle = {Parallel Computing: Accelerating Computational Science
and Engineering (CSE)},
year = {2014},
editor = {Michael Bader and Arndt Bode and Hans-Joachim Bungartz
and Michael Gerndt and Gerhard R. Joubert and Frans Peters},
volume = {25},
series = {Advances in Parallel Computing},
pages = {253-262},
publisher = {IOS Press},
doi = {10.3233/978-1-61499-381-0-253}
}
</pre>
</div>
<div class="citation">
<h3>deal.II</h3>
<p>
The generic adaptive finite element software <a
href="https://www.dealii.org/">deal.II</a> now interfaces to
<tt>p4est</tt> to obtain distributed mesh information [2]. The corresponding
algorithms are described in this <a
href="https://p4est.github.io/papers/BangerthBursteddeHeisterEtAl11.pdf"
>article</a>. If you use deal.II with <tt>p4est</tt> for your
publications, please cite it as:
</p>
<p class="cite">
[2]
Wolfgang Bangerth, Carsten Burstedde, Timo Heister, and Martin
Kronbichler,<br>
<em>Algorithms and Data Structures for Massively Parallel Generic
Adaptive Finite Element Codes.</em><br>
Published in ACM Transactions on Mathematical Software 38 No. 2 (2011),
pages 14:1-14:28
(<a href="https://p4est.github.io/papers/BangerthBursteddeHeisterEtAl11.pdf">download</a>).
</p>
<pre class="bibtex">
@ARTICLE{BangerthBursteddeHeisterEtAl11,
author = {Wolfgang Bangerth and Carsten Burstedde and Timo Heister and Martin
Kronbichler},
title = {Algorithms and Data Structures for Massively Parallel Generic Adaptive
Finite Element Codes},
journal = {ACM Transactions on Mathematical Software},
volume = {38},
number = {2},
pages = {14:1-14:28},
year = {2011}
}
</pre>
</div>
<div class="citation">
<h3>PETSc</h3>
<p>
The <tt>p4est</tt> library is being extended to implement AMR in <a
href="https://www.mcs.anl.gov/petsc/">PETSc</a>, the Portable Extensible
Toolkit for Scientific Computation. The interface and design decisions are
described in this <a href="https://arxiv.org/abs/1508.02470">article</a>. If
you use the <tt>p4est</tt> backend for <tt>PETSc</tt> for your publications,
please cite it as:
</p>
<p class="cite">
[3]
Tobin Isaac, Matthew G. Knepley,<br>
<em>Support for Non-conformal Meshes in PETSc's DMPlex Interface</em><br>
(<a href="https://arxiv.org/pdf/1508.02470">download</a>).
</p>
<pre class="bibtex">
@ARTICLE{IsaacKnepley15,
author = {Tobin Isaac and Matthew G. Knepley},
title = {Support for Non-conformal Meshes in {PETSc}'s {DMPlex} Interface},
journal = {ACM Transactions on Mathematical Software},
eprinttype = {arxiv},
eprint = {1508.02470},
url = {https://arxiv.org/abs/1508.02470}
}
</pre>
</div>
</main>
<footer>
<p>
The <tt>p4est</tt> authors:<br>
<a href="https://ins.uni-bonn.de/staff/burstedde">Carsten Burstedde</a><br>
<a href="https://lucaswilcox.com/">Lucas C. Wilcox</a><br>
<a href="https://www.cse.gatech.edu/people/12734/tobin-isaacs/">Tobin
Isaac</a><br>
Thanks to our contributors! Please see the
<a href="https://github.com/cburstedde/p4est/tree/master/AUTHORS">AUTHORS</a>
file for details.
</p>
<p class="citation">
The development of <tt>p4est</tt> was partially supported by the US National
Science Foundation (NSF Grants No. CCF-0427985, CMMI-1028889, CNS-0540372,
CNS-0619838, DMS-0724746, OCI-0749334, OPP-0941678) and the US Department of
Energy (DOE Grants No. 06ER25782, 08ER25860, SC0002710).
The authors thank the Texas
Advanced Computing Center (TACC) for providing them with access to the Ranger
supercomputer under NSF TeraGrid award MCA04N026, and the National Center for
Computational Science (NCCS) for early-user access to the Jaguar Cray XT5
supercomputer. Any opinions, findings and conclusions or recomendations
expressed on this web page or in the source code and documentation are those of
the authors and do not necessarily reflect the views of the National Science
Foundation (NSF).
</p>
</footer>
</body>
</html>