메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 497-502

Memory optimal single appearance schedule with dynamic loop count for synchronous dataflow graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; SCHEDULING;

EID: 33748587272     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1118299.1118420     Document Type: Conference Paper
Times cited : (15)

References (13)
  • 1
    • 0037979615 scopus 로고    scopus 로고
    • Synopsys Inc. 700 E. Middlefield Rd. Mountain View,CA94043, USA
    • COSSAP User's Manual. Synopsys Inc. 700 E. Middlefield Rd. Mountain View,CA94043, USA.
    • COSSAP User's Manual
  • 2
    • 0030651952 scopus 로고    scopus 로고
    • Data memory minimization for synchronous data flow graphs emulated on dsp-fpga targets
    • June
    • M. Ade, R. Lauwereins, and J. A. Peperstraete. Data memory minimization for synchronous data flow graphs emulated on dsp-fpga targets. In DAC, June 1997.
    • (1997) DAC
    • Ade, M.1    Lauwereins, R.2    Peperstraete, J.A.3
  • 3
    • 0032648555 scopus 로고    scopus 로고
    • Synthesis of embedded software from synchronous dataflow specifications
    • June
    • S. S. Bhattacharyya, P. K. Murthy, and E. A. Lee. Synthesis of embedded software from synchronous dataflow specifications. In Journal of VLSI Signal Processing, volume 21, pages 151-166, June 1999.
    • (1999) Journal of VLSI Signal Processing , vol.21 , pp. 151-166
    • Bhattacharyya, S.S.1    Murthy, P.K.2    Lee, E.A.3
  • 7
    • 0023138886 scopus 로고
    • Static scheduling of synchronous dataflow programs for digital signal processing
    • January
    • E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous dataflow programs for digital signal processing. In IEEE Transaction on Computer, volume C-36, pages 24-35, January 1987.
    • (1987) IEEE Transaction on Computer , vol.C-36 , pp. 24-35
    • Lee, E.A.1    Messerschmitt, D.G.2
  • 10
    • 33748586389 scopus 로고    scopus 로고
    • Single appearance schedlue with dyanmic loop count for sy
    • Sept
    • H. Oh, N. Dutt, and S. Ha. Single appearance schedlue with dyanmic loop count for sy. In CASES2005, volume 2005, pages 514-529, Sept 2005.
    • (2005) CASES2005 , vol.2005 , pp. 514-529
    • Oh, H.1    Dutt, N.2    Ha, S.3
  • 11
    • 0037870809 scopus 로고    scopus 로고
    • Memory-optimized software synthesis from dataflow program graphs with large size data samples
    • May
    • H. Oh and S. Ha. Memory-optimized software synthesis from dataflow program graphs with large size data samples. In EURASIP Journal on Applied Signal Processing, volume 2003, pages 514-529, May 2003.
    • (2003) EURASIP Journal on Applied Signal Processing , vol.2003 , pp. 514-529
    • Oh, H.1    Ha, S.2
  • 12
    • 0028996809 scopus 로고
    • Scheduling for optimum data memory compaction in block diagram oriented software synthesis
    • May
    • S. Ritz, M. Willems, and H. Meyr. Scheduling for optimum data memory compaction in block diagram oriented software synthesis. In Proceedings of the ICASSP 95, May 1995.
    • (1995) Proceedings of the ICASSP 95
    • Ritz, S.1    Willems, M.2    Meyr, H.3
  • 13
    • 0034289987 scopus 로고    scopus 로고
    • Memory efficient software synthesis using mixed coding style from dataflow graph
    • October
    • W. Sung and S. Ha. Memory efficient software synthesis using mixed coding style from dataflow graph. In IEEE Transaction on VLSI Systems, volume 8, pages 522-526, October 2000.
    • (2000) IEEE Transaction on VLSI Systems , vol.8 , pp. 522-526
    • Sung, W.1    Ha, S.2


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