Parallel domain decomposition and load balancing using space-filling curves
暂无分享,去创建一个
[1] David M. Mark,et al. A Comparative Analysis of some 2-Dimensional Orderings , 1990, Int. J. Geogr. Inf. Sci..
[2] Scott B. Baden,et al. Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves , 1996, IEEE Trans. Parallel Distributed Syst..
[3] Sanjay Ranka,et al. Parallel remapping algorithms for adaptive problems , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.
[4] Srinivas Aluru,et al. Truly distribution-independent algorithms for the N-body problem , 1994, Proceedings of Supercomputing '94.
[5] D. Hilbert. Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .
[6] James C. Browne,et al. Distributed Dynamic Data-Structures for Parallel Adaptive Mesh-Refinement , 1995 .
[7] H. V. Jagadish,et al. Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.
[8] Desh Ranjan,et al. Space-Filling Curves and Their Use in the Design of Geometric Data Structures , 1997, Theor. Comput. Sci..
[9] H. V. Jagadish,et al. Analysis of the Hilbert Curve for Representing Two-Dimensional Space , 1997, Inf. Process. Lett..
[10] Michael S. Warren,et al. A parallel hashed oct-tree N-body algorithm , 1993, Supercomputing '93. Proceedings.
[11] Sanjay Ranka,et al. Partitioning and incremental partitioning for adaptive irregular problems , 1996 .
[12] Christos Faloutsos,et al. Gray Codes for Partial Match and Range Queries , 1988, IEEE Trans. Software Eng..