Skip to main content

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

Abstract

Partitioning problem in codesign is of great importance since it can widely influence the characteristics of the system under design. The numerous constraints imposed by the environment and/or the underlying target architecture, in addition to its NP-Completeness makes the problem hard to solve. This paper introduces an automatic partitioning approach inspired by the collective behavior of social insects such as ants, which are able to find the shortest path from their nest to a food source.

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 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.

References

  1. Kumar, S., Aylor, J.H., Johnson, B., Wulf, W.A.: The Codesign of Embedded Systems. Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

  2. De Micheli, G., Gupta, R.: Hardware/Software Co-design. Proceedings of the IEEE 85(3), 349–365 (1997)

    Article  Google Scholar 

  3. D’Ambrosio, J.G., Hu, X.: Configuration-level hardware/software partitioning for real-time embedded systems. In: Proceedings of the Third International Workshop on Hardware/Software Codesign, pp. 34–41 (1994)

    Google Scholar 

  4. Pop, P., Eles, P., Peng, Z.: Scheduling driven partitioning of heterogeneous embedded systems. Dept. of Computer and Information Science. Linköping University, Sweden (1998)

    Google Scholar 

  5. Hou, J., Wolf, W.: Process partitioning for distributed embedded systems. In: Proc. CODES 1996, Pittsburgh, USA, pp. 70–75 (1996)

    Google Scholar 

  6. Kalavade, A., Lee, E.A.: The extended partitioning problem: hardware/software mapping and implementation-bin selection. In: Proceedings of the Sixth International Workshop on Rapid Systems Prototyping, Chapel Hill, NC (June 1995)

    Google Scholar 

  7. Gupta, R.K.: Co-Synthesis of Hardware and Software for digital embedded systems. Kluwer, Amsterdam (1995)

    MATH  Google Scholar 

  8. Olukotun, K.A., Helaihel, R., Levitt, J., Ramirez, R.: A Software-Hardware cosynthesis approach to digital system simulation. IEEE Micro, 48–58 (August 1994)

    Google Scholar 

  9. Jantsch, A., Ellervee, P., Oberg, J., Hemani, A.: A case study on hardware/software partitioning. In: Proceedings IEEE Workshop on FPGAs for Custom Computing Machines, pp. 111–118 (1994)

    Google Scholar 

  10. Gajski, D.D., Narayan, S., Ramachandran, L., Vahid, F.: System design methodologies: aiming at the 100h design cycle. IEEE Trans. on VLSI Systems 4(1), 70–82 (1996)

    Article  Google Scholar 

  11. Hartenstein, R., Becker, J., Kress, R.: Two-level hardware/software partitioning using CoDe-X. In: IEEE Symposium and Workshop on Engineering of Computer-Based Systems (March 1996)

    Google Scholar 

  12. Eles, P., Peng, Z., Kuchinski, K., Doboli, A.: System Level Hardware/Software Partitioning Based on Simulated Annealing and Tabu Search. Design Automation for Embedded Systems 2(1), 5–32 (1997)

    Article  Google Scholar 

  13. Chou, P., Walkup, E.A., Boriello, G.: Scheduling strategies in the cosynthesis of reactive real-time systems. IEEE Micro 14(4), 37–47 (1994)

    Article  Google Scholar 

  14. Nieman, R., Marwedel, P.: Hardware/Software partitioning using integer programming. In: Proc. EDTC, pp. 473–479 (1996)

    Google Scholar 

  15. Chatha, K.S., Vemuri, R.: MAGELLAN: Multiway Hardware-Software Partitioning and Scheduling for Latency Minimization of Hierarchical Control-Dataflow Task Graphs. In: Proceedings of 9th International Symposium on Hardware-Software Codesign (CODES 2001), Copenhagen, Denmark, April 25-27 (2001)

    Google Scholar 

  16. Bolchini, C., Pomante, L., Salice, F., Sciuto, D.: H/W embedded systems: on-line fault detection in a hardware/software codesign environment: system partitioning. In: Proceedings of the International Symposium on Systems Synthesis, vol. 14 (2001)

    Google Scholar 

  17. Koudil, M., Benatchba, K., Dours, D.: Using genetic algorithms for solving partitioning problem in codesign. In: Mira, J., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2687, pp. 393–400. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Noguera, J., Badia, R.M.: A hardware/software partitioning algorithm for dynamically reconfigurable architectures. In: Proceedings of the International Conference on Design Automation and Test in Europe (DATE 2001) (March 2001)

    Google Scholar 

  19. Benatchba, K., Koudil, M., Drias, H., Oumsalem, H., Et Chaouche, K.: PARME un environnement pour la résolution du probléme Max-Sat, CARI 2002, Colloque Africain sur la Recherche en Informatique (October 2002)

    Google Scholar 

  20. Dorigo, M.: Optimization, Learning and Natural Algorithms, PhD thesis, Politecnico di Milano, Italy (1992)

    Google Scholar 

  21. Costa, D., Hertz, V.: Ants can Colour Graphs. Journal of the Operational Research Society 48, 295–305 (1997)

    MATH  Google Scholar 

  22. Solnon, C.: Solving Permutation Constraint Satisfaction Problems with Artificial Ants. In: Proceedings of the 14th European Conference on Artificial Intelligence, pp. 118–122. IOS Press, Amsterdam (2000)

    Google Scholar 

  23. Benatchba, K., Admane, L., Koudil, M., Drias, H.: Application of ant colonies to data-mining expressed as Max-Sat problems. In: International Conference on Mathematical Methods for Learning, MML 2004, Italy (June 2004)

    Google Scholar 

  24. Admane, L., Benatchba, K., Koudil, M., Drias, H.: Evolutionary methods for solving data-mining problems. In: IEEE International Conference on Systems, Man & Cybernetics, Netherlands (October 2004)

    Google Scholar 

  25. Colorni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Algorithm. In: Proceedings of the First European Conference on Artificial Life, pp. 134–142. MIT Press, Cambridge (1992)

    Google Scholar 

  26. Bonabeau, E., Dorigo, M., ThéRaulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)

    MATH  Google Scholar 

  27. Dorigo, M., Dicaro, G.: Ant Colony Optimisation: A new meta-heuristic. IEEE 1999 (1999)

    Google Scholar 

  28. Stûtzle, T., Dorigo, M.: ACO algorithms for the traveling salesman broblem. In: Miettinen, K., Mëkelë, M.M., Neittaanmäki, P., Periaux, J. (eds.), John Wiley and Sons, Chichester (1999)

    Google Scholar 

  29. Dorigo, M., Gambardella, L.M.: Ant Colony system: A cooperation learning approch to the traveling salesman problem. IEEE Trans. Evol. Comp. 1(1), 53–66 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koudil, M., Benatchba, K., Gharout, S., Hamani, N. (2005). Solving Partitioning Problem in Codesign with Ant Colonies. In: Mira, J., Álvarez, J.R. (eds) Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. IWINAC 2005. Lecture Notes in Computer Science, vol 3562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499305_34

Download citation

  • DOI: https://doi.org/10.1007/11499305_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26319-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics