Skip to main content

Load Balancing and Partitioning for Parallel Signal Processing and Control Algorithms

  • Conference paper
Advanced Computing Concepts and Techniques in Control Engineering

Part of the book series: NATO ASI Series ((NATO ASI F,volume 47))

Abstract

Large scale signal processing and control applications are now being implemented using parallel computers. Some applications such as tracking and data fusion require novel partitioning and load balancing schemes in order to make parallel processing most effective. In this paper, we survey recent work on these topics. We present diffusion schemes for load balancing and Multidimensional Binary Partitions for spatial partitioning appropriate for hypercube computations.

This research was partially supported by National Science Foundation under grant DCR-8619103, the Office or Naval Research under contracts NOOO-86-G-0202 and NOO014-87-K-OI821 and the Rome Air Development Center under contract F30602-85-C-0303 at ALPHATECH, Inc. while the author was on sabbatical leave during 1986-1987.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Cybenko and T.G. Allen, "Parallel algorithms for classification and clustering,"Proceedings of SPIE Conference on Advanced Architectures and Algorithms for Signal Processing, San Diego, CA, 1987.

    Google Scholar 

  2. T.G. Allen, G. Cybenko, J. Polito, and C. Angelli, "Hypercube implementation of tracking algorithms," Proceedings of JDL Workshop on Command and Control, Washington, DC, 1987..

    Google Scholar 

  3. D.E. Keyes and W.D. Gropp, "A comparison of domain decomposition techniques for elliptic partial differential equations and their implementation," SIAM Journal of Scientific and Statistical Computing, vol. 8, pp. s166-s202, 1987.

    Article  MathSciNet  Google Scholar 

  4. M.J. Berger and S. Bokhari, "A partitioning strategy for non-uniform problems on multiprocessors," IEEE Trans. on Computers, vol. C-26, pp. 570-580, 1987.

    Article  Google Scholar 

  5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, p. W.H. Freeman, San Francisco, CA, 1979.

    MATH  Google Scholar 

  6. T.C.K. Chou and J.A. Abraham, "Load balancing in distributed systems," IEEE Trans. on Software Engin., vol. 8, pp. 401-412, 1982.

    Article  Google Scholar 

  7. F.C.H. Lin and R.M. Keller, "The gradient model load balancing method," IEEE Trans. on Software Engin., vol. 13, pp. 32-37, 1987.

    Article  Google Scholar 

  8. L.M. Ni, C.-W. Xu, and T.B. Gendreau, "A distributed drafting algorithm for load balancing," IEEE Trans. on Software Engin., vol. 11, pp. 1153-1161, 1985.

    Article  Google Scholar 

  9. S.B. Baden, "Dynamic load balancing of a vortex calculation running on multiprocessors," Lawrence Berkeley Laboratory Research Report, vol. 22584, 1986.

    Google Scholar 

  10. T.G. Allen and G. Cybenko, Recursive binary partitions, 1987. submitted to IEEE Trans. on Computers

    Google Scholar 

  11. G. Cybenko, Dynamic load balancing for distributed memory multiprocessors, 1987. Tufts University, Department of Computer Science, Technical Report

    Google Scholar 

  12. R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.

    Google Scholar 

  13. F.P. Preperata and M.I. Shamos, Computational Geometry, Springer-Verlag, New York, 1985.

    Google Scholar 

  14. J.L. Bentley, "Multidimensional binary search trees used for associative searching," Communications of the ACM, vol. 18, pp. 509-516, 1975.

    Article  MATH  Google Scholar 

  15. J.L. Bentley, "Multidimensional divide-and-conquer," Communications of the ACM, vol. 23, pp. 214-228, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  16. J. Boris, "A vectorized "near neighbors" algorithm of order N using a Monotonic Logical Grid," Journal of Computational Physics, vol. 66, pp. 1-20, 1986.

    Article  MATH  Google Scholar 

  17. P. Heidelberger, A. Norton, and J.T. Robinson, Parallel quicksort using fetch-and-add, 1987. IBM T.J. Watson Research Report RC 12576 (#56561)

    Google Scholar 

  18. L. Greengard, "The rapid evaluation of potential fields in particle systems," Research Report-599, Yale University, Department of Computer Science, 1987. (Ph.D. Thesis)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cybenko, G. (1988). Load Balancing and Partitioning for Parallel Signal Processing and Control Algorithms. In: Denham, M.J., Laub, A.J. (eds) Advanced Computing Concepts and Techniques in Control Engineering. NATO ASI Series, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83548-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83548-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83550-6

  • Online ISBN: 978-3-642-83548-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics