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
|
<?xml version="1.0" encoding="ISO-8859-15"?>
<!DOCTYPE html
PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-15" />
<title>Old News</title>
</head>
<body>
<h1 align="center">Old News</h1>
<p><a href="index.html"><b>New News...</b></a></p>
<p><b>February 26, 2007:</b> The thorn <tt>LSUPETSc</tt>
implements a generic elliptic solver for Carpet's multi-patch
infrastructure, based
on <a
href="http://www-unix.mcs.anl.gov/petsc/petsc-as/">PETSc</a>.
It assumes touching (not overlapping) patches, and uses
inter-patch interface conditions very similar to those developed
by <a href="http://arxiv.org/abs/gr-qc/0510016">Harald
Pfeiffer</a>. <tt>LSUPETSc</tt> can solve "arbitrary" systems
of coupled, non-linear elliptic equations. It does not support
mesh refinement.</p>
<p><b>January 12, 2007:</b> In order to be able to restructure
some of Carpet's internals without disturbing ongoing production
simulations, we have created an <i>experimental version</i>.
The main goals of this experimental version are to improve its
performance on many (>100) processors and to re-arrange some
internal details to simplify future development. Few new
features are planned, but some of the changes may be
incompatible.</p>
<hr />
<p><b>December 15, 2006:</b>
The <a href="http://numrel.aei.mpg.de/">AEI</a> hosted a small
workshop to improve the performance of the AEI/LSU CCATIE code
for binary black hole simulations, which uses Carpet as AMR
driver. We examined especially the effect of various grid
structures on accuracy and speed and speeded up the wave
extraction routine. We were able to improve the overall
performance of the code by a factor of six for a certain
benchmark problem simulating a QC-0 configuration.</p>
<p><b>September 26, 2006:</b> We are preparing a new release of
Carpet. This will be Carpet version 3. Among other things, this
version makes it easier to use dynamic grid structures, shows
better scaling behaviour than version 2, and has better support
for multiple patches. A detailed list of changes
is <a href="version-3.html">here</a>. The
the <a href="get-carpet-darcs.html">downloading instructions</a>
for Carpet explain how to access this version.</p>
<p><b>February 26, 2006:</b> We have started to collect
a <a href="publications.html">list of publications and theses</a>
that use Carpet. Please tell us if you have written a publication
or a thesis using Carpet.</p>
<p><b>February 25,
2006:</b> <a href="http://www.aei.mpg.de/~cott/">Christian Ott</a>
has contributed code to Carpet, making the refined regions track
apparent horizon centroids, merging and un-merging refined regions
as necessary. (<a href="movies/bh2.gif">Movie</a>, animated gif,
730 kB.) After Burkhard Zink's mechanism
which <a href="http://arxiv.org/abs/gr-qc/0501080">tracks the
density maximum in a star</a>, this is the second implementation
of a production level adaptive mesh refinement criterion in
Carpet.</p>
<p><b>February 25, 2006:</b> The
official <a href="http://www.cactuscode.org/Benchmarks/">Cactus
benchmarks</a> now include benchmarks with Carpet. You can assess
Carpet's scaling and compare its performance on different machines
by generating graphs from the benchmark result database on these
pages.</p>
<hr />
<p><b>July 15, 2005:</b> We have now a page that links to <a
href="status-reports.html">all past montly status reports</a>.</p>
<p><b>June 6, 2005:</b> We have updated the <a
href="get-carpet-darcs.html">downloading instructions for
Carpet</a>.</p>
<p><b>June 6, 2005:</b> Version 1.0.3 of the pre-compiled darcs
binary is <a href="get-carpet-darcs.html">now available</a>.</p>
<p><b>April 13, 2005:</b> Thomas Radke has implemented a new
communication scheme in Carpet. Instead of sending many small
messages in an interleaved manner, Carpet now collects all
messages into an internal buffer and sends only one big message
with MPI. This circumvents certain problems with internal
limitations of MPICH, and it also improves the performance
greatly.</p>
<p><b>March 9, 2005:</b> We have started to move towards a new
stable version of Carpet.</p>
<hr />
<p><b>December 7, 2004:</b> Jonathan Thornburg is organising a <a
href="design-walkthrough.html">Carpet Design Walkthrough</a>,
which will take place December 13 to 15 at the AEI and will be
broadcast via the accessgrid and/or telephone.</p>
<p><b>Sepbember 18, 2004:</b> There is now a new repository for
the development version of Carpet. This repository is managed by
<a href="http://darcs.net/">darcs</a> instead of <a
href="http://www.nongnu.org/cvs/">CVS</a>. Darcs has a number of
advantages, such as being able to use it while offline, or keeping
some changes to yourself while developing. This development
version is <a href="get-carpet-darcs.html">publicly available</a>,
and we encourage you to <a
href="work-with-darcs.html">contribute</a>. Note that the stable
version of Carpet is still distributed via CVS.</p>
<p><b>August 24, 2004:</b> The version of Carpet in the CVS
repository is now stable. That means that this version will see
no substantial further development. One of its main goal is to
not change, so that parameter files continue to work unchanged
with identical results. We will continue to correct errors that
we find in this version of Carpet; however, if this would
necessitate major changes, and there is a work-around, then this
might not happen in the interest of stability.</p>
<p><b>July 31, 2004:</b> Carpet seems to have reached a point
where it is stable enough to be useful for at least some projects.
Consequently, people expressed the wish to have a version of
Carpet which is stable and sees no disrupting development. The
idea is to have two "branches" of Carpet: a stable version for
production use, and a development version which might not be as
stable. We plan to make the split in about three weeks. The
discussion about this is held on the mailing list; your input is
welcome.</p>
<p><b>April 7, 2004:</b> Up to now, all Carpet thorns have been
living in a single arrangement for Cactus. This caused problems,
because stable thorns, development thorns, and outdated thorns
were sitting next to each other, confusing newcomers. We have <a
href="get-carpet-darcs.html">moved the Carpet arrangement</a> to a
new repository and split it into four. Access to the old Carpet
arrangement has been disabled.</p>
<p><b>March 3, 2004:</b> We have recently had trouble with I/O
throuth the <a
href="http://vis.lbl.gov/~jshalf/FlexIO/">FlexIO</a>
library. We suspect that it might have a bug that causes HDF5
output to fail under certain, random conditions. We have written
a new thorn CarpetIOHDF5 which uses the <a
href="http://www.hdfgroup.org/HDF5/">HDF5</a> library directly,
while remaining compatible to the FlexIO file format. Please test
this thorn, and report any problems or incompatibilities you
find.</p>
<p>In <b>January 2004</b>, <a
href="http://www.tat.physik.uni-tuebingen.de/~kobras/">Daniel
Kobras</a> set up <a href="http://bugs.carpetcode.org/">Bugzilla
for Carpet</a>. <a href="http://www.bugzilla.org/">Bugzilla</a>
is a bug-tracking system that will, so we hope, help us remember
what is missing or broken in Carpet.</p>
<hr />
<p>In <b>October 2003</b>, Erik Schnetter, Scott H. Hawley, and
Ian Hawke published the preprint "Evolutions in 3D numerical
relativity using fixed mesh refinement" as <a
href="http://arXiv.org/abs/gr-qc/0310042">gr-qc/0310042</a>. Its
main point is to present tests of Carpet with the BSSN code (AEI's
spacetime evolution code), and to show that mesh refinement does
not introduce instabilities.</p>
<p>In <b>August 2003</b>, <a
href="http://www.carpetcode.org/">these web pages</a> were
created.</p>
<p><b>May 2003</b> has informally been termed <a
href="CarpetMonth/index.html">"Carpet month"</a>. In a flurry of
activity, bugs were fixed and some features added. The BSSN code
of the numerical relativity group at the <a
href="http://www.aei.mpg.de/">AEI</a> now works together with
Carpet.</p>
<hr />
<p>
<a href="http://www.xemacs.org/About/created.html"><img
src="cbxSmall.jpg" alt="Created with XEmacs!" height="36"
width="100" /></a>
<a href="http://www.anybrowser.org/campaign/"><img
src="logoab8.png" alt="Best Viewed With Any Browser" height="31"
width="88" /></a>
<a href="http://validator.w3.org/check?uri=referer"><img
src="valid-xhtml10.png" alt="Valid XHTML 1.0!" height="31"
width="88" /></a>
</p>
<address><a href="mailto:schnetter@cct.lsu.edu">Erik Schnetter</a></address>
<p>
<!-- Created: Tue Aug 12 12:12:08 CEST 2003 -->
<!-- hhmts start -->
Last modified: Sat Mar 01 2008
<!-- hhmts end -->
</p>
</body>
</html>
|
