diff -r pario/web/bibtex/barve:mergesort.bib pario/web/new/barve:mergesort.bib
1c1
< @Article{barve:mergesort,
---
> @InProceedings{barve:mergesort,
4,32c4,10
<   journal = {Parallel Computing},
<   year = {1997},
<   volume = {23},
<   number = {4},
<   publisher = {North-Holland (Elsevier Scientific)},
<   note = {To appear},
<   keyword = {verify, parallel I/O algorithm, sorting, pario-bib},
<   abstract = {We consider the problem of sorting a file of N records on the
<   D-disk model of parallel I/O in which there are two sources of parallelism.
<   Records are transferred to and from disk concurrently in blocks of B
<   contiguous records. In each I/O operation, up to one block can be transferred
<   to or from each of the D disks in parallel. We propose a simple, efficient,
<   randomized mergesort algorithm called SRM that uses a forecast-and-flush
<   approach to overcome the inherent difficulties of simple merging on parallel
<   disks. SRM exhibits a limited use of randomization and also has a useful
<   deterministic version. Generalizing the technique of forecasting, our
<   algorithm is able to read in, at any time, the ``right'' block from any disk,
<   and using the technique of flushing, our algorithm evicts, without any I/O
<   overhead, just the ``right'' blocks from memory to make space for new ones to
<   be read in. The disk layout of SRM is such that it enjoys perfect write
<   parallelism, avoiding fundamental inefficiencies of previous mergesort
<   algorithms. By analysis of generalized maximum occupancy problems we are able
<   to derive an analytical upper bound on SRM's expected overhead valid for
<   arbitrary inputs. \par The upper bound derived on expected I/O performance of
<   SRM indicates that SRM is provably better than disk-striped mergesort (DSM)
<   for realistic parameter values D, M, and B. Average-case simulations show
<   further improvement on the analytical upper bound. Unlike previously proposed
<   optimal sorting algorithms, SRM outperforms DSM even when the number D of
<   parallel disks is small.}
---
>   year = {1996},
>   month = {June},
>   pages = {109--118},
>   publisher = {ACM Press},
>   address = {Padua, Italy},
>   later = {barve:jmergesort},
>   keyword = {parallel I/O algorithm, sorting, pario-bib}
diff -r pario/web/bibtex/chiang:graph.bib pario/web/new/chiang:graph.bib
6c6
<   (SODA '95)},
---
>   (SODA~'95)},
diff -r pario/web/bibtex/choudhary:sdcr.bib pario/web/new/choudhary:sdcr.bib
12c12,13
<   URL = {http://www.acm.org/surveys/1996/ChoudharyFile/},
---
>   URL =
>   {http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a207-choudhary/},
15c16
<   workshop at MIT in June 1996.}
---
>   workshop at MIT in June 1996. See gibson:sdcr.}
diff -r pario/web/bibtex/kotz:jdiskdir.bib pario/web/new/kotz:jdiskdir.bib
6a7,8
>   volume = {15},
>   number = {1},
diff -r pario/web/bibtex/matthews:hippi.bib pario/web/new/matthews:hippi.bib
22c22,27
<   for the SFS product.}
---
>   for the SFS product.},
>   comment = {They use hardware to tie the same storage device (a disk array) to
>   several computers (Cray C90s). They build a custom piece of hardware just to
>   service semaphore requests very fast. HIPPI is the interconnect. Details have
>   a lot to do with the synchronization between processors trying to update the
>   same metadata; that's why they use the semaphores.}
diff -r pario/web/bibtex/moon:declustering.bib pario/web/new/moon:declustering.bib
4a5
>   journal = {IEEE Transactions on Knowledge and Data Engineering},
diff -r pario/web/bibtex/vengroff:efficient.bib pario/web/new/vengroff:efficient.bib
11a12
>   later = {vengroff:efficient2},
13,17c14,19
<   comment = {Excellent paper. This paper does not describe TPIE itself very
<   much, but more about a set of benchmarks using TPIE. All of the benchmarks
<   are run on one disk and one processor. TPIE can use multiple disks and one
<   processor, with plans to extend it to multiple processors later. See
<   vengroff:tpie and vengroff:efficient-tr. Same as vengroff:efficient2?}
---
>   comment = {Shorter version of vengroff:efficient2. Excellent paper. This
>   paper does not describe TPIE itself very much, but more about a set of
>   benchmarks using TPIE. All of the benchmarks are run on one disk and one
>   processor. TPIE can use multiple disks and one processor, with plans to
>   extend it to multiple processors later. See vengroff:tpie and
>   vengroff:efficient-tr. Same as vengroff:efficient2?}
diff -r pario/web/bibtex/vengroff:efficient2.bib pario/web/new/vengroff:efficient2.bib
8a9,10
>   earlier = {vengroff:efficient},
>   URL = {ftp://cs.duke.edu/pub/jsv/Papers/VeV96.Scientific_TPIE.ps.gz},
11c13
<   comment = {Same as vengroff:efficient?}
---
>   comment = {Longer version of vengroff:efficient.}