Skip to main content
SpringerLink
Log in

Bit summation on the reconfigurable mesh

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

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

Included in the following conference series:

Abstract

The bit summation problem on reconfigurable meshes is studied for the case where the number of bits is as large as the number of processors. It is shown that kn binary values can be computed on a reconfigurable mesh of size k×n in time \(O(\log ^* k + (\log n/\sqrt {k\log k} ))\).

This work was done during the authors stay at the Faculty of Computer Science, University of Dortmund, Germany

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.

References

  1. P. Fragopoulou, On the efficient summation of n numbers on an n-processor reconfigurable mesh. Par. Proc. Lett. 3: 71–78, 1993.

    Article  MathSciNet  Google Scholar 

  2. J. Jang, V.K. Prasanna. An optimal sorting algorithm on reconfigurable mesh. In: Proc. Int. Parallel processing Symp. 130–137, 1992.

    Google Scholar 

  3. J.-W. Jang, H. Park, V.K. Prasanna. A fast algorithm for computing histogram on reconfigurable mesh. In: Proc. of Frontiers of Massively parallel Computation ’92, 244–251, 1992.

    Google Scholar 

  4. J.-W. Jang, H. Park, V.K. Prasanna. A bit model of reconfigurable mesh. In: Proc. Workshop on Reconfigurable Architectures, Cancun, Mexico, 1994.

    Google Scholar 

  5. M. Middendorf, H. Schmeck, H. Schröder, G. Turner. Multiplication of matrices with different sparseness properties. to appear in: VLSI Design.

    Google Scholar 

  6. R. Miller, V.K. Prasanna-Kumar, D.I. Reisis, Q.F. Stout. Parallel Computations on Reconfigurable Meshes. IEEE Trans. Comput. 42: 678–692, 1993.

    Article  MathSciNet  Google Scholar 

  7. K. Nakano. Efficient summing algorithms for a reconfigurable mesh. In: Proc. Workshop on Reconfigurable Architectures, Cancun, Mexico, 1994.

    Google Scholar 

  8. K. Nakano. Prefix-sum algorithms on reconfigurable meshes. Par. Process. Lett. 5: 23–35, 1995.

    Article  Google Scholar 

  9. S. Olariu, J. L. Schwing, J. Zhang. Fundamental algorithms on reconfigurable meshes. Proc. 29th Allerton Conference on Communications, Control, and Computing, 811–820, 1991.

    Google Scholar 

  10. H. Park, H. J. Kim, V. K. Prasanna. On O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh. Inf. Process. Lett., 47: 109–113, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  11. B.F. Wang, G.H. Chen, H. Li. Configurational computation: A new computation method on processor arrays with reconfigurable bus systems. In: Proc. 1st Workshop on Parallel Processing, Tsing-Hua University, Taiwan, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, D-76128, Karlsruhe, Germany

    Martin Middendorf

Authors
  1. Martin Middendorf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Middendorf, M. (1999). Bit summation on the reconfigurable mesh. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097947

Download citation

  • DOI: https://doi.org/10.1007/BFb0097947

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation