Skip to main content

An Improved Reconfiguration Algorithm for VLSI Arrays with A-Star

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2016 (ICCSA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9787))

Included in the following conference series:

Abstract

This paper describes a novel technique to speed up the reconfiguration for the VLSI arrays. We propose an efficient algorithm based on A-star algorithm for accelerating reconfiguration of the power efficient VLSI processor subarrays to meet the real-time constraints and lower power consumption of the embedded systems. The proposed algorithm treats the problem of constructing a local optimal logical column that has the minimum number of long interconnects as a shortest path problem. Then the local optimal column can be constructed by utilizing A-star algorithm with appropriate heuristic strategy. The proposed algorithm greatly reduces the number of visits to the fault-free PEs for constructing a local optimal logical column and effectively decreases the reconfiguration running time. Experimental results show that the computation time can be improved by more than 38.64 % for a \(128 \times 128\) host array with fault density of 20 %, without loss of harvest.

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 EPUB and 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

References

  1. Negrini, R.M., Sami, M., Stefanelli, R.: Fault-tolerance through Reconfiguration of VLSI and WSI Awards. The MIT Press, Cambridge (1989)

    Google Scholar 

  2. Kuo, S.Y., Chen, I.Y.: Efficient reconfiguration algorithms for degradable VLSI/WSI arrays. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 10, 1289–1300 (1992)

    Article  Google Scholar 

  3. Low, C.P., Leong, H.W.: On the reconfiguration of degradable VLSI/WSI arrays. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 10, 1213–1221 (1997)

    Article  Google Scholar 

  4. Low, C.P.: An efficient reconfiguration algorithm for degradable VLSI/WSI arrays. IEEE Trans. Comput. 6, 553–559 (2000)

    Google Scholar 

  5. Jigang, W., Srikanthan, T.: An improved reconfiguration algorithm for degradable VLSI/WSI arrays. J. Syst. Archit. 1(2), 23–31 (2003)

    Article  Google Scholar 

  6. Jigang, W., Srikanthan, T.: Accelerating reconfiguration of degradable VLSI arrays. Proc. IEEE Circ. Dev. Syst. 4, 383–389 (2006)

    Google Scholar 

  7. Jigang, W., Srikanthan, T., Wang, X.: Integrated row and column re-routing for reconfiguration of VLSI arrays with 4-port switches. IEEE Trans. Comput. 10, 1397–1400 (2007)

    MathSciNet  Google Scholar 

  8. Jigang, W., Srikanthan, T., Han, X.: Preprocessing and partial rerouting techniques for accelerating reconfiguration of degradable VLSI arrays. IEEE Trans. Very Large Scale Integr. Syst. 2, 315–319 (2010)

    Article  Google Scholar 

  9. Jigang, W., Srikanthan, T.: Reconfiguration algorithms for power efficient VLSI subarrays with 4-port switches. IEEE Trans. Comput. 3, 243–253 (2006)

    Article  Google Scholar 

  10. Jigang, W., Srikanthan, T., Jiang, G.Y., Wang, K.: Constructing sub-arrays with short interconnects from degradable VLSI arrays. IEEE Trans. Parallel Distrib. Syst. 4, 929–938 (2014)

    Article  Google Scholar 

  11. Qian, J.Y., Zhou, Z.D., Gu, T.L., Zhao, L.Z., Chang, L.: Optimal reconfiguration of high-performance VLSI subarrays with network flow. IEEE Trans. Parallel Distrib. Syst. (Online) (2016). doi:10.1109/TPDS.2016.2539958

    Google Scholar 

  12. Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of \({\rm A}^{\ast }\). J. Assoc. Comput. Mach. 3, 505–536 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China under grant No. 61262008, 61363030, 61562015, U1501252 and 61572146, the High Level Innovation Team of Guangxi Colleges and Universities and Outstanding Scholars Fund, Guangxi Natural Science Foundation of China under grant No. 2014GXNSFAA118365, 2015GXNSFDA139038, Innovation Project of GUET Graduate Education No. YJCXS201537, Guangxi Key Laboratory of Trusted Software Focus Fund, Program for Innovative Research Team of Guilin University of Electronic Technology.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lingzhong Zhao .

Editor information

Editors and Affiliations

Appendix

Appendix

figure c
figure d

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Qian, J., Zhou, Z., Zhao, L., Gu, T. (2016). An Improved Reconfiguration Algorithm for VLSI Arrays with A-Star. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2016. ICCSA 2016. Lecture Notes in Computer Science(), vol 9787. Springer, Cham. https://doi.org/10.1007/978-3-319-42108-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42108-7_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42107-0

  • Online ISBN: 978-3-319-42108-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics