Skip to main content
SpringerLink
Log in

RETRACTED ARTICLE: A new compaction strategy for enhancing the utilization of reconfigurable chips

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

This article was retracted on 13 June 2015

Abstract

Field programmable gate arrays (FPGAs) are designed to implement any logic circuit with the ability to host several independent tasks simultaneously. They inherit reconfigurability from their programmable architecture. However, designs are usually dynamic and the arrival times of tasks may be unknown in advance. Accordingly, FPGA should have the ability to: (1) place incoming tasks at run time, and (2) compact the chip whenever needed. Compaction is a proposed solution to alleviate external fragmentations. It tries to move running tasks closer to each others to free a sufficient area for hosting more tasks. Unfortunately, traditional compaction techniques suffer from internal and external fragmentations. This paper introduces a novel puzzle-based compaction (PBC) technique. PBC is a shape-aware technique that is the first to take the task shape into consideration. Hence, it succeeds not only to eliminate the internal fragmentations but also to minimize the external fragmentations. Moreover, the paper develops a novel formula, which is the first not to estimate, but to exactly calculate the amount of external fragmentations generated by hosting a set of tasks inside the reconfigurable chip. Experimental results have shown that PBC outperforms recent compaction techniques in which the chip utilization has reached 87 %.

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. Roberto C, Francesco R, Massimo A, Marco D, Donatella S (2009) Partitioning and Scheduling of Task Graphs on Partially Dynamically Reconfigurable FPGAs, IEEE transactions on computer-aided design of integrated circuits and systems, vol. 28, no. 5

  2. Marconi T, Lu Y, Bertels K, Gaydadjiev G (2008) Intelligent Merging Online Task Placement Algorithm for Partial Reconfigurable Systems, In DATE, Munich, Germany, pp. 1346–1351, March 2008

  3. Giani M, Redaelli M, Santambrogio M, Sciuto D (2007) Task partitioning for the scheduling on reconfigurable systems driven by specification self-similarity. In: Int. Conf. ERSA., pp 78–84

    Google Scholar 

  4. Aigner M, Haas A, Kirsch M, Lippautz M, Sokolova A, Stroka S, Unterweger A (2011) Short-term memory for self-collecting mutators. In Proc. International Symposium on Memory Management (ISMM’11), June 4–5, 2011, San Jose, California, USA

  5. Banerjee S, Bozorgzadeh E, Dutt N (2005) Considering run-time reconfiguration overhead in task graph transformation for dynamically reconfigurable architectures. In: Proc. 13th Annual IEEE Symp. FCCM., pp 273–274

    Google Scholar 

  6. Banerjee S, Bozorgzadeh E, Dutt N (2005) Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration. In: Proc. DAC., pp 335–340

    Google Scholar 

  7. Fekete S, Schepers J (2004) A combinational characterization of higher-dimensional orthogonal packing. Math Oper Res 29:591–602

    Article  MathSciNet  Google Scholar 

  8. Resano J, Mozos D (2004) Specific scheduling support to minimize the reconfiguration overhead of dynamically reconfigurable hardware. In: Proc. DAC., pp 119–124

    Google Scholar 

  9. Banerjee S, Bozorgzadeh E, Dutt N (2006) Integrating physical constraints in HW-SW partitioning for architectures with partial dynamic reconfiguration. IEEE Trans Very Large Scale Integr (VLSI) Syst 14(11):1189–1202

    Article  Google Scholar 

  10. Jean J, Tomko K, Yavagal V, Shah J, Cook R (1999) Dynamic reconfiguration to support concurrent applications. IEEE Trans Comput 48(6):591–602

    Article  Google Scholar 

  11. Fekete S, Kohler E, Teich J (2001) Optimal FPGA module placement with temporal precedence constrains. In: Proceedings of design automation and test in Europe (DATE)., pp 658–665

    Google Scholar 

  12. Bazargan K., Kastner R., & Sarrafzadeh M (2000) Fast template placement for reconfigurable computing systems, IEEE Des Test Comput, vol(17), pp. 68–83

  13. Tabero J, Septien J, Mesha H, Mozos D, Roman S (2003) Efficient hardware multitasking through space multiplexing in 2D RTR FPGAs. In Euromicro digital system design conference, September (2003)

  14. Steiger C, Walder H, Platzner M (2003) Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In: Cheung YKP, Constantinides GA (eds) FPL 2003. LNCS, vol 2778. Springer, Heidelberg, pp 575–584

    Google Scholar 

  15. Chen Y, Hsiung P (2003) Hardware task scheduling and placement in operating systems for dynamically reconfigurable SoC. In: EUC, pp. 489–498

  16. Marconi T, Lu Y, Bertels K, Gaydadjiev G (2008) Online Hardware Task Scheduling and Placement Algorithm on Partially Reconfigurable Devices. In: Woods R, Compton K, Bouganis C, Diniz PC (eds) ARC 2008. LNCS, vol 4943. Springer, Heidelberg, pp 306–311

    Google Scholar 

  17. Zhou X, Wang Y, Huang X, Peng C (2006) On-line scheduling of real-time tasks for reconfigurable computing system. In: FPT, pp. 57–64

  18. Zhou X, Wang Y, Huang X, Peng C (2007) Fast on-line task placement and scheduling on reconfigurable devices. In: FPL, pp. 132–138

  19. Marconi T, Lu Y, Bertels K, Gaydadjiev G (2009) A novel fast online placement algorithm on 2D partially reconfigurable devices. In: FPT, pp. 296–299

  20. Diessel O, ElGindy H, Middendorf M, Schmeck H, Schmidt B (2000) Dynamic scheduling of tasks on partially reconfigurable FPGAs. IEE Proc Comput Digit Tech 147:181–188

    Article  Google Scholar 

  21. El Farag A, Hatem B, Shaheen S (2007) Improving utilization of reconfigurable resources using two-dimensional compaction, International Journal of Super-Computing, Vol(42), pp. 235–250

  22. Thomas M, Yi L, Koen B, Georgi G (2010) 3D compaction: a novel blocking-aware algorithm for online hardware task scheduling and placement on 2D partially reconfigurable devices, ARC 2010, Springer, Berlin, pp. 194–206

  23. Xilinx (2008) Virtex-4 FPGA configuration user guide, UG071

  24. Xilinx (2007) Virtex-5 user guide, Xilinx., San Jose, CA, Tech. Rep. ug190

  25. Hanad M, Vemuri R (2004) An efficient algorithm for finding empty space for online FPGA placement. In Design automation conference, San Diego CA, pp. 960–965

Download references

Author information

Authors and Affiliations

  1. Department of Computer Eng. & Systems, Faculty of Engineering, Mansoura University, Mansoura, Egypt

    A. I. Saleh

Authors
  1. A. I. Saleh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. I. Saleh.

Additional information

An erratum to this article is available at http://dx.doi.org/10.1007/s00170-015-7388-4.

Springer has decided to retract the following article [metadata of article]. Upon investigation carried out according to the Committee on Publication Ethics guidelines, it has been found that the authors have duplicated substantial parts from the following article: "A Novel Puzzle Based Compaction (PBC) Strategy for Enhancing the Utilization of Reconfigurable Resources", ‘International Journal of Applied Evolutionary Computation’ 1(4), pp. 34-70.

About this article

Cite this article

Saleh, A.I. RETRACTED ARTICLE: A new compaction strategy for enhancing the utilization of reconfigurable chips. Int J Adv Manuf Technol 67, 455–473 (2013). https://doi.org/10.1007/s00170-012-4497-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4497-1

Keywords

Search

Navigation