Skip to main content
Springer Nature Link
Log in

Distributed quadtree processing

  • Quadtrees
  • Conference paper
  • First Online:
Design and Implementation of Large Spatial Databases (SSD 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 409))

Included in the following conference series:

Abstract

Quadtrees have been widely used in computer vision, spatial database, and related area due to their compactness and regularity. It has long been claimed that quadtree related algorithms are suitable for parallel and distributed implementation, but only little work has been done to justify this claim. The simple input partitioning method used in low level image processing could not be equally applied to distributed quadtree processing since it suffers the problem of load imbalance. Load balancing is one of the most crucial issues in distributed processing. In the context of distributed quadtree processing, it appears at various stages of processing in different forms; each requires its own solutions. The diversity in approaches to load balancing is further multiplied by the differences in the characteristics of types of data represented by,and spatial operations performed on quadtrees. In this paper, we propose a new approach to distributed quadtree processing using a task queue mechanism. We discuss dynamic load balancing and related issues in the context of distributed quadtree processing, and provide possible solutions. The proposed algorithms have been implemented on the Nectar system (currently being developed at Carnegie Mellon). Experimental results are also included in the paper.

This research was supported in part by Defense Advanced Research Projects Agency (DOD) monitored by the Space and Naval Warfare Systems Command under Contract N00039-87-C-0251, and in part by the Office of Naval Research under Contracts N00014-87-K-0385 and N00014-87-K-0533.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. A. Arnould, F. J. Bitz, E. C. Copper, H. T. Kung, and P. A. Steenkiste. The design of nectar: a network backplane for heterogeneous multicomputers. In Proc. of Third International Conference on Architectural Support for Programming Languages and Operating Systems, April 1989.

    Google Scholar 

  2. C. H. Chien and J. K. Aggarwal. A normalized quadtree representation. Computer, Vision, Graphics and Image Processing, 26:331–346, 1984.

    Google Scholar 

  3. C. H. Chien and L. J. Lin. Data partitioning and task allocation in parallel vision. in preparation.

    Google Scholar 

  4. D. Comer. The ubiquitous b-tree. ACM Computing Surveys, 11(2):121–137, June 1979.

    Article  Google Scholar 

  5. I. Gargantini. An effective way to represent quadtrees. Communication ACM, 25(12):905–910, Dec 1982.

    Article  Google Scholar 

  6. R. Jayaraman. Floorplanning by Annealing on a Hypercube Architecture. Master's thesis, Carnegie Mellon University, 1987.

    Google Scholar 

  7. A. Klinger and C. R. Dyer. Experiments on picture representation using regular decomoposition. Computer, Graphics and Image Processing, 5:68–105, 1976.

    Google Scholar 

  8. D. W. Lo, C. H. Chien, and J. K. Aggarwal. Parallel algorithms for spatial operations on octrees. In Fifteenth Workshop on Applied Imagery Pattern Recognition, Washington D. C, October 23–24 1986.

    Google Scholar 

  9. G. M. Morton. A computer oriented geodetic data base and a new technique in file sequencing. IBM Canada, 1966.

    Google Scholar 

  10. H. Samet. An algorithm for converting rasters to quadtrees. IEEE Trans. on Pattern Recognition and Machine Intellegence, 3(1):93–95, 1981.

    Google Scholar 

  11. H. Samet. The quadtree and related hierarchical data structures. ACM Computing Surveys, 16(2):187–260, 1984.

    Article  Google Scholar 

  12. C. A. Shaffer and H. Samet. Optimal quadtree construction algorithms. Computer, Vision, Graphics and Image Processing, 37(3):402–419, March 1987.

    Google Scholar 

  13. C. A. Shaffer, H. Samet, and R. C. Nelson. QUILT: A Geographic Information System Based on Quadtrees. Technical Report CAR-TR-307, University of Maryland, July 1987.

    Google Scholar 

  14. M. D. Wynn. Computation of exact quadtree and octree representations using parallel processing. unpublished report.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carnegie-Mellon University, 15213, Pittsburgh, PA

    C. H. Chien & T. Kanade

Authors
  1. C. H. Chien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Kanade
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alejandro P. Buchmann Oliver Günther Terence R. Smith Yuan-Fang Wang

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chien, C.H., Kanade, T. (1990). Distributed quadtree processing. In: Buchmann, A.P., Günther, O., Smith, T.R., Wang, YF. (eds) Design and Implementation of Large Spatial Databases. SSD 1989. Lecture Notes in Computer Science, vol 409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52208-5_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-52208-5_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52208-9

  • Online ISBN: 978-3-540-46924-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation