Bibliography

1

David E. Culler and Jaswinder Pal Singh with Anoop Gupta.
Parallel Computer Architecture: a Hardware/Software Approach.
Morgan Kaufmann Pub., 1999.

2

Kai Hwang.
Advanced Computer Architecture: Parallelism, Scaability, Programmability.
McGraw-Hill, 1993.

3

Leslie G. Valiant.
A bridging model for parallel computation.
Communications of the ACM, 33(8):103-111, August 1990.

4

A. Grama, V. Kumar, S. Ranka, and V. Singh.
Architecture independent analysis of parallel programs.
In Alexandrov et al. [27], pages 599-608.

5

P. De La Torre and C. P. Kruskal.
Submachine locality in the bulk synchronous setting.
volume 1124 of Lecture Notes in Computer Science, pages 352-360, 1996.

6

Martin Beran.
Decomposable bulk synchronous parallel computers.
In Proceedings of SOFSEM'99, volume 1725 of Lecture Notes in Computer Science, pages 349-359.

7

G. Bilardi, C. Fantozzi, A. Pietracaprina, and G.Pucci.
On the effectiveness of D-BSP as a bridging model of parallel computation.
In Alexandrov et al. [27], pages 579-588.

8

F. Meyer auf der Heide and Rolf Wanka.
Parallel bridging models and their impact on algorithm design.
In Alexandrov et al. [27], pages 628-637.

9

Jop F. Sybein and M. Kaufmann.
Bsp-like external memory computation.
In Proc. 3rd Italian Conference on Algorithms and Complexity, volume 1203 of Lecture Notes in Computer Science, pages 229-240, 1997.

10

Frank Dehne, Wolfgang Dittrich, and David Hutchinson.
Efficient external memory algorithms by simulating coarse-grained parallel algorithms.
In SPAA '97, pages 106-115, 1997.

11

Jeffrey Scott Vitter.
External Memory Algorithms and Data Structures: Dealing with MASSIVE DATA.
ACM Computing Surveys, 33(2):209-271, June 2001.

12

Alok Aggarwal and C. Greg Plaxton.
Optimal parallel sorting in multi-level storage.
In Proc. Fifth Annual ACM-SIAM Symp. on Discrete Algorithms, pages 659-668, 1994.

13

Frank Dehne, Stefano Mardegan, Andrea Pietracaprina, and Giuseppe Prencipe.
Distribution sweeping on clustered machines with hierarchical memories.
In Proc. of 2002 IPDPS Conference.
To appear.

14

Lars Arge, Rakesh Barve, David Hutchinson, Octavian Procopinc, Laura Toma, Darren Erik Vengroff, and Rajiv Wickeremesinghe.
TPIE User Manual and Reference, 0.9.01b edition, November 1999.
Draft.

15

S. Näher and K. Mehlhorn.
LEDA: A platform for combinatorial and geometric computing.
Communications of the ACM, 1995.

16

Andreas Crauser and Kurt Mehlhorn.
LEDA-SM, A Platform for Secondary Menmory Computation.
Max-Planck-Institut für Informatik, Saarbrücken, Germany, March 1999.

17

Thomas H. Cormen and Melissa Hirschl.
Early Experiences in Evaluating the Parallel Disk Model with the ViC* Implementation.
Technical Report PCS-TR96-293, Dartmouth College, Computer Science, Hanover, NH, September 1996.

18

Lauren M. Baptist and Thomas H. Cormen.
Multidimensional, multiprocessor, out-of-core ffts with distributed memory and parallel storage.
In 11th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 242-250, June 1999.

19

Olaf Bonorden, Nicolas Hüppelshäuser, Ben Juurlink, and Ingo Rieping.
PUB-library, release 7.0 user guide and function reference.
Technical Report Tr-rsfb-00-070, Heinz-Nixdorf Inst., Dept. of Computer Science, Univ. of Paderborn.

20

Rajeev Thakur, William Gropp, and Edwing Lusk.
A case for using mpi's derived datatypes to improve i/o performance.
In Proc. of SC98: High Performance Networking and Computing. IEEE, November 1998.

21

Rajeev Thakur, William Gropp, and Edwing Lusk.
On implementing mpi-io portably and with high performance.
In Proc. of the 6th Workshop on I/O in Parallel and Distributed Systems, pages 23-32. ACM, May 1999.

22

Jonathan Ilroy, Cyrille Randriamano, and Gil Utard.
Improving mpi-i/o performance on pvfs.
In R. Sakellariou et al., editors, Euro-Par 2001: Parallel Processing, volume 2150 of Lecture Notes in Computer Science, pages 911-915, 2001.

23

D. A. Bader and J. JáJá.
SIMPLE: A methodology for programming high performance algorithms on clusters of symmetric multiprocessors (smps).
Journal of Parallel and Distributed Computing, 58(1):92-108, 1999.

24

Geoffrey M. Voelker, Eric J. Anderson, Tracy Kimbrel, Michael J. Feeley, Jeffrey S. Chase, Anna R. Karlin, and Henry M. Levy.
Implementing cooperative prefetching and caching in a globally-managed memory system.
In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, pages 33-43. ACM Press, June 1998.

25

R. Hugo Patterson, Garth A. Gibson, Eka Ginting, Daniel Stodolsky, and Jim Zelenka.
Informed prefetching and caching.
In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, pages 79-95, Copper Mountain, CO, December 1995. ACM Press.

26

Fay Chang and Garth A. Gibson.
Automatic I/O hint generation through speculative execution.
In OSDI: 3rd Symposium on Operating Systems Design and Implementation. USENIX Association, Co-sponsored by IEEE TCOS and ACM SIGOPS, February 1999.

27

V. N. Alexandrov et al., editors.
ICCS 2001, volume 2074 of Lecture Notes in Computer Science, 2001.