Self-avoiding walks over adaptive unstructured grids

Concurrency Practice and Experience

Volumn 12, Issue 2, 2000, Pages 85-109

  Heber, Gerd ^a   Biswas, Rupak ^b   Gao, Guang R ^c  

^a Cornell University ^*  (United States)

^b NASA AMES RESEARCH CENTER   (United States)

^c UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONCURRENCY CONTROL; LINEARIZATION;

ADAPTIVE UNSTRUCTURED GRIDS; SELF-AVOIDING WALKS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033689713     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3<85::AID-CPE471>3.0.CO;2-8     Document Type: Article

References (32)

1. Petaflops Algorithms Workshop. Summary Report, Williamsburg, VA, 1997.
2. Szabo B, Babuška I. Finite Element Analysis. John Wiley: New York, 1991.
3. Benantar M, Dogrusoz U, Flaherty JE, Krishnamoorthy MS. Triangle graphs. Appl. Numer. Math. 1995; 17(2):85-96.
4. Dogrusoz U, Krishnamoorthy MS. Hamiltonian Cycle problem for triangle graphs. CS Tech. Rep. TR 95-7, Rensselaer Polytechnic Institute, Troy, NY, 1995.
5. Griebel M, Zumbusch G. Hash-storage techniques for adaptive multilevel solvers and their domain decomposition parallelization. AMS Contemp. Math. Ser. 1998; 218:279-286.
6. Liu X, Schrack G. Encoding and decoding the Hilbert order. Software - Pract. Exp. 1996; 26(12):1335-1346.
7. Ou C-W, Gunwani M, Ranka S. Architecture-independent locality-improving transformations of computational graphs embedded in k-dimensions. 9th Intl. Conf. on Supercomputing, 1995; 289-298.
8. Ou C-W, Ranka S, Fox G. Fast and parallel mapping algorithms for irregular problems. J. Supercomputing 1995; 10(2):119-140.
9. Parashar M, Browne JC. On partitioning dynamic adaptive grid hierarchies. 29th Hawaii Intl. Conf. on System Sciences, 1996; 604-613.
10. Pilkington JR, Baden SB. Dynamic partitioning of non-uniform structured workloads with space-filling curves. IEEE Trans. on Parallel and Distributed Systems 1996; 7(3):288-300.
11. Salmon J, Warren MS. Parallel, out-of-core methods for fast evaluation of long-range interactions. 8th SIAM Conf. on Parallel Processing for Scientific Computing, 1997.
12. Salmon J, Warren MS, Winckelmans GS. Fast parallel tree codes for gravitational and fluid dynamical N-body problems. Int. J. Supercomput. Appl. 1994; 8(2):129-142.
13. Gerlach J, Heber G. Fundamentals of natural indexing for simplex finite elements in two and three dimensions. RWCP Tech. Rep. TR 97-008, Tsukuba Research Center, Tsukuba-shi, Japan, 1997.
14. Glaser LC. Geometrical Combinatorial Topology I & II. Van Nordstrand Reinhold Company: New York, 1970.
15. Reidemeister K. Topologie der Polyeder und kombinatorische Topologie der Komplexe. Akademische Verlagsgesellschaft M.B.H: Leipzig, Germany, 1938.
16. Seifert H, Threlfall W. A Textbook of Topology. Academic Press: New York, 1980.
17. Binder K, Heermann DW. Monte Carlo Simulation in Statistical Physics. Springer-Verlag: Berlin, 1997.
18. Hammersley JM, Handscomb DC. Monte Carlo Methods. Methuen & Co Ltd.: London, 1964.
19. http://www.sgi.com/Technology/STL/.
20. Shewchuk JR. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. Applied Computational Geometry: Towards Geometric Engineering, LNCS 1148. Springer-Verlag, 1996; 203-222.
21. Chew LP, Chrisochoides N, Sukup F. Parallel constrained Delaunay meshing. ASME/ASCE/SES Summer Mtg: Special Symp. on Trends in Unstructured Mesh Generation, 1997.
22. Biswas R, Strawn RC. A new procedure for dynamic adaption of three-dimensional unstructured grids. Appl. Numer. Math. 1994; 13(6):437-452.
23. Biswas R, Strawn RC. Mesh quality control for multiply-refined tetrahedral grids. Appl. Numer. Math. 1996; 20(4):337-348.
24. Burgess DA, Giles MB. Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines. Adv. in Eng. Softw. 1997; 28:189-201.
25. Löhner R. Some useful renumbering strategies for unstructured grids. Int. J. for Numer. Meth. in Eng. 1993; 36:3259-3270.
26. Toledo S. Improving instruction-level parallelism in sparse matrix-vector multiplication using reordering, blocking, and prefetching. 8th SIAM Conf. on Parallel Processing for Scientific Computing, 1997.
27. Gerlach J, Sato M, Ishikawa Y. Janus - a C++ template library for parallel dynamic mesh applications. Computing in Object-Oriented Parallel Environments, LNCS 1505. Springer-Verlag, 1998; 215-222.
28. Gerlach J. Application of natural indexing to adaptive multilevel methods for linear triangular elements. RWCP Tech. Rep. TR 97-010, Tsukuba Research Center, Tsukuba-shi, Japan, 1997.
29. Sagan H. Space-Filling Curves. Springer Verlag: Heidelberg, 1994.
30. Cuthill E, McKee J. Reducing the bandwidth of sparse symmetric matrices. ACM Natl. Conf., 1969; 157-172.
31. Milnor J. Morse Theory, Annals of Mathematics Studies 51. Princeton University Press: Princeton, 1963.
32. Heber G, Biswas R, Gao GR. A new approach to parallel dynamic partitioning for adaptive unstructured meshes. 13th Intl. Parallel Processing Symp., 1999; 360-364.