Towards optimal locality in mesh-indexings

Discrete Applied Mathematics

Volumn 117, Issue 1-3, 2002, Pages 211-237

  Niedermeier, Rolf ^a   Reinhardt, Klaus ^a   Sanders, Peter ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Fractal; Hilbert curve; Locality preserving grid indexing; Locality preserving mesh indexing; Lower bound; Self similar curve; Space filling curve

Indexed keywords

EID: 84867965028     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00326-7     Document Type: Conference Paper

References (27)

1. J. Alber, Locality properties of discrete space-filling curves: results with relevance for computer science. Studienarbeit, Universität Tübingen, Wilhelm-Schickard-Institut für Informatik, July 1997 (in German). Available through http://www-fs.informatik.uni-tuebingen.de/alber/ publications.html.
2. J. Alber, and R. Niedermeier On Multi-Dimensional Hilbert property Theory Comput. Systems 33 2000 295 312
3. T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmayer Space-filling curves and their use in the design of geometric data structures Theoret. Comput. Sci. 181 1997 3 15 (Pubitemid 127451945)
4. E. Bugnion, T. Roos, R. Wattenhofer, P. Widmayer, Space filling curves versus random walks, In: M.v. Krefeld et al. (Eds.), Algorithmic Foundations of GIS, Lecture Notes in Computer Science, Vol. 1340, Springer, Berlin, 1997, pp. 199-211.
5. H. Buhrmann, T. Jiang, M. Li, P. Vitányi, New applications of the incompressibility method (extended abstract), in: Proceedings of the 26th International Conference on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, July 1999, pp. 220-229.
6. G. Chochia, M. Cole, Recursive 3D mesh indexing with improved locality, Technical Report, University of Edinburgh, 1997. Short version appeared in the Proceedings of HPCN'97, Lecture Notes in Computer Science, Vol. 1225, Springer, Berlin.
7. G. Chochia, M. Cole, T. Heywood, Implementing the hierarchical PRAM on the 2D mesh: analyses and experiments, in: Symposium on Parallel and Distributed Processing, IEEE Computer Science Press, Silver Spring, MD, October 1995, pp. 587-595.
8. A. Dingle, and I.H. Sudborough Efficient mappings of pyramid networks IEEE Trans. Parallel Distributed Systems 5 10 1994 1009 1017
9. C. Faloutsos, S. Roseman, Fractals for secondary key retrieval, Proceedings of the Eighth ACM Symposium on Principles of Database Systems, 1989, pp. 247-252.
10. C. Gotsman, and M. Lindenbaum On the metric properties of discrete space-filling curves IEEE Trans. Image Process. 5 5 1996 794 797 (Pubitemid 126777683)
11. D. Hilbert Über die stetige Abbildung einer Linie auf ein Flächenstück Math. Ann. 38 1891 459 460
12. H.V. Jagadish Linear clustering of objects with multiple attributes ACM SIGMOD Rec. 19 2 1990 332 342
13. H.V. Jagadish Analysis of the Hilbert curve for representing two-dimensional space Inform. Process. Lett. 62 1997 17 22 (Pubitemid 127403742)
14. M. Kaddoura, C.-W. Ou, and S. Ranka Partitioning unstructured computational graphs for nonuniform and adaptive environments IEEE Parallel Distributed Technol.: Systems Appl. 3 3 1995 63 69
15. C. Kaklamanis, and G. Persiano Branch-and-bound and backtrack search on mesh-connected arrays of processors Math. Systems Theory 27 1994 471 489
16. M. Kunde, R. Niedermeier, K. Reinhardt, and P. Rossmanith Optimal deterministic sorting and routing on grids and tori with diagonals Algorithmica 25 1999 438 458 (Pubitemid 129661935)
17. M. Kunde, R. Niedermeier, and P. Rossmanith Faster sorting and routing on grids with diagonals P. Enjalbert, E.W. Mayr, K.W. Wagner, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science Vol. 775 1994 Springer Berlin 225 236
18. U.v. Luxburg, Locality measures of Peano curves, Studienarbeit, Universität Tübingen, Wilhelm-Schickard-Institut für Informatik, July 1998 (in German).
19. R. Miller, and Q.F. Stout Mesh computer algorithms for computational geometry IEEE Trans. Comput. 38 3 1989 321 340
20. G. Mitchison, and R. Durbin Optimal numberings of an N× N array SIAM J. Algebra Discrete Methods 7 4 1986 571 582
21. R. Niedermeier, Towards realistic and simple models of parallel computation, Ph.D. Thesis, Universität Tübingen, July 1996.
22. R. Niedermeier, K. Reinhardt, P. Sanders, Towards optimal locality in mesh-indexings, Technical Report IB12/97, Fakultät für Informatik, Universität Karlsruhe, Federal Report of Germany, September 1997.
23. A. Pérez, S. Kamata, E. Kawaguchi, Peano scanning of arbitrary size images, International Conference on Pattern Recognition, 1992, pp. 565-568.
24. H. Sagan Space-Filling Curves 1994 Universitext, Springer Berlin
25. P. Sanders, T. Hansch, Efficient massively parallel quicksort, Proceedings of the Fourth International Symposium on Solving Irregularly Structured Problems in Parallel, Lecture Notes in Computer Science, Vol. 1253, Springer, Berlin, June 1997, pp. 13-24.
26. J.P. Singh, Parallel hierarchical N-body methods and their implications for multiprocessors, Ph.D. Thesis, Stanford University, 1993.
27. Q.F. Stout, Topological matching, Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 24-31.