The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - Sept. (2012 vol.61)
pp: 1354-1360
Miaoqing Huang , University of Arkansas, Fayetteville
Vikram K. Narayana , The George Washington University, Washington DC
Mohamed Bakhouya , Technical University of Belfort Montbeliard, Cedex
Jaafar Gaber , Technical University of Belfort Montbeliard, Cedex
Tarek El-Ghazawi , The George Washington University, Washington DC
ABSTRACT
High-performance reconfigurable computing involves acceleration of significant portions of an application using reconfigurable hardware. Mapping application task graphs onto reconfigurable hardware is, therefore, of rising attention. In this work, we approach the mapping problem by incorporating multiple architectural variants for each hardware task; the variants reflect tradeoffs between the logic resources consumed and the task execution throughput. We propose a mapping approach based on the genetic algorithm, and show its effectiveness for random task graphs as well as an N-body simulation application, demonstrating improvements of up to 78.6 percent in the execution time compared with choosing a fixed implementation variant for all tasks. We then validate our methodology through experiments on real hardware, an SRC-6 reconfigurable computer.
INDEX TERMS
Hardware task mapping, genetic algorithm, reconfigurable computing.
CITATION
Miaoqing Huang, Vikram K. Narayana, Mohamed Bakhouya, Jaafar Gaber, Tarek El-Ghazawi, "Efficient Mapping of Task Graphs onto Reconfigurable Hardware Using Architectural Variants", IEEE Transactions on Computers, vol.61, no. 9, pp. 1354-1360, Sept. 2012, doi:10.1109/TC.2011.153
REFERENCES
[1] T. El-Ghazawi, E. El-Araby, M. Huang, K. Gaj, V. Kindratenko, and D. Buell, “The Promise of High-Performance Reconfigurable Computing,” Computer, vol. 41, no. 2, pp. 78-85, Feb. 2008.
[2] P. Saha, E. El-Araby, M. Huang, M. Taher, S. Lopez-Buedo, T. El-Ghazawi, C. Shu, K. Gaj, A. Michalski, and D. Buell, “Portable Library Development for Reconfigurable Computing Systems: A case Study,” Parallel Computing, vol. 34, nos. 4/5, pp. 245-260, May 2008.
[3] M. Huang, V.K. Narayana, H. Simmler, O. Serres, and T. El-Ghazawi, “Reconfiguration and Communication-Aware Task Scheduling for High-Performance Reconfigurable Computing,” ACM Trans. Reconfigurable Technology and Systems, vol. 3, no. 4, pp. 20:1-20:25, Nov. 2010.
[4] M. Huang, V.K. Narayana, and T. El-Ghazawi, “Efficient Mapping of Hardware Tasks on Reconfigurable Computers Using Libraries of Architecture Variants,” Proc. IEEE 17th Ann. Symp. Field-Programmable Custom Computing Machines (FCCM '09), pp. 247-250, Apr. 2009.
[5] W. Fu and K. Compton, “An Execution Environment for Reconfigurable Computing,” Proc. IEEE 13th Ann. Symp. Field-Programmable Custom Computing Machines (FCCM '05), pp. 149-158, Apr. 2005.
[6] T. Lee, J. Henkel, and W. Wolf, “Dynamic Runtime Re-Scheduling Allowing Multiple Implementations of a Task for Platform-Based Designs,” Proc. Design, Automation and Test in Europe Conf. and Exhibition (DATE '02), pp. 296-301, Mar. 2002.
[7] S. Banerjee, E. Bozorgzadeh, and N. Dutt, “Exploiting Application Data-Parallelism on Dynamically Reconfigurable Architectures: Placement and Architectural Considerations,” IEEE Trans. Very Large Scale Integration Systems, vol. 17, no. 2, pp. 234-247, Feb. 2009.
[8] J. Wang and S.M. Loo, “Case Study of Finite Resource Optimization in FPGA Using Genetic Algorithm,” GEC '09: Proc. First ACM/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 989-992, 2009.
[9] Y. Qu, J.-P. Soininen, and J. Nurmi, “A Genetic Algorithm for Scheduling Tasks onto Dynamically Reconfigurable Hardware,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '07), pp. 161-164, 2007.
[10] B. Mei, P. Schaumont, and S. Vernalde, “A Hardware-Software Partitioning and Scheduling Algorithm for Dynamically Reconfigurable Embedded Systems,” Proc. 11th ProRISC Workshop Circuits, Systems and Signal Processing, Nov. 2000.
[11] W. Banzhaf, P. Nordin, R.E. Keller, and F.D. Francone, Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and Its Applications. Morgan Kaufmann, 1998.
[12] A.Y. Zomaya, R.C. Lee, and S. Olariu, “An Introduction to Genetic-Based Scheduling in Parallel Processor Systems,” Solutions to Parallel and Distributed Computing Problems, ch. 5, pp. 111-133, John Wiley and Sons, 2001.
[13] A.Y. Zomaya, C. Ward, and B. Macey, “Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 8, pp. 795-812, Aug. 1999.
[14] B. Mei, P. Schaumont, and S. Vernalde, “A Hardware-Software Partitioning and Scheduling Algorithm for Dynamically Reconfigurable Embedded Systems,” Proc. ProRisc Workshop Circuits, Systems and Signal Processing, Nov. 2000.
[15] A. Orriols-Puig, K. Sastry, P.L. Lanzi, D.E. Goldberg, and E. Bernadó-Mansilla, “Modeling Selection Pressure in XCS for Proportionate and Tournament Selection,” Proc. Ninth Ann. Conf. Genetic and Evolutionary Computation (GECCO '07), pp. 1846-1853, July 2007.
[16] G. Govindu, R. Scrofano, and V.K. Prasanna, “A Library of Parameterizable Floating-Point Cores for FPGAs and their Application to Scientific Computing,” Proc. Int'l Conf. Eng. Reconfigurable Systems and Algorithms (ERSA '05), pp. 137-145, June 2005.
[17] L. Zhuo and V.K. Prasanna, “Scalable and Modular Algorithms for Floating-Point Matrix Multiplication on Reconfigurable Computing Systems,” IEEE Trans. Parallel Distributed Systems, vol. 18, no. 4, pp. 433-448, Apr. 2007.
[18] A.J. Thakkar and A. Ejnioui, “Design and Implementation of Double Precision Floating Point Division and Square Root on FPGAs,” Proc. IEEE Aerospace, Mar. 2006.
[19] K.S. Hemmert and K.D. Underwood, “Open Source High Performance Floating-Point Modules,” Proc. IEEE 14th Ann. Symp. Field-Programmable Custom Computing Machines (FCCM '06), pp. 349-350, Apr. 2006.
[20] A.A. Karatsuba and Y. Ofman, “Multiplication of Many-Digital Numbers by Automatic Computers,” Doklady Akad. Nauk SSSR, vol. 145, pp. 293-294, 1962.
[21] O. Sinnen, L.A. Sousa, and F.E. Sandnes, “Toward a Realistic Task Scheduling Model,” IEEE Trans. Parallel Distributed Systems, vol. 17, no. 3, pp. 263-275, Mar. 2006.
[22] A.Y. Zomaya and Y.-H. Teh, “Observations on Using Genetic Algorithms for Dynamic Load-Balancing,” IEEE Trans. Parallel Distributed Systems, vol. 12, no. 9, pp. 899-911, Sept. 2001.
41 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool