An Interactive Design Framework to Explore Fault-Tolerant and Low-Energy Reconfigurable Architectures
DOI:
https://doi.org/10.14738/aivp.93.10172Keywords:
Design Frameworks, Custom Reconfigurable Architectures, Reconfigurable Computing, Architecture ExplorationAbstract
Domain-specific customized reconfigurable architectures show great promise for low energy applications as they can be tailored according to the suite of applications. In order to design new optimized architectures, we need to be able to consider and evaluate tradeoffs, and explore design choices efficiently. In this paper, we present an interactive design framework to explore low energy and fault-tolerant reconfigurable architectures. This allows users to experiment their ideas, try out-of-the-box strategies, and analyze their results visually. This can help designers and researchers understand the bottlenecks and constraints of different approaches in a better way. This can also help students learn digital design and reconfigurable computing concepts in a fun and interactive way. The framework has two gameplay modes – single player and community play. In single player version, users can work on their individual levels where as community play allows users to build upon other users’ solutions. The game offers in-depth tutorials over the variety of gameplay elements as well as give users insight on how the game elements relate to the critical design concerns of reconfigurable architectures, such as, power, performance, area, and fault tolerance.
References
R. Hartenstein, T. Hoffmann, and U. Nageldinger, Design-Space Exploration of Low Power Coarse Grained Reconfigurable Datapath Array Architectures, Lecture Notes in Computer Science. Springer, 2000.
K. Karuri, A. Chattopadhyay, X. Chen, D. Kammler, L. Hao, R. Leupers, H. Meyr, and G. Ascheid, “A design flow for architecture exploration and implementation of partially reconfigurable processors,” Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, vol. 16, no. 10, pp. 1281 –1294, oct. 2008.
L. Bauer, M. Shafique, and J. Henkel, “Cross-architectural design space exploration tool for reconfigurable processors,” in Design, Automation Test in Europe Conference Exhibition, 2009. DATE ’09., april 2009, pp. 958 –Y. Kim, R. Mahapatra, and K. Choi, “Design space exploration for efficient resource utilization in coarse-grained reconfigurable architecture,” Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, vol. 18, no. 10, pp. 1471 –1482, oct. 2010.
G. Mehta, C. Crawford, X. Luo, N. Parde, K. Patel, B. Rodgers, A. K. Sistla, A. Yadav, and M. Reisner, “Untangled: A game environment for discovery of creative mapping strategies,” ACM Trans. Reconfigurable Technol. Syst., vol. 6, no. 3, pp. 13:1–13:26, Oct. 2013. [Online]. Available: http://doi.acm.org/10.1145/2517325
G. Mehta, K. Patel, N. Parde, and N. Pollard, “Data-driven mapping using local patterns,” Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol. 32, no. 11, pp. 1668–1681, 2013.
A. Sistla, N. Parde, K. Patel, and G. Mehta, “Cross-architectural study of custom reconfigurable devices using crowdsourcing,” in Parallel and Distributed Processing Symposium Workshops PhD Forum (IPDPSW), 2013 IEEE 27th International, 2013, pp. 222–230.
G. Mehta, K. Patel, and N. S. Pollard, “On fast iterative mapping algorithms for stripe based coarse-grained reconfigurable architectures,” Special Issue on Reconfigurable and Adaptive Computing, International Journal of Electronics, vol. 102, no. 1, pp. 3–17, 2015.
A. K. Sistla, K. Patel, and G. Mehta, “Crowdsourcing for mapping in design space exploration of custom reconfigurable architecture designs,” Human Computation Journal, vol. 2, no. 1, 2015.
A. Sistla, X. Luo, M. Malladi, M. Reisner, R. Ganduri, G. Mehta, “SmartBricks: A Visual Environment to Design and Explore Novel Custom Domain-Specific Architectures,” Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2014 IEEE International, IEEE, 2014.
“2012 international science & engineering visualization challenge,” http://www.sciencemag.org/site/special/vis2012/, Science, 2013.
“Winners of the 2012 international science & engineering visualization challenge,” http://www.nsf.gov/news/special reports/scivis/ winners 2012.jsp, National Science Foundation, 2013.
K. Choi, “Coarse-grained reconfigurable array: Architecture and application mapping,” IPSJ Transactions on System LSI Design Methodology, vol. 4, pp. 31–46, 2011.
G. Theodoridis, D. Soudris, and S. Vassiliadis, “A survey of coarsegrain reconfigurable architectures and cad tools,” in Fine- and CoarseGrain Reconfigurable Computing, S. Vassiliadis and D. Soudris, Eds. Springer Netherlands, 2008, pp. 89–149.
R. Hartenstein, “A decade of reconfigurable computing: a visionary retrospective,” Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001, pp. 642–649, 2001.
S. C. Goldstein, H. Schmit, M. Budiu, S. Cadambi, M. Moe, and R. Taylor, “Piperench: A reconfigurable architecture and compiler,” in IEEE Computer, vol. 33, no. 4, April 2000.
C. Ebeling, D. Cronquist, and P. Franklin, “RaPiD - Reconfigurable Pipelined Datapath,” Field-Programmable Logic Smart Applications, New Paradigms and Compilers, pp. 126–135, 1996.
E. Mirsky and A. Dehon, “Matrix: A reconfigurable computing architecture with configurable instruction distribution and deployable resources,” in Proc. of IEEE Symposium on FPGAs for Custom Computing Machines H. Singh, M.-H. Lee, G. Lu, F. J. Kurdahi, N. Bagherzadeh, and E. M. C. Filho, “Morphosys: An integrated reconfigurable system for data-parallel and computation-intensive applications,” IEEE Transactions on Computers, vol. 49, no. 5, pp. 465–481, 2000.
F. Bouwens, M. Berekovic, A. Kanstein, and G. Gaydadjiev, Eds., Architecture exploration of the ADRES coarsegrained reconfigurable array, ser. Reconfigurable Computing: Architectures, Tools and Applications. Springer, 2007.
M. Lanuzza, S. Perri, P. Corsonello, and M. Margala, “A new reconfigurable coarse-grain architecture for multimedia applications,” in Adaptive Hardware and Systems, 2007. AHS 2007. Second NASA/ESA Conference on, aug. 2007, pp. 119 –126.
Y. Kim and R. N. Mahapatra, “A new array fabric for coarse-grained reconfigurable architecture,” in DSD, 2008, pp. 584–591.
M. Garey and D. Johnson, “Crossing number is NP-complete,” SIAM Journal on Algebraic and Discrete Methods, vol. 4, no. 3, p. 312, 1983. [Online]. Available: http://link.aip.org/link/SJMAEL/v4/i3/p312/s1&Agg=doihttp://link.aip.org/link/?SJMAEL/4/312/1
R. Ferreira, A. Garcia, and T. Teixeira, “A polynomial placement algorithm for data driven coarse-grained reconfigurable architectures,” ISVLSI ’07, pp. 61–66, 2007. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4208895http://www.computer.org/portal/web/csdl/doi/10.1109/ISVLSI.2007.14
G. Dimitroulakos, S. Georgiopoulos, M. D. Galanis, and C. E. Goutis, “Resource aware mapping on coarse grained reconfigurable arrays,” Microprocessors and Microsystems, vol. 33, no. 2, pp. 91–105, Mar. 2009. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/ S0141933108000756
H. Park, K. Fan, S. A. Mahlke, T. Oh, H. Kim, and H.-S. Kim, “Edge-centric modulo scheduling for coarse-grained reconfigurable architectures,” in Proceedings of the 17th international conference on Parallel architectures and compilation techniques, ser. PACT ’08, 2008, pp. 166–176.
M. Hamzeh, A. Shrivastava, and S. Vrudhula, “Epimap: Using epimorphism to map applications on cgras,” in Design Automation Conference (DAC), 2012 49th ACM/EDAC/IEEE, 2012, pp. 1280–1287.
V. Betz, “VPR: A new packing, placement and routing tool for FPGA research,” Field-Programmable Logic and Applications, pp. 1–10, 1997. [Online]. Available: http://www.springerlink.com/index/ 1673hwlmm7720606.pdf
S. Friedman, A. Carroll, B. Van Essen, B. Ylvisaker, C. Ebeling, and S. Hauck, “Spr: an architecture-adaptive cgra mapping tool,” in Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays, ser. FPGA ’09. New York, NY, USA: ACM, 2009, pp. 191–200. [Online]. Available: http: //doi.acm.org/10.1145/1508128.1508158
T. Taghavi, X. Yang, and B.-K. choi, “Dragon2005: Large-scale mixed-size placement tool,” in Proceedings of the 2005 International Symposium on Physical design, ser. ISPD ’05, 2005, pp. 245–247.
C. Sechen and A. Sangiovanni-Vincentelli, “The timberwolf placement and routing package,” Solid-State Circuits, IEEE Journal of, vol. 20, no. 2, pp. 510 –522, april 1985.
G. Lee, S. Lee, K. Choi, and N. Dutt, “Routing-aware application mapping considering steiner points for coarsegrained reconfigurable architecture,” Reconfigurable Computing: Architectures, Tools and Applications, pp. 231–243, 2010. [Online]. Available: http://www. springerlink.com/index/tj4437u3k735303v.pdf
J. Yoon, A. Shrivastava, S. Park, M. Ahn, and Y. Paek, “A graph drawing based spatial mapping algorithm for coarse-grained reconfigurable architectures,” Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, J. Cong, J. R. Shinnerl, M. Xie, T. Kong, and X. Yuan, “Large-scale circuit placement,” ACM ToDAES, vol. 10, no. 2, pp. 389–430, Apr. 2005. [Online]. Available: http://portal.acm.org/citation.cfm? doid=1059876.1059886
A. R. Agnihotri, S. Ono, and P. H. Madden, “Recursive bisection placement: feng shui 5.0 implementation details,” in Proceedings of the 2005 international symposium on Physical design, ser. ISPD ’05, 2005, pp. 230–232. T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang, “Ntuplace3: An analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints,” Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol. 27, no. 7, pp. 1228 –1240, July 2008.
A. Agnihotri and P. Madden, “Fast analytic placement using minimum cost flow,” in Design Automation Conference, 2007. ASP-DAC ’07. Asia and South Pacific, jan. 2007, pp. 128 –134.
A. B. Kahng and Q. Wang, “A faster implementation of aplace,” in Proceedings of the 2006 international symposium on Physical design, ser. ISPD ’06. New York, NY, USA: ACM, 2006, pp. 218–220.
T. Luo and D. Z. Pan, “Dplace2.0: a stable and efficient analytical placement based on diffusion,” in Proceedings of the 2008 Asia and South Pacific Design Automation Conference, ser. ASP-DAC ’08, 2008, pp. 346–351.
N. Viswanathan and C.-N. Chu, “Fastplace: efficient analytical placement using cell shifting, iterative local refinement,and a hybrid net model,” Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol. 24, no. 5, pp. 722–733, 2005.
V. Tehre and R. Kshirsagar, “Survey on coarse grained reconfigurable architectures,” International Journal of Computer Applications, vol. 48, no. 16, June 2012.
N. Bansal, S. Gupta, N. Dutt, A. Nicolau, and R. Gupta, “Network topology exploration of mesh-based coarse-grain reconfigurable architectures,” in DATE ’04: Proceedings of the conference on Design, automation and test in Europe, 2004, p. 10474.
M. V. da Silva, R. Ferreira, A. Garcia, and J. M. P. Cardoso, “Mesh mapping exploration for coarse-grained reconfigurable array architectures,” in Reconfigurable Computing and FPGA’s, 2006. ReConFig 2006. IEEE International Conference on, sept. 2006, pp. 1 –10.
A. Lambrechts, P. Raghavan, M. Jayapala, F. Catthoor, and D. Verkest, “Energy-aware interconnect optimization for a coarse grained reconfigurable processor,” in VLSI Design, 2008. VLSID 2008. 21st International Conference on, jan. 2008, pp. 201 –207.
B. Mei, A. Lambrechts, J.-Y. Mignolet, D. Verkest, and R. Lauwereins, “Architecture exploration for a reconfigurable architecture template,” Design Test of Computers, IEEE, vol. 22, no. 2, pp. 90 – 101, marchapril 2005.
F. Bouwens, M. Berekovic, B. De Sutter, and G. Gaydadjiev, “Architecture enhancements for the adres coarsegrained reconfigurable array,” in Proceedings of the 3rd international conference on High performance embedded architectures and compilers, ser. HiPEAC’08, 2008, pp. 66–81.
J. Webster, “Making computer tasks at work more playful: Implications for systems analysts and designers,” in Proceedings of the ACM SIGCPR conference on Management of information systems personnel, ser. SIGCPR ’88. ACM, 1988, pp. 78–87.
T. W. Malone, “What makes things fun to learn? heuristics for designing instructional computer games,” in Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems. ACM, 1980, pp. 162–169.
J. Surowiecki, The wisdom of crowds. Random House Digital, Inc., 2005.
A. J. Quinn and B. B. Bederson, “Human computation: a survey and taxonomy of a growing field,” in Proceedings of the 2011 Annual Conference on Human factors in computing systems. ACM, 2011, pp. 1403–1412.
P. Michelucci, Handbook of human computation. Springer, 2013.
L. von Ahn and L. Dabbish, “Designing games with a purpose.” Communications of the ACM, vol. 51, no. 8, August 2008.
S. Cooper, F. Khatib, A. Treuille, J. Barbero, J. Lee, M. Beenen, A. Leaver-Fay, D. Baker, and Z. Popovic, “Predicting protein structures´ with a multiplayer online game,” Nature, vol. 466, August 2010.
S. Cooper, A. Treuille, J. Barbero, A. Leaver-Fay, K. Tuite, F. Khatib, A. C. Snyder, M. Beenen, D. Salesin, D. Baker, and Z. Popovic, “The´ challenge of designing scientific discovery games,” in Proceedings of the Fifth International Conference on the Foundations of Digital Games, ser. FDG ’10. New York, NY, USA: ACM, 2010, pp. 40–47. 92
A. DeOrio and V. Bertacco, “Human computing for eda,” in Design Automation Conference, 2009. DAC’09. 46th ACM/IEEE. IEEE, 2009, pp. 621–622.
V. Bertacco, “Humans for EDA and EDA for humans,” in Proceedings of the 49th Annual Design Automation Conference. ACM, 2012, pp. 729–733.
The Assembly Line, “Pipe mania,” 1989.
J. Krzemien, A. DeOrio, and V. Bertacco, “Funsat - multi-player,” http://funsat.eecs.umich.edu/, 2011.
L. Terry, V. Roitch, S. Tufail, K. Singh, O. Taraq, W. Luk, and P. Jamieson, “Harnessing human computation cycles for the fpga placement problem.” in ERSA, vol. 9, 2009, pp. 188–194.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 Zachary Simpson, Linh Nguyen, Natalie Drewfs, Gayatri Mehta
This work is licensed under a Creative Commons Attribution 4.0 International License.
