Skip to main content
SpringerLink
Log in

A partitioning methodology that optimizes the communication cost for reconfigurable computing systems

  • Published:
International Journal of Automation and Computing Aims and scope Submit manuscript

Abstract

This paper focuses on the design process for reconfigurable architecture. Our contribution focuses on introducing a new temporal partitioning algorithm. Our algorithm is based on typical mathematic flow to solve the temporal partitioning problem. This algorithm optimizes the transfer of data required between design partitions and the reconfiguration overhead. Results show that our algorithm considerably decreases the communication cost and the latency compared with other well known algorithms.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Bobda. Introduction to Reconfigurable Computing: Architectures, Algorithms and Applications, Germany: Springer Publishers, 2007.

    MATH  Google Scholar 

  2. J. M. P. Cardoso. On combining temporal partitioning and sharing of functional units in compilation for reconfigurable architectures. IEEE Transactions on Computers, vol. 52, no. 10, pp. 1362–1375, 2003.

    Article  MathSciNet  Google Scholar 

  3. C. Tanougast, Y. Berviller, P. Brunet, S. Weber, H. Rabah. Temporal partitioning methodology optimizing FPGA resources for dynamically reconfigurable embedded real-time system. Microprocessors and Microsystems, vol. 27, no. 3, pp. 115–130, 2003.

    Article  Google Scholar 

  4. A. D. Cabrol, T. Garcia, P. Bonnin, M. Chetto. A concept of dynamically reconfigurable real-time vision system for autonomous mobile robotics. International Journal of Automation and Computing, vol. 5, no. 2, pp. 174–184, 2008.

    Article  Google Scholar 

  5. W. Y. Wu, Z. X. Zhao. Realization of reconfigurable virtual environments for virtual testing. International Journal of Automation and Computing, vol. 2, no. 1, pp. 25–36, 2005.

    Article  Google Scholar 

  6. B. Ouni, R. Ayadi, M. Abid. Novel temporal partitioning algorithm for run time reconfigured systems. Journal of Engineering and Applied Sciences, vol. 3, no. 10, pp. 766–773, 2008.

    Google Scholar 

  7. B. Ouni, A. Mtibaa, E. B. Bourennane. Scheduling approach for run time reconfigured systems. International Journal of Computer Sciences and Engineering Systems, vol. 3, no. 4, pp. 335–340, 2009.

    Google Scholar 

  8. S. Trimberger. Scheduling designs into a time-multiplexed FPGA. In Proceedings of the 1998 ACM/SIGDA International Symposium on Field Programmable Gate Arrays, ACM, Monterey, USA, pp. 153–160, 1998.

    Chapter  Google Scholar 

  9. H. Q. Liu, D. F. Wong. A graph theoretic algorithm for schedule compression in time-multiplexed FPGA partitioning. In Proceedings of IEEE/ACM International Conference on Computer-aided Design, IEEE, San Jose, USA, pp. 400–405, 1999.

    Google Scholar 

  10. H. Q. Liu, D. F. Wong. Network flow based circuit partitioning for time-multiplexed FPGAs. In Proceedings of IEEE/ACM International Conference on Computer-aided Design, IEEE, pp. 497–504, 1998.

  11. H. Q. Liu, D. F. Wong. Network flow based multi-way partitioning with area and pin constraints. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, vol. 17, no. 1, pp. 50–59, 1998.

    Article  Google Scholar 

  12. W. K. Mak, E. F. Y. Young. Temporal logic replication for dynamically reconfigurable FPGA partitioning. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, vol. 22, no. 7, pp. 952–959, 2003.

    Article  Google Scholar 

  13. Y. C. Jiang, J. F. Wang. Temporal partitioning data flow graphs for dynamically reconfigurable computing. IEEE Transactions on Very Large Scale Integration Systems, vol. 15, no. 12, pp. 1351–1361, 2007.

    Article  Google Scholar 

  14. J. Shi, J. Malik. Normalized cuts and image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888–905, 2000.

    Article  Google Scholar 

  15. P. Biswal, J. R. Lee, S. Rao. Eigenvalue bounds spectral partitioning and metrical deformations via flows. In Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, IEEE, Philadelphia, USA, pp. 751–760, 2008.

    Chapter  Google Scholar 

  16. M. Kaul, R. Vemuri. Design-space exploration for block-processing based temporal partitioning of run-time reconfigurable systems. Journal of VLSI Signal Processing Systems for Signal Image and Video Technology, vol. 24, no. 2, pp. 181–209, 2000.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Electronics and Microelectronics, Faculty of Science of Monastir, University of Monastir, Monastir, 5019, Tunisia

    Ramzi Ayadi, Bouraoui Ouni & Abdellatif Mtibaa

  2. Department of Electrical Engineering, National Engineering School of Monastir, University of Monastir, Monastir, 5019, Tunisia

    Abdellatif Mtibaa

Authors
  1. Ramzi Ayadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bouraoui Ouni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abdellatif Mtibaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ramzi Ayadi.

Additional information

Ramzi Ayadi received his M. Sc. degree in electronics and microelectronics from the University of Monastir, Tunisia in 2007. He is currently completing his Ph. D. degree at the Electronic and Micro-Electronic Laboratory, Faculty of Sciences of Monastir.

His research interests include high level synthesis, methodologies development for reconfigurables architectures.

Bouraoui Ouni received his licence and his master respectively in 1999 and 2001. He completed his thesis in 2008 from the Faculty of Science of Monastir, Tunisia. Since 2002, he has been an assistant professor in digital electronic at the High Institute of Informatics and Telecommunication of Hamman Sousse and the National School of Engineering of Sousse.

His research interests include high level synthesis and methodologies development for reconfigurable architectures.

Abdellatif Mtibaa is currently professor in micro-electronics and hardware design with Electrical Department at the National School of Engineering of Monastir, Tunisia and head of Circuits Systems Reconfigurable-ENIM-Group at Electronic and Microelectronic Laboratory. He holds a diploma in electrical engineering in 1985 and received his Ph.D. degree in electrical engineering in 2000. He has authored/coauthored over 100 papers in international journals and conferences. He served on the technical program committees for several international conferences. He also served as a co-organizer of several international conferences.

His research interests include system on programmable chip, high level synthesis, rapid prototyping and reconfigurable architecture for real-time multimedia applications.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ayadi, R., Ouni, B. & Mtibaa, A. A partitioning methodology that optimizes the communication cost for reconfigurable computing systems. Int. J. Autom. Comput. 9, 280–287 (2012). https://doi.org/10.1007/s11633-012-0645-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11633-012-0645-1

Keywords

Search

Navigation