Page 70 - 《软件学报》2024年第6期

2646 软件学报 2024 年第 35 卷第 6 期

source research framework for the high-level synthesis of complex applications. In: Proc. of the 58th ACM/IEEE Design Automation
Conf. (DAC). San Francisco: IEEE, 2021. 1327–1330. [doi: 10.1109/DAC18074.2021.9586110]
[7] Canis A, Choi J, Aldham M, Zhang V, Kammoona A, Czajkowski T, Brown SD, Anderson JH. LegUp: An open-source high-level
synthesis tool for FPGA-based processor/accelerator systems. ACM Trans. on Embedded Computing Systems, 2013, 13(2): 24. [doi: 10.
1145/2514740]
[8] Brisk P, Dabiri F, Jafari R, Sarrafzadeh M. Optimal register sharing for high-level synthesis of SSA form programs. IEEE Trans. on
Computer-aided Design of Integrated Circuits and Systems, 2006, 25(5): 772–779. [doi: 10.1109/TCAD.2006.870409]
[9] Rim M, Mujumdar A, Jain R, De Leone R. Optimal and heuristic algorithms for solving the binding problem. IEEE Trans. on Very Large
Scale Integration (VLSI) Systems, 1994, 2(2): 211–225. [doi: 10.1109/92.285747]
[10] Kum KI, Sung W. Combined word-length optimization and high-level synthesis of digital signal processing systems. IEEE Trans. on
Computer-aided Design of Integrated Circuits and Systems, 2001, 20(8): 921–930. [doi: 10.1109/43.936374]
[11] Cong J, Fan YP, Han GL, Lin YZ, Xu JJ, Zhang ZR, Cheng X. Bitwidth-aware scheduling and binding in high-level synthesis. In: Proc.
of the 2005 Asia and South Pacific Design Automation Conf. Shanghai: IEEE, 2005. 856–861. [doi: 10.1109/ASPDAC.2005.1466476]
[12] Wu Q, Bian JN, Xue HX. Scheduling with resource allocation for system-level synthesis. Ruan Jian Xue Bao/Journal of Software, 2007,
18(2): 220–228 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/18/220.htm [doi: 10.1360/jos180220]

[13] Canesche M, Ferreira R, Nacif JA, Quintão Pereira FM. A polynomial time exact solution to the bit-aware register binding problem. In:
Proc. of the 31st ACM SIGPLAN Int’l Conf. on Compiler Construction. Seoul: ACM, 2022. 29–40. [doi: 10.1145/3497776.3517773]
[14] Lattner C, Adve V. LLVM: A compilation framework for lifelong program analysis & transformation. In: Proc. of the 2004 Int’l Symp.
on Code Generation and Optimization. San Jose: IEEE, 2004. 75–86. [doi: 10.1109/CGO.2004.1281665]
[15] Guthaus MR, Ringenberg JS, Ernst D, Austin TM, Mudge T, Brown RB. MiBench: A free, commercially representative embedded
benchmark suite. In: Proc. of the 4th Annual IEEE Int’l Workshop on Workload Characterization. Austin: IEEE, 2001. 3–14. [doi:
10.1109/WWC.2001.990739]
[16] Zhou Y, Gupta U, Dai S, Zhao R, Srivastava N, Jin HC, Featherston J, Lai YH, Liu G, Velasquez GA, Wang WP, Zhang ZR. Rosetta: A
realistic high-level synthesis benchmark suite for software programmable FPGAs. In: Proc. of the 2018 ACM/SIGDA Int’l Symp. on
Field-programmable Gate Arrays. Monterey: ACM, 2018. 269–278. [doi: 10.1145/3174243.3174255]
[17] Cong J, Liu B, Neuendorffer S, Noguera J, Vissers K, Zhang ZR. High-level synthesis for FPGAs: From prototyping to deployment.
IEEE Trans. on Computer-aided Design of Integrated Circuits and Systems, 2011, 30(4): 473–491. [doi: 10.1109/TCAD.2011.2110592]
[18] Nane R, Sima VM, Pilato C, Choi J, Fort B, Canis A, Chen YT, Hsiao H, Brown S, Ferrandi F. A survey and evaluation of FPGA high-
level synthesis tools. IEEE Trans. on Computer-aided Design of Integrated Circuits and Systems, 2016, 35(10): 1591–1604. [doi: 10.1109/
TCAD.2015.2513673]
[19] Canis A, Choi J, Aldham M, Zhang V, Kammoona A, Anderson JH, Brown S, Czajkowski T. LegUp: High-level synthesis for FPGA-
based processor/accelerator systems. In: Proc. of the 19th ACM/SIGDA Int’l Symp. on Field Programmable Gate Arrays. Monterey:
ACM, 2011. 33–36. [doi: 10.1145/1950413.1950423]
[20] Chaitin GJ, Auslander MA, Chandra AK, Cocke J, Hopkins ME, Markstein PW. Register allocation via coloring. Computer Languages,
1981, 6(1): 47–57. [doi: 10.1016/0096-0551(81)90048-5]
[21] Bouchez F, Darte A, Guillon C, Rastello F. Register allocation: What does the NP-completeness proof of Chaitin et al. really prove? Or
revisiting register allocation: Why and how. In: Proc. of the 19th Int’l Workshop on Languages and Compilers for Parallel Computing.
New Orleans: Springer, 2006. 283–298. [doi: 10.1007/978-3-540-72521-3_21]
[22] Hack S, Grund D, Goos G. Register allocation for programs in SSA-form. In: Proc. of the 15th Int’l Conf., CC 2006, Held as Part of the
Joint European Conf. on Theory and Practice of Software Compiler Construction. Vienna: Springer, 2006. 247–262. [doi: 10.1007/
11688839_20]
[23] Pereira FMQ, Palsberg J. Register allocation via coloring of chordal graphs. In: Proc. of the 3rd Asian Symp. on Programming Languages
and Systems. Tsukuba: Springer, 2005. 315–329. [doi: 10.1007/11575467_21]
[24] Yuan XL, Shen XB. A new register allocation algorithm. Chinese Journal of Computers, 1998, 21(S1): 68–72 (in Chinese with English
abstract). [doi: 10.3321/j.issn:0254-4164.1998.z1.013]
[25] Briggs P, Cooper KD, Torczon L. Improvements to graph coloring register allocation. ACM Trans. on Programming Languages and
Systems, 1994, 16(3): 428–455. [doi: 10.1145/177492.177575]
[26] Nandivada VK, Barik R. Improved bitwidth-aware variable packing. ACM Trans. on Architecture and Code Optimization, 2013, 10(3):
16. [doi: 10.1145/2509420.2509427]
[27] Tallam S, Gupta R. Bitwidth aware global register allocation. In: Proc. of the 30th ACM SIGPLAN-SIGACT Symp. on Principles of