A unifying data structure for hierarchical methods

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A unifying data structure for hierarchical methods

Full text

Pdf (89 KB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) table of contents

Portland, Oregon, United States

Article No. 24

Year of Publication: 1999

ISBN:1-58113-091-0

Authors

Faith E. Sevilgen	School of EECS, Syracuse University, Syracuse, NY
Srinivas Aluru	Dept. of ECPE, Iowa State University, Ames, IA

Sponsors

IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 15, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/331532.331556 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Srinivas Aluru , John Gustafson , G. M. Prabhu , Fatih E. Sevilgen, Distribution-Independent Hierarchical Algorithmsfor the N-body Problem, The Journal of Supercomputing, v.12 n.4, p.303-323, October 1998 [doi>10.1023/A:1008047806690]
	2	T. Belytschko, Y. Krongauz, D. Organ, M. Fleming, and P. Krysl, "Meshless methods: An overview and recent developments, Computer Methods in Applied Mechanics and Engineering 139, (1996) 3-47.
	3	J. Barnes and P. Hut, A hierarchical O.... N log N force-calculation algorithm, Nature, 324 (1986) 446-449.
	4	Jon Louis Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, v.18 n.9, p.509-517, Sept. 1975 [doi>10.1145/361002.361007]
	5	Paul B. Callahan , S. Rao Kosaraju, A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields, Journal of the ACM (JACM), v.42 n.1, p.67-90, Jan. 1995 [doi>10.1145/200836.200853]
	6	K. L. Clarkson, Fast algorithms for the all nearest neighbors problem, Proc. Foundations of Computer Science (1983) 226-232.
	7	Marios D. Dikaiakos , Joachim Stadel, A performance study of cosmological simulations on message-passing and shared-memory multiprocessors, Proceedings of the 10th international conference on Supercomputing, p.94-101, May 25-28, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237578.237590]
	8	Greg Eisenhauer , Karsten Schwan, Design and analysis of a parallel molecular dynamics application, Journal of Parallel and Distributed Computing, v.35 n.1, p.76-90, May 25, 1996 [doi>10.1006/jpdc.1996.0070]
	9	L. Greengard, The rapid evaluation of potential fields in particle systems, MIT Press, Cambridge, MA, 1988.
	10	L. Hernquist and N. Katz, TREESPH: A unification of SPH with the hierarchical tree method, The Astrophysical journal. Supplement series, 70 (1989) 419.
	11	Larry D. Libersky , Albert G. Petschek , Theodore C. Carney , Jim R. Hipp , Firooz A. Allahdadi, High strain Lagrangian hydrodynamics: a three-dimensional SPH code for dynamic material response, Journal of Computational Physics, v.109 n.1, p.67-75, Nov. 1993 [doi>10.1006/jcph.1993.1199]
	12	Henry Joel Neeman , Michael Heath , Michael Norman, Autonomous hierarchical adaptive mesh refinement for multiscale simulations, 1996
	13	M. Parashar and J.C. Browne, Distributed dynamic data-structures for parallel adaptive mesh-refinement, Proc. International Conference for High Performance Computing (1995) 22-27.
	14	Manish Parashar , James C. Browne , Carter Edwards , Kenneth Klimkowski, A common data management infrastructure for adaptive algorithms for PDE solutions, Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM), p.1-22, November 15-21, 1997, San Jose, CA [doi>10.1145/509593.509649]
	15	Steve Plimpton , Steve Attaway , Bruce Hendrickson , Jeff Swegle , Courtenay Vanghan, Parallel transient dynamics simulations, Journal of Parallel and Distributed Computing, v.50 n.1-2, p.104-122, April 1998 [doi>10.1006/jpdc.1998.1433]
	16	Hanan Samet, The design and analysis of spatial data structures, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	17	Hanan Samet, Applications of spatial data structures: Computer graphics, image processing, and GIS, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	18	Valerie E. Taylor , Rick L. Stevens , Kathryn E. Arnold, Parallel molecular dynamics: implications for massively parallel machines, Journal of Parallel and Distributed Computing, v.45 n.2, p.166-175, Sept. 15, 1997 [doi>10.1006/jpdc.1997.1370]
	19	P. M. Vaidya, An O(n log n) algorithm for the all-nearest-neighbors problem, Discrete & Computational Geometry, v.4 n.2, p.101-115, Jan. 1989 [doi>10.1007/BF02187718]
	20	M. S. Warren , J. K. Salmon, A parallel hashed Oct-Tree N-body algorithm, Proceedings of the 1993 ACM/IEEE conference on Supercomputing, p.12-21, December 1993, Portland, Oregon, United States [doi>10.1145/169627.169640]