메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 39-44

Communication-driven task binding for multiprocessor with latency insensitive Network-on-Chip

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; MULTIPROCESSING SYSTEMS; NETWORK-ON-CHIP; PROGRAMMABLE LOGIC CONTROLLERS; REUSABILITY; SCHEDULING ALGORITHMS; SERVERS;

EID: 77955709745     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1120725.1120739     Document Type: Conference Paper
Times cited : (20)

References (21)
  • 5
    • 0036149420 scopus 로고    scopus 로고
    • Networks on chips: A new SoC paradigm
    • Luca Benini and Giovanni De Micheli, "Networks on chips: a new SoC paradigm," IEEE Computer Magazine, volume 35, issue l,pp. 70-78,2003.
    • (2003) IEEE Computer Magazine , vol.35 , Issue.1 , pp. 70-78
    • Benini, L.1    De Micheli, G.2
  • 12
    • 0036761284 scopus 로고    scopus 로고
    • Coping with latency in SOC design
    • Sept.-Oct
    • Luca P. Carloni and Alberto L. Sangiovanni-Vincentelli, "Coping with latency in SOC design," Micro, IEEE, Volume: 22, Issue: 5, Sept.-Oct. pp. 24 - 35, 2002.
    • (2002) Micro, IEEE , vol.22 , Issue.5 , pp. 24-35
    • Carloni, L.P.1    Sangiovanni-Vincentelli, A.L.2
  • 13
    • 84944322013 scopus 로고    scopus 로고
    • A two-step genetic algorithm for mapping task graphs to a network on chip architecture
    • Tang Lei and Shashi Kumar, "A two-step genetic algorithm for mapping task graphs to a network on chip architecture," in Proceedings of the Euromicro Symposium on Digital System Design, pp. 180- 187, 2003.
    • (2003) Proceedings of the Euromicro Symposium on Digital System Design , pp. 180-187
    • Lei, T.1    Kumar, S.2
  • 14
    • 0025448089 scopus 로고
    • Performance analysis of a k-ary n-cube interconnect networks
    • William J. Dally, "Performance analysis of a k-ary n-cube interconnect networks," in IEEE Transactions on Computers, pp. 775-785, 1990.
    • (1990) IEEE Transactions on Computers , pp. 775-785
    • Dally, W.J.1
  • 18
    • 84882536619 scopus 로고
    • An algorithm for path connections and its applications
    • C. Y. Lee, "An algorithm for path connections and its applications," in IRE Transactions Electron Computing, volume EC10, pp. 346-365, 1961.
    • (1961) IRE Transactions Electron Computing , vol.EC10 , pp. 346-365
    • Lee, C.Y.1
  • 19
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. Dijkstra, "A Note on Two Problems in Connexion with Graphs," in Numerical Math, volume 1, pp. 269-271, 1959.
    • (1959) Numerical Math , vol.1 , pp. 269-271
    • Dijkstra, E.1


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