References
Next: About this document
Up: A Common Computational Infrastructure
Previous: Conclusion and Future
References
- 1
-
M. S. Warren and J. K. Salmon,
``A Parallel Hashed Oct-Tree N-Body Algorithm'',
Proceedings of Supercomputing'93, Nov. 1993.
- 2
-
Scott B. Baden, Scott R. Kohn, Silvia M. Figueria, and Stephen J. Fink,
``The LPARX User's Guide v1.0'',
Technical report, Department of Computer Science and Engineering,
University of California, San Diego, La Jolla, CA 92093-0114 USA, Apr. 1994.
- 3
-
Jaroslaw Nieplocha, Robert J. Harrison, and Richard J. Littlefield,
``Global Arrays: A Protable ``Shared-Memory'' Programming Model for
Distributed Memory Computers'',
To be presented Supercomputing `94, Washington DC, Nov. 1994.
- 4
-
Max Lemke and Daniel Quinlan,
``P++, a C++ Virtual Shared Grids Based Programming Environment for
Architecture-Independent Development of Structured Grid Applications'',
Lecture Notes in Computer Science, Parallel Processing: CONPAR
92 - VAPP V, Springer Verlag, pp. 121-126, Sep. 1992,
Proceedings of the Second Joint International Conference on Vector
and Parallel Processing, Lyon, France.
- 5
-
Rebecca Parsons,
``A++/P++ Array Classes for Architecture Independent Finite
Difference Computations'',
OON-SKI'94 - The Object-Oriented Numerics Conference, Sunriver,
Oregon, pp. 408-418, Apr. 1994.
- 6
-
U. Geuder, M. Härdtner, B. Wörner, and R. Zink,
``The GRIDS Parallel Programming Model for Grid-Based Scientific
Applications'',
Proceedings of the Parallel Systems Fair,
International
Parallel Processing Symposium, Cancun, Mexico, Apr. 1994.
- 7
-
Hans Sagan,
Space Filling Curves,
Springer-Verlag, 1994.
- 8
-
H. Samet,
The Design and Analysis of Spacial Data Structures,
Addison Wesley, Reading, Mass., 1989.
- 9
-
H. Samet,
Applications of Special Data Structures,
Addison Wesley, Reading, Mass., 1990.
- 10
-
M. S. Warren and J. K. Salmon,
``A Parallel Hashed Oct-Tree N-Body Algorithm'',
in Supercomputing '93, Portland, Oregon, Nov. 1993.
- 11
-
John R. Pilkington and Scott B. Baden,
``Partitioning with Spacefilling Curves'',
CSE Technical Report CS94-349, Dept. of Computer Science and
Engineering, University of California, San Diego, CA, 1994.
- 12
-
H. F. Korth and A. Silberschatz,
Database System Concepts,
McGraw Hill, New York, 2 edition, 1991.
- 13
-
W. Litwin,
``Linear Hashing: a New Tool for File and Table Addressing'',
in Proceedings of the 6th Conference on VLDB, pp.
212-223, Montreal, Canada, 1980.
- 14
-
Marsha J. Berger and Joseph Oliger,
``Adaptive Mesh Refinement for Hyperbolic Partial Differential
Equations'',
Jounal of Computational Physics, pp. 484-512, 1984.
- 15
-
Manish Parashar and James C. Browne,
``Distributed Dynamic Data-Structures for Parallel Adaptive
Mesh-Refinement'',
Proceedings of the International Conference for High Performance
Computing, pp. 22-27, Dec. 1995.
- 16
-
Manish Parashar and James C. Browne,
``On Partitioning Dynamic Adaptive Grid Hierarchies'',
Proceedings of the
Annual Hawaii International
Conference on System Sciences, 1:604-613, Jan. 1996.
- 17
-
Hanan Samet,
The Design and Analysis of Spatial Data Structures,
Addison - Wesley Publishing Company, 1989.
- 18
-
J. Massó and C. Bona,
``Hyperbolic System for Numerical Relativity'',
Physics Review Letters, 68(1097), 1992.
- 19
-
Leslie Greengard,
The rapid evaluation of potential fields in particle systems.,
1987.
- 20
-
Jürgen K. Singer,
The Parallel Fast Multipole Method in Molecular Dynamics,
PhD thesis, The University of Houston, August 1995.
- 21
-
Jürgen K. Singer,
``Parallel Implementation of the Fast Multipole Method with Periodic
Boundary Conditions'',
East-West Journal on Numerical Mathematics, 3(3), October
1995.
Manish Parashar, parashar@cs.utexas.edu