diff -r pario/web/bibtex/cormen:fft-tr.bib pario/web/new/cormen:fft-tr.bib
12,24c12,24
<   problems can be entirely solved entirely in main memory, some important
<   classes of applications require out-of-core techniques. For these, use of
<   parallel I/O systems can improve performance considerably. This paper shows
<   how to perform one-dimensional FFTs using a parallel disk system with
<   independent disk accesses. We present both analytical and experimental
<   results for performing out-of-core FFTs in two ways: using traditional
<   virtual memory with demand paging, and using a provably asymptotically
<   optimal algorithm for the Parallel Disk Model (PDM) of Vitter and Shriver.
<   When run on a DEC 2100 server with a large memory and eight parallel disks,
<   the optimal algorithm for the PDM runs up to 144.7 times faster than in-core
<   methods under demand paging. Moreover, even including I/O costs, the
<   normalized times for the optimal PDM algorithm are competitive, or better
<   than, those for in-core methods even when they run entirely in memory.}
---
>   problems can be solved entirely in main memory, some important classes of
>   applications require out-of-core techniques. For these, use of parallel I/O
>   systems can improve performance considerably. This paper shows how to perform
>   one-dimensional FFTs using a parallel disk system with independent disk
>   accesses. We present both analytical and experimental results for performing
>   out-of-core FFTs in two ways: using traditional virtual memory with demand
>   paging, and using a provably asymptotically optimal algorithm for the
>   Parallel Disk Model (PDM) of Vitter and Shriver. When run on a DEC 2100
>   server with a large memory and eight parallel disks, the optimal algorithm
>   for the PDM runs up to 144.7 times faster than in-core methods under demand
>   paging. Moreover, even including I/O costs, the normalized times for the
>   optimal PDM algorithm are competitive, or better than, those for in-core
>   methods even when they run entirely in memory.}
diff -r pario/web/bibtex/cormen:fft.bib pario/web/new/cormen:fft.bib
10c10,11
<   computing, FFT, pario-bib}
---
>   computing, FFT, pario-bib},
>   comment = {see also cormen:fft2 and cormen:fft3}
diff -r pario/web/bibtex/cormen:fft2-tr.bib pario/web/new/cormen:fft2-tr.bib
25c25
<   comment = {Extends the work of cormen:fft.}
---
>   comment = {Extends the work of cormen:fft. See also cormen:fft3.}
diff -r pario/web/bibtex/kandaswamy:hartree.bib pario/web/new/kandaswamy:hartree.bib
31c31,32
<   this application. We obtained up to 95\% improvement in I/O time and 43\  improvement in the overall application performance with these optimizations.}
---
>   this application. We obtained up to 95\% improvement in I/O time and 43\%
>   improvement in the overall application performance with these optimizations.}
diff -r pario/web/bibtex/nieuwejaar:jgalley-tr.bib pario/web/new/nieuwejaar:jgalley-tr.bib
8d7
<   note = {To appear in {\em Parallel Computing}.},