The Journal of Supercomputing

, Volume 71, Issue 4, pp 1177–1195 | Cite as

Dynamic-width reconfigurable parallel prefix circuits

Article

Abstract

Parallel prefix circuits have drawn high interest because of their importance in many applications such as fast adders. Most proposed parallel prefix circuits assume fixed width. The input size could be of the same width as the circuit or different than the width of the circuit. In this paper, we propose a class of reconfigurable parallel prefix circuits, \(\check{R}\)-circuits, that support different operational modes. The \(\check{R}\)-circuit can be reconfigured as one parallel prefix circuit of high width as well as several smaller width parallel prefix circuits that can operate on different prefix problems in parallel. In particular, an \(\check{R}\)-circuit, \(\check{R}(k(m))\), of width km with \(k\) building blocks (slices) each of width \(m\), can be configured as a number of \(z\) prefix circuits, \(z\le k\), each of width \(b_{j}\), such that \(\sum \nolimits _{j=1}^z {b_j } =km\). For a circuit \(CR_b \in \check{R}(k(m))\) of \(b\) slices and width bm, we show how such circuit can be constructed. We derive a bound for the depth of \(CR_b \) and show how \(CR_b \) can handle input size \(n\ge bm\). Then, we show the performance of \(\check{R}(k(m))\) and compare it with other fixed same-width prefix circuits.

Keywords

Dynamic-width circuits Prefix operations Parallel algorithms Reconfigurable circuits 

References

  1. 1.
    Akl SG (1997) Parallel computation: models and methods. Prentice-Hall, Upper Saddle RiverGoogle Scholar
  2. 2.
    Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees. Hypercubes. Morgan Kaufmann, San MateoMATHGoogle Scholar
  3. 3.
    Datta A (2004) Multiple addition and prefix sum on a linear array with a reconfigurable pipelined bus system. J Supercomput 29(3):303–317CrossRefMATHGoogle Scholar
  4. 4.
    Hagerup T (1995) The parallel complexity of integer prefix summation. Inform Process Lett 56(1):59–64CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Hsu WJ, Page CV (1995) Parallel tree contraction and prefix computations on a large family of interconnection topologies. Acta Inform 32(2):145–153CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Lin Y-C, Hsiao J-W (2004) A new approach to constructing optimal parallel prefix circuits with small depth. J Parallel Distrib Comput 64(1):97–107CrossRefMATHGoogle Scholar
  7. 7.
    Lin Y-C, Su C-Y (2005) Faster optimal parallel prefix circuits: New algorithmic construction. J Parallel Distrib Comput 65:1585–1595CrossRefMATHGoogle Scholar
  8. 8.
    Lin Y-C, Lin CM (2000) Efficient parallel prefix algorithms on multicomputers. J Inform Sci Eng 16(1):41–64Google Scholar
  9. 9.
    Sheeran M, Parberry I (2006) A new approach to the design of optimal parallel prefix circuits. In: Technical report 2006, vol 1. Department of Computer Science and Engineering, Chalmers University of Technology, GoteborgGoogle Scholar
  10. 10.
    Zhu H, Cheng C-K, Graham R (2006) Constructing zero-deficiency parallel prefix circuits of minimum depth. ACM Trans Des Autom Electron Syst 11(2):387–409CrossRefGoogle Scholar
  11. 11.
    Zhu H, Cheng C-K, Graham R (2009) Straightforward construction of depth-size optimal, parallel prefix circuits with fan-out 2. ACM Trans Des Autom Electron Syst 14(1):article 15Google Scholar
  12. 12.
    Kumar Ashutosh, Jain Rakesh (2013) Design of 64-bit parallel prefix VLSI adder for high speed arithmetic circuits. Int J Res Eng Sci (IJRES) 1(8):28–32Google Scholar
  13. 13.
    Dimitrakopoulos G, Nikolos D (2005) High-speed parallel-prefix VLSI Ling adders. IEEE Trans Comput 54(2):225–231CrossRefGoogle Scholar
  14. 14.
    Knowles S (2001) A family of adders. In: Proceedings of the 15th IEEE symposium on computer arithmetic, Vail, pp 277–284Google Scholar
  15. 15.
    Beaumont-Smith A, Lim C-C (2001) Parallel prefix adder design. In: Proceedings of the 15th IEEE symposium on computer arithmetic, Vail, pp 218–225Google Scholar
  16. 16.
    Lin Y-C (1999) Optimal parallel prefix circuits with fan-out 2 and corresponding parallel algorithms. Neural Parallel Sci Comput 7(1):33–42MATHMathSciNetGoogle Scholar
  17. 17.
    Lin Y-C, Hung L-L (2009) Fast problem-size-independent parallel prefix circuits. J Parallel Distrib Comput 69:382–388CrossRefGoogle Scholar
  18. 18.
    Hatem M El-Boghdadi (2013), a class of almost-optimal size-independent parallel prefix circuits. J Parallel Distrib Comput 73:888–894Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Computer Engineering Department, Faculty of EngineeringCairo UniversityGizaEgypt

Personalised recommendations