메뉴 건너뛰기




Volumn , Issue , 2009, Pages 44-53

Analysis of worst-case delay bounds for best-effort communication in wormhole networks on chip

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS MODELS; BEST-EFFORT COMMUNICATION; BUFFER SHARING; COMMUNICATION DELAYS; CREDIT-BASED FLOW CONTROL; CYCLIC DEPENDENCIES; DELAY BOUND; EFFECTIVE COMMUNICATION; LINK-SHARING; NETWORK CALCULUS; NETWORK CONTENTION; PACKET SWITCHED NETWORK; RESOURCE SHARING; SERVICE ANALYSIS; SHARING ANALYSIS; THEORETICAL BOUNDS; TREE MODELS; WORMHOLE NETWORKS;

EID: 70349820803     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NOCS.2009.5071444     Document Type: Conference Paper
Times cited : (86)

References (11)
  • 1
    • 70349803098 scopus 로고    scopus 로고
    • SoCLib simulation environment. On-line, available at https://www.soclib. fr/.
    • SoCLib simulation environment. On-line, available at https://www.soclib. fr/.
  • 2
    • 33745800231 scopus 로고    scopus 로고
    • A survey of research and practices of network-on-chip
    • T. Bjerregaard and S. Mahadevan. A survey of research and practices of network-on-chip. ACM Computing Survey, 38(1): 1-54, 2006.
    • (2006) ACM Computing Survey , vol.38 , Issue.1 , pp. 1-54
    • Bjerregaard, T.1    Mahadevan, S.2
  • 4
    • 27344456043 scopus 로고    scopus 로고
    • The Áthereal network on chip: Concepts, architectures, and implementations
    • Sept-Oct
    • K. Goossens, J. Dielissen, and A. Rǎdulescu. The Áthereal network on chip: Concepts, architectures, and implementations. IEEE Design and Test of Computers, 22(5):21-31, Sept-Oct 2005.
    • (2005) IEEE Design and Test of Computers , vol.22 , Issue.5 , pp. 21-31
    • Goossens, K.1    Dielissen, J.2    Rǎdulescu, A.3
  • 5
    • 24944454027 scopus 로고    scopus 로고
    • Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
    • J.-Y. Le Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Number 2050 in LNCS, 2004.
    • (2004) LNCS , Issue.2050
    • Le Boudec, J.-Y.1    Thiran, P.2
  • 6
    • 33745851161 scopus 로고    scopus 로고
    • Tight end-to-end per-flow delay bounds in fifo multiplexing sink-tree networks
    • L. Lenzini, L. Martorini, E. Mingozzi, and G. Stea. Tight end-to-end per-flow delay bounds in fifo multiplexing sink-tree networks. Perform. Eval, 63(9-10):956-987, 2006.
    • (2006) Perform. Eval , vol.63 , Issue.9-10 , pp. 956-987
    • Lenzini, L.1    Martorini, L.2    Mingozzi, E.3    Stea, G.4
  • 11
    • 0032182533 scopus 로고    scopus 로고
    • Latency-rate servers: A general model for analysis of traffic scheduling algorithms
    • October
    • D. Stiliadis and A. Varma. Latency-rate servers: A general model for analysis of traffic scheduling algorithms. IEEE/ACM Transactions on Networking, 6(5):611-624, October 1998.
    • (1998) IEEE/ACM Transactions on Networking , vol.6 , Issue.5 , pp. 611-624
    • Stiliadis, D.1    Varma, A.2


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