OpenRCL: Low-power high-performance computing with reconfigurable devices

Proceedings - 2010 International Conference on Field Programmable Logic and Applications, FPL 2010

Volumn , Issue , 2010, Pages 458-463

  Lin, Mingjie ^a   Lebedev, Ilia ^a   Wawrzynek, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATAFLOW; DISTRIBUTED MEMORY; EXECUTION MODEL; HARDWARE STRUCTURES; HIGH-PERFORMANCE COMPUTING; IMPERATIVE PROGRAMMING LANGUAGES; LOW POWER; MANY-CORE ARCHITECTURE; MULTI-THREADING; PARALLEL PREFIX; POWER CONSUMPTION; POWER EFFICIENCY; PROCESSING NODES; PROTOTYPE MACHINE; RECONFIGURABLE COMPUTING; RECONFIGURABLE DEVICES; RESOURCE CONTROL; RUNTIMES; VIRTUAL MACHINES;

MEMORY ARCHITECTURE; MULTITASKING; PROBLEM ORIENTED LANGUAGES; PROGRAM COMPILERS; SYSTEMS ANALYSIS;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 79951763152     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FPL.2010.93     Document Type: Conference Paper

References (15)

1. Khronos OpenCL Working Group, The OpenCL Specification, version 1.0.29, 8 December 2008. [Online]. Available: http://khronos.org/registry/cl/specs/ opencl-1.0.29.pdf
2. C. Lattner and V. Adve, "LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation," in Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO'04), Palo Alto, California, Mar 2004.
3. Wikipedia, "C-to-hdl," Nov. 2009. [Online]. Available: http://en.wikipedia.org/wiki/CtoHDL
4. M. Lin, I. Lebedev, and J. Wawrzynek, "High-throughput bayesian computing machine with reconfigurable hardware," in FPGA '10: Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays. New York, NY, USA: ACM, 2010, pp. 73-82.
5. R. Barua, W. Lee, S. Amarasinghe, and A. Agarwal, "Memory bank disambiguation using modulo unrolling for raw machines," in High Performance Computing, 1998. HIPC '98. 5th International Conference On, Dec 1998, pp. 212-220.
6. J. R. Ellis, "Bulldog: a compiler for vliw architectures (parallel computing, reduced-instruction-set, trace scheduling, scientific)," Ph.D. dissertation, New Haven, CT, USA, 1985.
7. A. Gerasoulis and T. Yang, "On the granularity and clustering of directed acyclic task graphs," IEEE Trans. Parallel Distrib. Syst., vol. 4, no. 6, pp. 686-701, 1993. (Pubitemid 23709227)
8. T. Yang, C. Fu, A. Gerasoulis, and V. Sarkar, "Mapping iterative task graphs on distributed memory machines," in Proc. 24th International Conference on Parallel Processing, 1995, pp. 151-158.
9. H. Stone, "Multiprocessor scheduling with the aid of network flow algorithms," Software Engineering, IEEE Transactions on, vol. SE-3, no. 1, pp. 85-93, Jan. 1977.
10. O. Sinnen, Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing). Wiley-Interscience, 2007.
11. A. Munier, M. Queyranne, and A. Schulz, "Approximation bounds for a general class of precedence constrained parallel machine scheduling problems," in Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science. Springer, 1998, pp. 367-382. (Pubitemid 128093742)
12. K. E. Iverson, A programming language. New York, NY, USA: John Wiley & Sons, Inc., 1962.
13. G. E. Blelloch, "Prefix sums and their applications," School of Computer Science, Carnegie Mellon University, Tech. Rep. CMU-CS-90-190, Nov. 1990.
14. Y. Dotsenko, N. K. Govindaraju, P.-P. Sloan, C. Boyd, and J. Manferdelli, "Fast scan algorithms on graphics processors," in ICS '08: Proceedings of the 22nd annual international conference on Supercomputing. New York, NY, USA: ACM, 2008, pp. 205-213.
15. L. Shang, A. S. Kaviani, and K. Bathala, "Dynamic power consumption in Virtex-II FPGA family," in Proceedings of the 2002 ACM/SIGDA Tenth International Symposium on Field-Programmable Gate Arrays, 2002, pp. 157 - 164.