메뉴 건너뛰기




Volumn , Issue , 2010, Pages 1267-1272

Coordinated resource optimization in behavioral synthesis

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL OPTIMIZATION; HIGH LEVEL SYNTHESIS; SCHEDULING;

EID: 77953117041     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/date.2010.5457001     Document Type: Conference Paper
Times cited : (11)

References (26)
  • 6
    • 34547187799 scopus 로고    scopus 로고
    • An efficient and versatile scheduling algorithm based on SDC formulation
    • J. Cong and Z. Zhang, "An efficient and versatile scheduling algorithm based on SDC formulation," in Proc. Design Automation Conf., 2006, pp. 433-438.
    • Proc. Design Automation Conf., 2006 , pp. 433-438
    • Cong, J.1    Zhang, Z.2
  • 7
    • 0035271966 scopus 로고    scopus 로고
    • Automata-based symbolic scheduling for looping dfgs
    • S. Haynal and F. Brewer, "Automata-based symbolic scheduling for looping dfgs ," IEEE Trans. on Computers, vol. 50, no. 3, pp. 250-267, 2001.
    • (2001) IEEE Trans. on Computers , vol.50 , Issue.3 , pp. 250-267
    • Haynal, S.1    Brewer, F.2
  • 9
    • 44949270448 scopus 로고
    • New methods for coloring and clique partitioning in data path allocation
    • D. Springer and D. E. Thomas, "New methods for coloring and clique partitioning in data path allocation," Integr. VLSI J., vol. 12, no. 3, pp. 267-292, 1991.
    • (1991) Integr. VLSI J. , vol.12 , Issue.3 , pp. 267-292
    • Springer, D.1    Thomas, D.E.2
  • 11
    • 0024138655 scopus 로고    scopus 로고
    • Splicer: A heuristic approach to connectivity binding
    • B. M. Pangre, "Splicer: a heuristic approach to connectivity binding;" in Proc. Design Automation Conf., 1988, pp. 536-541.
    • Proc. Design Automation Conf., 1988 , pp. 536-541
    • Pangre, B.M.1
  • 15
    • 0036722908 scopus 로고    scopus 로고
    • Interconnection optimization in data path allocation using minimal cost maximal flow algorithm
    • H. W. Zhu and C. C. Jong, "Interconnection optimization in data path allocation using minimal cost maximal flow algorithm," Microelectronics Journal, vol. 33, no. 9, pp. 749-759, 2002.
    • (2002) Microelectronics Journal , vol.33 , Issue.9 , pp. 749-759
    • Zhu, H.W.1    Jong, C.C.2
  • 16
    • 34547302203 scopus 로고    scopus 로고
    • Platform-based resource binding using a distributed register-file microarchitecture
    • J. Cong, Y. Fan, and W. Jiang, "Platform-based resource binding using a distributed register-file microarchitecture," in Proc. Int. Conf. on Computer Aided Design, 2006, pp. 709-715.
    • Proc. Int. Conf. on Computer Aided Design, 2006 , pp. 709-715
    • Cong, J.1    Fan, Y.2    Jiang, W.3
  • 18
    • 0031098179 scopus 로고    scopus 로고
    • A solution methodology for exact design space exploration in a three-dimensional design space
    • Mar.
    • S. Chaudhuri, S. Blthye, and R. Walker, "A solution methodology for exact design space exploration in a three-dimensional design space ," IEEE Trans. on Very Large Scale Integration Systems, vol. 5, no. 1, pp. 69-81, Mar. 1997.
    • (1997) IEEE Trans. on Very Large Scale Integration Systems , vol.5 , Issue.1 , pp. 69-81
    • Chaudhuri, S.1    Blthye, S.2    Walker, R.3
  • 19
    • 0024891467 scopus 로고    scopus 로고
    • Integrated scheduling and binding: A synthesis approach for design space exploration
    • M. Balakrishnan and P. Marwedel, " Integrated scheduling and binding: A synthesis approach for design space exploration;" in Proc. Design Automation Conf., Jun. 1989, pp. 68-74.
    • Proc. Design Automation Conf., Jun. 1989 , pp. 68-74
    • Balakrishnan, M.1    Marwedel, P.2
  • 21
    • 0026981974 scopus 로고    scopus 로고
    • Move frame scheduling and mixed scheduling-allocation for the automated synthesis of digital systems
    • M. Nourani and C. Papachristou, "Move frame scheduling and mixed scheduling-allocation for the automated synthesis of digital systems," in Proc. Design Automation Conf., 1992, pp. 99-105.
    • Proc. Design Automation Conf., 1992 , pp. 99-105
    • Nourani, M.1    Papachristou, C.2
  • 24
    • 33644911751 scopus 로고    scopus 로고
    • Optimal register allocation for ssa-form programs in polynomial time
    • May
    • S. Hack and G. Goos, "Optimal register allocation for ssa-form programs in polynomial time," Information Processing Letters , vol. 98, no. 4, pp. 150-155, May 2006.
    • (2006) Information Processing Letters , vol.98 , Issue.4 , pp. 150-155
    • Hack, S.1    Goos, G.2
  • 26
    • 77953109089 scopus 로고    scopus 로고
    • http://www.c-to-verilog.com.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.