메뉴 건너뛰기




Volumn , Issue , 1993, Pages 285-296

Optimum vectorization of scalable synchronous dataflow graphs

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL ACTIVATION; DIGITAL SIGNAL PROCESSING; DIGITAL SIGNAL PROCESSORS; MULTITASKING; REAL TIME SYSTEMS; SEMANTICS;

EID: 85064643064     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASAP.1993.397152     Document Type: Conference Paper
Times cited : (59)

References (13)
  • 4
    • 0023138886 scopus 로고
    • Static scheduling of synchronous data flow programs for digital signal processing
    • January
    • E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing, " IEEE Trans, on Computers, vol. C-36, No. 1, pp. 24-35, January 1987.
    • (1987) IEEE Trans, on Computers , vol.C-36 , Issue.1 , pp. 24-35
    • Lee, E.A.1    Messerschmitt, D.G.2
  • 8
    • 0040157026 scopus 로고
    • The structure of an advanced retargetable vectorizer
    • Hwang(ed) IEEE Comp. Society Press, Los Alamitos, CA
    • D. Kuck, R. Kuhn, B. Leasure, and M. Wolfe, "The structure of an advanced retargetable vectorizer, " Hwang(ed), Supercomputers: Design and Applications, 1984. IEEE Comp. Society Press, Los Alamitos, CA.
    • (1984) Supercomputers: Design and Applications
    • Kuck, D.1    Kuhn, R.2    Leasure, B.3    Wolfe, M.4
  • 9
    • 85064697622 scopus 로고
    • Advanced compiler optimizations for supercomputers
    • December
    • D. Padua and M. Wolfe, "Advanced compiler optimizations for supercomputers, " Comm. ACM, December 1984.
    • (1984) Comm. ACM
    • Padua, D.1    Wolfe, M.2
  • 10
    • 0027812203 scopus 로고
    • Scheduling synchronous dataflow graphs for efficient looping
    • scheduled for publication
    • S. Bhattacharyya and E. Lee, "Scheduling synchronous dataflow graphs for efficient looping, " Journal of VLSI Signal Processing, 1993. scheduled for publication.
    • (1993) Journal of VLSI Signal Processing
    • Bhattacharyya, S.1    Lee, E.2
  • 11
    • 0001909598 scopus 로고
    • Finding all the elementary circuits of a directed graph
    • Mar
    • D. B. Johnson, "Finding all the elementary circuits of a directed graph, " SIAM J. on Computing, vol. 4, pp. 77-84, Mar 1975.
    • (1975) SIAM J. on Computing , vol.4 , pp. 77-84
    • Johnson, D.B.1
  • 13
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • R. Tarjan, "Depth-first search and linear graph algorithms, " SIAM J. on Computing, vol. 1, no. 2, pp. 146-160, 1972.
    • (1972) SIAM J. on Computing , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1


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