메뉴 건너뛰기




Volumn , Issue , 2010, Pages 11-20

A new method for minimizing buffer sizes for cyclo-static dataflow graphs

Author keywords

Buffer minimization; Cyclo static dataflow graph; Linear programing; Periodic schedule; Streaming applications

Indexed keywords

BUFFER MINIMIZATION; CYCLO-STATIC DATAFLOW; LINEAR PROGRAMING; PERIODIC SCHEDULE; STREAMING APPLICATIONS;

EID: 78651395072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ESTMED.2010.5666980     Document Type: Conference Paper
Times cited : (23)

References (16)
  • 4
    • 34347324955 scopus 로고    scopus 로고
    • Exploiting the expressiveness of cyclo-static dataflow to model multimedia implementations
    • no. Article ID 84078, [Online]. Available
    • K. Denolf, M. Bekooij, J. Cockx, D. Verkest, and H. Corporaal, "Exploiting the expressiveness of cyclo-static dataflow to model multimedia implementations," EURASIP Journal on Advances in Signal Processing, no. Article ID 84078, p. 14 pages, 2007. [Online]. Available: http://dx.doi.org/10. 1155/2007/84078
    • (2007) EURASIP Journal on Advances in Signal Processing , pp. 14
    • Denolf, K.1    Bekooij, M.2    Cockx, J.3    Verkest, D.4    Corporaal, H.5
  • 5
    • 0032642997 scopus 로고    scopus 로고
    • Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
    • [Online]. Available: citeseer.ist.psu.edu/dasdan99efficient.html
    • A. Dasdan, S. Irani, and R. K. Gupta, "Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems," in Design Automation Conference, 1999, pp. 37-42. [Online]. Available: citeseer.ist.psu.edu/dasdan99efficient.html
    • Design Automation Conference, 1999 , pp. 37-42
    • Dasdan, A.1    Irani, S.2    Gupta, R.K.3
  • 8
    • 78651408702 scopus 로고    scopus 로고
    • Complexity results for weighted timed event graphs
    • O. Marchetti and A. Munier-Kordon, "Complexity results for weighted timed event graphs," Discrete Optimization, vol. 7, no. 3, pp. 166-180, 2010.
    • (2010) Discrete Optimization , vol.7 , Issue.3 , pp. 166-180
    • Marchetti, O.1    Munier-Kordon, A.2
  • 9
    • 51349095897 scopus 로고    scopus 로고
    • Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs
    • S. Stuijk, M. Geilen, and T. Basten, "Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs," IEEE Trans. Comput., vol. 57, no. 10, pp. 1331-1345, 2008.
    • (2008) IEEE Trans. Comput. , vol.57 , Issue.10 , pp. 1331-1345
    • Stuijk, S.1    Geilen, M.2    Basten, T.3


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