skip to main content
research-article

UNTANGLED: A Game Environment for Discovery of Creative Mapping Strategies

Published:01 October 2013Publication History
Skip Abstract Section

Abstract

The problem of creating efficient mappings of dataflow graphs onto specific architectures (i.e., solving the place and route problem) is incredibly challenging. The difficulty is especially acute in the area of Coarse-Grained Reconfigurable Architectures (CGRAs) to the extent that solving the mapping problem may remove a significant bottleneck to adoption. We believe that the next generation of mapping algorithms will exhibit pattern recognition, the ability to learn from experience, and identification of creative solutions, all of which are human characteristics. This manuscript describes our game UNTANGLED, developed and fine-tuned over the course of a year to allow us to capture and analyze human mapping strategies. It also describes our results to date. We find that the mapping problem can be crowdsourced very effectively, that players can outperform existing algorithms, and that successful player strategies share many elements in common. Based on our observations and analysis, we make concrete recommendations for future research directions for mapping onto CGRAs.

Skip Supplemental Material Section

Supplemental Material

References

  1. Adya, S., Chaturvedi, S., Roy, J., Papa, D., and Markov, I. 2004. Unification of partitioning, placement and floorplanning. In Proceedings of the IEEE/ACM International Conference on Computer Aided Design (ICCAD’04). 550--557. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Agnihotri, A. and Madden, P. 2007. Fast analytic placement using minimum cost flow. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC’07). 128--134. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Agnihotri, A. R., Ono, S., and Madden, P. H. 2005. Recursive bisection placement: Feng shui 5.0 implementation details. In Proceedings of the International Symposium on Physical Design (ISPD’05). ACM, New York, NY, 230--232. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Ahn, M., Yoon, J. W., Paek, Y., Kim, Y., Kiemb, M., and Choi, K. 2006. A spatial mapping algorithm for heterogeneous coarse-grained reconfigurable architectures. In Proceedings of the Conference on Design, Automation and Test in Europe. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Ambinder, M. 2009. Valve’s approach to playtesting: The application of empricisim. In Proceedings of the Game Developer’s Conference.Google ScholarGoogle Scholar
  6. Bachmaier, C., Brandenburg, F., Brunner, W., and Hübner, F. 2010. A global k-level crossing reduction algorithm. In WALCOM: Algorithms and Computation, Lecture Notes in Computer Science, vol. 5942, Springer-Verlag, Berlin, 70--81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Bansal, N., Gupta, S., Dutt, N., Nicolau, A., and Gupta, R. 2004. Network topology exploration of mesh-based coarse-grain reconfigurable architectures. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE’04). 474--479. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Bertacco, V. 2012. Humans for EDA and EDA for humans. In Proceedings of the 49th Annual Design Automation Conference. ACM, 729--733. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Betz, V. 1997. VPR: A new packing, placement and routing tool for FPGA research. In Field-Programmable Logic and Applications, Lecture Notes in Computer Science, vol. 1304, Springer-Verlag, Berlin, 213--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Bian, H., Ling, A. C., Choong, A., and Zhu, J. 2010. Towards scalable placement for FPGAs. In Proceedings of the 18th Annual ACM/SIGDA International Conference on Field Programmable Gate Arrays (FPGA’10), 147--156. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Bouwens, F., Berekovic, M., Kanstein, A., and Gaydadjiev, G., Eds. 2007. Architecture exploration of the ADRES coarse-grained reconfigurable array. In Reconfigurable Computing: Architectures, Tools and Applications, Lecture Notes in Computer Science, vol. 4419, Springer-Verlag, Berlin, 1--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Bouwens, F., Berekovic, M., De Sutter, B., and Gaydadjiev, G. 2008. Architecture enhancements for the ADRES coarse-grained reconfigurable array. In Proceedings of the 3rd International Conference on High Performance Embedded Architectures and Compilers (HiPEAC’08). 66--81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Cadambi, S. and Goldstein, S. C. 2000. Efficient place and route for pipeline reconfigurable architectures. In Proceedings of the International Conference on Computer Design (ICCD’00). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Chen, D., Cong, J., and Pan, P. 2006. FPGA design automation: A survey. Found. Trends Electr. Des. Autom. 1, 3, 195--334. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Chen, T. C., chang Hsu, T., wei Jiang, Z., and wen Chang, Y. 2005. Abstract NTUplace: A ratio partitioning based placement algorithm for large-scale mixed-size designs. In Proceedings of the International Symposium on Physical Design (ISPD’05). 23--38. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Chen, T.-C., Jiang, Z.-W., Hsu, T.-C., Chen, H.-C., and Chang, Y.-W. 2008. NTUplace3: An analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints. IEEE Trans. Comput.-Aid. Des. Integr. Circuits Syst. 27, 7, 1228--1240. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Choi, K. 2011. Coarse-grained reconfigurable array: Architecture and application mapping. IPSJ Trans. Syst. LSI Des. Methodol. 4, 31--46.Google ScholarGoogle ScholarCross RefCross Ref
  18. Coffman, E. and Graham, R. 1972. Optimal scheduling for two-processor systems. Acta Informatica 1, 3, 200--213.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Compton, K. and Hauck, S. 2002. Reconfigurable computing: A survey of systems and software. ACM Comput. Surv. 34, 2, 171--210. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Cong, J. 2011a. Era of customization and implications to EDA. In Proceedings of the 48th Annual Design Automation Conference (DAC). (Keynote Speech).Google ScholarGoogle Scholar
  21. Cong, J. 2011b. Era of customization and specialization. In Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP). (Keynote Speech). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Cong, J., Shinnerl, J. R., Xie, M., Kong, T., and Yuan, X. 2005. Large-scale circuit placement. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 10, 2, 389--430. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Cooper, S., Khatib, F., Treuille, A., Barbero, J., Lee, J., Beenen, M., Leaver-Fay, A., Baker, D., and Popović, Z. 2010a. Predicting protein structures with a multiplayer online game. Nature 466.Google ScholarGoogle Scholar
  24. Cooper, S., Treuille, A., Barbero, J., Leaver-Fay, A., Tuite, K., Khatib, F., Snyder, A. C., Beenen, M., Salesin, D., Baker, D., and Popović, Z. 2010b. The challenge of designing scientific discovery games. In Proceedings of the 5th International Conference on the Foundations of Digital Games (FDG’10). ACM, New York, NY, 40--47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. DeOrio, A. and Bertacco, V. 2009. Human computing for EDA. In Proceedings of the 46th ACM/IEEE Design Automation Conference (DAC’09). IEEE, 621--622. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Dimitroulakos, G., Georgiopoulos, S., Galanis, M. D., and Goutis, C. E. 2009. Resource aware mapping on coarse grained reconfigurable arrays. Microprocess. Microsyst. 33, 2, 91--105. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Ebeling, C., Cronquist, D., and Franklin, P. 1996. RaPiD - Reconfigurable pipelined datapath. In Field-Programmable Logic Smart Applications, New Paradigms and Compilers, Lecture Notes in Computer Science, vol. 1142, Springer-Verlag, Berlin, 126--135. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Eiglsperger, M., Siebenhaller, M., and Kaufmann, M. 2005. An efficient implementation of Sugiyama’s algorithm for layered graph drawing. J. Graph Algor. Appl. 9, 3, 305--325.Google ScholarGoogle ScholarCross RefCross Ref
  29. Ferreira, R., Garcia, A., and Teixeira, T. 2007. A polynomial placement algorithm for data driven coarse-grained reconfigurable architectures. In Proceedings of the IEEE Annual Symposium on VLSI (ISVLSI’07), 61--66. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Friedman, S., Carroll, A., Essen, B. V., Ylvisaker, B., Ebeling, C., and Hauck, S. 2009. SPR:AN architecture-adaptive cgra mapping tool. In Proceedings of the ACM/SIGDA International Conference on Field Programmable Gate Arrays (FPGA). Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Fullerton, T. 2008. Game Design Workshop: A Playcentric Approach to Creating Innovative Games. 1st Ed. Morgan Kaufmann, Burlington, MA.Google ScholarGoogle ScholarCross RefCross Ref
  32. Garey, M. and Johnson, D. 1983. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4, 3, 312.Google ScholarGoogle ScholarCross RefCross Ref
  33. Gehring, S. W. and Ludwig, S. H.-M. 1998. Fast integrated tools for circuit design with FPGAs. In Proceedings of the ACM/SIGDA International Conference on Field Programmable Gate Arrays (FPGA’98). 133--139. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Geiger, D., Seedorf, S., Schulze, T., Nickerson, R., and Schader, M. 2011. Managing the crowd: Towards a taxonomy of crowdsourcing processes. In Proceedings of the 17th Americas Conference on Information Systems. 1--11.Google ScholarGoogle Scholar
  35. Goldstein, S., Schmit, H., Moe, M., Budiu, M., Cadambi, S., Taylor, R., and Laufer, R. 1999. Piperench: A coprocessor for streaming multimedia acceleration. In Proceedings of the 26th International Symposium on Computer Architecture. 28--39. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Goldstein, S. C., Schmit, H., Budiu, M., Cadambi, S., Moe, M., and Taylor, R. 2000. Piperench: A reconfigurable architecture and compiler. IEEE Comput. 33, 4. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Hamzeh, M., Shrivastava, A., and Vrudhula, S. 2012. Epimap: Using epimorphism to map applications on CGRAS. In Proceedings of the 49th Annual Design Automation Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Hartenstein, R. 2001a. A decade of reconfigurable computing: A visionary retrospective. In Proceedings of the Design, Automation and Test in Europe. 642--649. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Hartenstein, R. 2001b. Coarse grain reconfigurable architecture (embedded tutorial). In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC’01). ACM, New York, NY, 564--570. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Hartenstein, R., Herz, M., Hoffmann, T., and Nageldinger, U. 2000. KressArray Xplorer: A new CAD environment to optimize reconfigurable datapath array architectures. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC’00). 163--168. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Hauser, J. R. and Wawrzynek, J. 1997. GARP: A MIPS processor with a reconfigurable coprocessor. In Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines. K. L. Pocek and J. Arnold Eds., IEEE Computer Society Press, Los Alamitos, CA, 12--21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Healy, P. and Nikolov, N. S. 2012. Hierarchical drawing algorithms. In Handbook of Graph Drawing and Visualization, R. Tamassia Ed., CRC Press, Boca Raton, FL, Chapter 17.Google ScholarGoogle Scholar
  43. Ihrig, C. J., Baz, M., Stander, J., Hoare, R. R., Norman, B. A., Prokopyev, O., Hunsaker, B., and Jones, A. K. 2008. Greedy algorithms for mapping onto a coarse-grained reconfigurable fabric. In Advances in Greedy Algorithms, In-Tech, Vienna, Austria.Google ScholarGoogle Scholar
  44. Jones, A. K., Hoare, R., Kusic, D., Mehta, G., Fazekas, J., and Foster, J. 2006. Reducing power while increasing performance with supercisc. ACM Trans. Embed. Comput. Syst. 5, 3, 1--29. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Kahng, A. B. and Wang, Q. 2006. A faster implementation of aplace. In Proceedings of the International Symposium on Physical Design (ISPD’06). ACM, New York, NY, 218--220. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Kennerly, D. 2003. Better game design through data mining. http://www.gamasutra.com/view/feature/2816/better_game_design_through_data_.ph.Google ScholarGoogle Scholar
  47. Kim, Y. and Mahapatra, R. N. 2008. A new array fabric for coarse-grained reconfigurable architecture. In Proceedings of the 11th EUROMICO Conference on Digital System Design Architectures, Methods and Tools (DSD). 584--591. Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Kim, Y., Kiemb, M., Park, C., Jung, J., and Choi, K. 2005. Resource sharing and pipelining in coarse-grained reconfigurable architecture for domain-specific optimization. In Proceedings of the Conference on Design, Automation and Test in Europe. Vol. 1, 12--17. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Krzemien, J., DeOrio, A., and Bertacco, V. 2011. Funsat - multi-player. http://funsat.eecs.umich.edu/.Google ScholarGoogle Scholar
  50. Lambrechts, A., Raghavan, P., Jayapala, M., Catthoor, F., and Verkest, D. 2008. Energy-aware, interconnect optimization for a coarse grained reconfigurable processor. In Proceedings of the 21st International Conference on VLSI Design (VLSID’08). 201--207. Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Lanuzza, M., Perri, S., Corsonello, P., and Margala, M. 2007. A new reconfigurable coarse-grain architecture for multimedia applications. In Proceedings of the 2nd NASA/ESA Conference on Adaptive Hardware and Systems (AHS’07). 119--126. Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Lee, G., Lee, S., Choi, K., and Dutt, N. 2010. Routing-aware application mapping considering steiner points for coarse-grained reconfigurable architecture. In Reconfigurable Computing: Architectures, Tools and Applications. Lecture Notes in Computer Science, vol. 5992, Springer-Verlag, Berlin, 231--243. Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Levine, B. 2005. Kilocore: Scalable, high-performance, and power efficient coarse-grained reconfigurable fabrics. In Proceedings of the International Symposium on Advanced Reconfigurable Systems.Google ScholarGoogle Scholar
  54. Liang, C. and Huang, X.-M. 2009. Mapping parallel FFT algorithm onto smartcell coarse-grained reconfigurable architecture. In Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors (ASAP). 231--234. Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., and Thrun, S. 2008. Anytime search in dynamic graphs. Artif. Intell. J. 172, 14, 1613--1643. Google ScholarGoogle ScholarDigital LibraryDigital Library
  56. Luo, T. and Pan, D. Z. 2008. Dplace2.0: A stable and efficient analytical placement based on diffusion. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC’08). IEEE Computer Society Press, Los Alamitos, CA, 346--351. Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Malone, T. W. 1980. What makes things fun to learn? Heuristics for designing instructional computer games. In Proceedings of the 3rd ACM SIGSMALL Symposium and the 1st SIGPC Symposium on Small Systems. ACM, 162--169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. Matuszewski, C., Schönfeld, R., and Molitor, P. 1999. Using sifting for k-layer straightline crossing minimization. In Graph Drawing. Lecture Notes in Computer Science, vol. 1731, Springer-Verlag, Berlin, 217--224.Google ScholarGoogle Scholar
  59. Mehta, G., Patel, K., Parde, N., and Pollard, N. S. 2013. Data-driven mapping using local patterns. Tech. rep. UNT-EE-TR-01, Department of Electrical Engineering, University of North Texas, Denton, TX.Google ScholarGoogle Scholar
  60. Mirsky, E. and Dehon, A. 1996. Matrix: A reconfigurable computing architecture with configurable instruction distribution and deployable resources. In Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines (FCCM).Google ScholarGoogle Scholar
  61. Miyamori, T. and Olukotun, K. 1998. Remarc: Reconfigurable multimedia array coprocessor. IEICE Trans. Inf. Syst. E82-D, 389--397.Google ScholarGoogle Scholar
  62. Park, H., Fan, K., Mahlke, S. A., Oh, T., Kim, H., and Kim, H.-S. 2008. Edge-centric modulo scheduling for coarse-grained reconfigurable architectures. In Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques (PACT’08). 166--176. Google ScholarGoogle ScholarDigital LibraryDigital Library
  63. Quinn, A. J. and Bederson, B. B. 2011. Human computation: A survey and taxonomy of a growing field. In Proceedings of the Annual Conference on Human Factors in Computing Systems. ACM, 1403--1412. Google ScholarGoogle ScholarDigital LibraryDigital Library
  64. Ramey, J., Boren, T., Cuddihy, E., Dumas, J., Guan, Z., van den Haak, M. J., and De Jong, M. D. T. 2006. Does think aloud work?: How do we know? In Proceedings of the Extended Abstracts on Human Factors in Computing Systems (CHI EA’06). ACM, New York, NY, 45--48. Google ScholarGoogle ScholarDigital LibraryDigital Library
  65. Resende, M. and Rieiro, C. 2008. Greedy randomized adaptive search procedures. In Handbook of Metaheuristics 2nd Ed. International Series in Operations Research and Management Series, vol. 57, Springer, New York, NY, 219--249.Google ScholarGoogle Scholar
  66. Sankar, Y. and Rose, J. 1999. Trading quality for compile time: Ultra-fast placement for FPGAs. In Proceedings of the ACM/SIGDA 7th International Conference on Field Programmable Gate Arrays (FPGA’99). 157--166. Google ScholarGoogle ScholarDigital LibraryDigital Library
  67. Sechen, C. and Sangiovanni-Vincentelli, A. 1985. The timberwolf placement and routing package. IEEE J. Solid-State Circuits, 20, 2, 510--522.Google ScholarGoogle ScholarCross RefCross Ref
  68. Singh, H., Lee, M.-H., Lu, G., Kurdahi, F. J., Bagherzadeh, N., Lang, T., Heaton, R., and Filho, E. M. C. 1998. Morphosys: An integrated re-configurable architecture. In Proceedings of the NATO RTO Symposium on System Concepts and Integration.Google ScholarGoogle Scholar
  69. Singh, H., Lee, M.-H., Lu, G., Kurdahi, F. J., Bagherzadeh, N., and Filho, E. M. C. 2000. Morphosys: An integrated reconfigurable system for data-parallel and computation-intensive applications. IEEE Trans. Comput. 49, 5, 465--481. Google ScholarGoogle ScholarDigital LibraryDigital Library
  70. Sugiyama, K., Tagawa, S., and Toda, M. 1981. Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man, Cybernet. 11, 2, 109--125.Google ScholarGoogle ScholarCross RefCross Ref
  71. Sunstein, C. R. 2006. Infotopia: How Many Minds Produce Knowledge. Oxford University Press, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  72. Surowiecki, J. 2005. The wisdom of crowds. Anchor, Harpswell, ME. Google ScholarGoogle ScholarDigital LibraryDigital Library
  73. Taghavi, T., Yang, X., and Choi, B.-K. 2005. Dragon2005: Large-scale mixed-size placement tool. In Proceedings of the International Symposium on Physical Design (ISPD’05). ACM, New York, NY, 245--247. Google ScholarGoogle ScholarDigital LibraryDigital Library
  74. Taylor, M., Psota, J., Saraf, A., Shnidman, N., Strumpen, V., Frank, M., Amarasinghe, S., Agarwal, A., Lee, W., Miller, J., Wentzlaff, D., Bratt, I., Greenwald, B., Hoffmann, H., Johnson, P., and Kim, J. 2004. Evaluation of the raw microprocessor: An exposed-wire-delay architecture for ilp and streams. In Proceedings of the 31st Annual International Symposium on Computer Architecture. 2--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  75. Tehre, V. and Kshirsagar, R. 2012. Survey on coarse grained reconfigurable architectures. Int. J. Comput. Appl. 48, 16.Google ScholarGoogle Scholar
  76. Terry, L., Roitch, V., Tufail, S., Singh, K., Taraq, O., Luk, W., and Jamieson, P. 2009. Harnessing human computation cycles for the FPGA placement problem. In Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA’09), T. P. Plaks Ed., CSREA Press, Athen, GA, 188--194.Google ScholarGoogle Scholar
  77. The Assembly Line. 1989. Pipe mania. http://en.wikipedia.org/wiki/Pipe_Mania.Google ScholarGoogle Scholar
  78. Theodoridis, G., Soudris, D., and Vassiliadis, S. 2008. A survey of coarse-grain reconfigurable architectures and cad tools. In Fine- and Coarse-Grain Reconfigurable Computing, S. Vassiliadis and D. Soudris Eds., Springer Netherlands, Dordrecht, 89--149.Google ScholarGoogle Scholar
  79. Viswanathan, N. and Chu, C.-N. 2005. FastPlace: Efficient analytical placement using cell shifting, iterative local refinement,and a hybrid net model. IEEE Trans. Comput.-Aid. Des. 24, 5, 722--733. Google ScholarGoogle ScholarDigital LibraryDigital Library
  80. von Ahn, L. and Dabbish, L. 2004. Labeling images with a computer game. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI’04). ACM, 319--326. Google ScholarGoogle ScholarDigital LibraryDigital Library
  81. von Ahn, L. and Dabbish, L. 2008. Designing games with a purpose. Comm. ACM 51, 8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  82. von Ahn, L., Blum, M., and Langford, J. 2004. Telling humans and computers apart automatically. Comm. ACM, 56--60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  83. von Ahn, L., Liu, R., and Blum, M. 2006. Peekaboom: A game for locating objects in images. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI’06). ACM, 55--64. Google ScholarGoogle ScholarDigital LibraryDigital Library
  84. Waingold, E., Taylor, M., Srikrishna, D., Sarkar, V., Lee, W., Lee, V., Kim, J., Frank, M., Finch, P., Barua, R., Babb, J., Amarasinghe, S., and Agarwal, A. 1997. Baring it all to software: Raw machines. Comput. 30, 9, 86--93. Google ScholarGoogle ScholarDigital LibraryDigital Library
  85. Webster, J. 1988. 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 (SIGCPR’88). ACM, 78--87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  86. Wing, J. M. 2006. Computational thinking. Comm. ACM 49, 3, 33. Google ScholarGoogle ScholarDigital LibraryDigital Library
  87. Yoon, J., Shrivastava, A., Park, S., Ahn, M., and Paek, Y. 2009. A graph drawing based spatial mapping algorithm for coarse-grained reconfigurable architectures. IEEE Trans. (VLSI) Syst. 17, 11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  88. Yoon, J. W., Shrivastava, A., Park, S., Ahn, M., and Jeyapaul, R. 2008. SPKM: A novel graph drawing based algorithm for application mapping onto coarse-grained reconfigurable architectures. In Proceedings of the Asia and South Pacific Design Automation Conference. 776--782. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. UNTANGLED: A Game Environment for Discovery of Creative Mapping Strategies

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!