Nothing Special   »   [go: up one dir, main page]

Skip to main content

A Hybrid Heuristic Algorithm for HW-SW Partitioning Within Timed Automata

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4251))

Abstract

Hardware/Software (HW-SW) partitioning is a critical problem in co-design of embedded systems. This paper focuses on the synchronous system model, and formalizes the partitioning problem using timed automata (TA), which captures the key elements of the partitioning problem. Based on the TA model, we propose a hybrid heuristic algorithm to obtain near-optimal solutions effectively and efficiently. The experiments conducted show that our approach can deal with large applications with hundreds of nodes in task graph.

Geguang Pu and Jifeng He are supported by 973 project No. 2005CB321904, and Zongyan Qiu is supported by NNSFC No. 60573081. Zhang Chong and Zuoquan Lin are supported by NNSFC No. 60373002, 60496322.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Banerjee, S., Dutt, N.D.: Efficient search space exploration for HW-SW partitioning. In: CODES+ISSS 2004, pp. 122–127 (2004)

    Google Scholar 

  2. Bowen, J., Jifeng, H.: An approach to the specification and verification of a hardware compilation scheme. Journal of Supercomputing 19(1), 23–29 (2001)

    Article  MATH  Google Scholar 

  3. Alur, R., Dill, D.L.: A Theory for Timed Automata. Theoretical Computer Science 125, 183–235 (1994)

    Article  MathSciNet  Google Scholar 

  4. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Glover, F., Laguna, M.: Tabu Search. Handbook of Combinatorial Optimization 3, 621–757 (1998)

    MathSciNet  Google Scholar 

  6. Handle-C Language Overview. Celoxica Limited (2002)

    Google Scholar 

  7. Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a Nutshell. Int. Journal of Software Tools for Technology Transfer 1(1-2), 134–152 (1997)

    Article  MATH  Google Scholar 

  8. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers Oper. Res. 24, 1097–1100 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Pu, G., Van Hung, D., He, J., Yi, W.: An optimal approach to hardware/software partitioning for synchronous model. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol. 2999, pp. 363–381. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Pu, G., Xiangpeng, Z., Shuling, W., Zongyan, Q., He, J., Yi, W.: An approach to hardware/software partitioning for multiple hardware devices model. In: IEEE SEFM 2004, pp. 376–385 (2004)

    Google Scholar 

  11. Quan, G., Hu, X., Greenwood, G.W.: Preference-driven hierarchical hardware/software partitioning. In: Internatitional conference on Computer Design (IEEE), pp. 652–657 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pu, G., Chong, Z., Qiu, Z., Lin, Z., Jifeng, H. (2006). A Hybrid Heuristic Algorithm for HW-SW Partitioning Within Timed Automata. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11892960_56

Download citation

  • DOI: https://doi.org/10.1007/11892960_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46535-5

  • Online ISBN: 978-3-540-46536-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics