메뉴 건너뛰기




Volumn 29, Issue 5, 2010, Pages 802-815

Analysis of worst-case delay bounds for on-chip packet-switching networks

Author keywords

Delay bound; Network calculus; Network on chip; Performance analysis; Quality of service

Indexed keywords

ANALYSIS TECHNIQUES; CLOSED-FORM FORMULAE; COMMUNICATION DELAYS; DELAY BOUND; IN-NETWORK; NETWORK CALCULUS; NETWORK CONTENTION; NETWORK ON CHIP; ON CHIPS; PACKET DELAY; PACKET DELIVERY; THEORETICAL BOUNDS; TOPOLOGY-INDEPENDENT;

EID: 77951675199     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2010.2043572     Document Type: Article
Times cited : (58)

References (18)
  • 1
    • 27344456043 scopus 로고    scopus 로고
    • The æthereal network on chip: Concepts, architectures, and implementations
    • DOI 10.1109/MDT.2005.99
    • K. Goossens, J. Dielissen, and A. Rǎdulescu, "The æthereal network on chip: Concepts, architectures, and implementations, " IEEE Design Test Comput., vol. 22, no. 5, pp. 414-421, Sep.-Oct. 2005. (Pubitemid 41522729)
    • (2005) IEEE Design and Test of Computers , vol.22 , Issue.5 , pp. 414-421
    • Goossens, K.1    Dielissen, J.2    Radulescu, A.3
  • 2
    • 48349101315 scopus 로고    scopus 로고
    • TDM virtual-circuit configuration for networkon-chip
    • Aug
    • Z. Lu and A. Jantsch, "TDM virtual-circuit configuration for networkon-chip, " IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 16, no. 8, pp. 1021-1034, Aug. 2008.
    • (2008) IEEE Trans. Very Large Scale Integr. (VLSI) Syst. , vol.16 , Issue.8 , pp. 1021-1034
    • Lu, Z.1    Jantsch, A.2
  • 6
    • 0032121065 scopus 로고    scopus 로고
    • A priority-driven flow control mechanism for real-time traffic in multiprocessor networks
    • S. Balakrishnan and F. Özgüner, "A priority-driven flow control mechanism for real-time traffic in multiprocessor networks, " IEEE Trans. Parallel Distributed Syst., vol. 9, no. 7, pp. 664-678, Jul. 1998. (Pubitemid 128743604)
    • (1998) IEEE Transactions on Parallel and Distributed Systems , vol.9 , Issue.7 , pp. 664-678
    • Balakrishnan, S.1    Ozguner, F.2
  • 7
    • 70349787717 scopus 로고    scopus 로고
    • Feasibility analysis of messages for on-chip networks using wormhole routing
    • Jan
    • Z. Lu, A. Jantsch, and I. Sander, "Feasibility analysis of messages for on-chip networks using wormhole routing, " in Proc. Asia South Pacific Design Autom. Conf. (ASP-DAC), vol. 2. Jan. 2005, pp. 960-964.
    • (2005) Proc. Asia South Pacific Design Autom. Conf. (ASP-DAC) , vol.2 , pp. 960-964
    • Lu, Z.1    Jantsch, A.2    Sander, I.3
  • 8
    • 0029343161 scopus 로고
    • Bounds on maximum delay in networks with deflection routing
    • Jul
    • J. T. Brassil and R. L. Cruz, "Bounds on maximum delay in networks with deflection routing, " IEEE Trans. Parallel Distributed Syst., vol. 6, no. 7, pp. 724-732, Jul. 1995.
    • (1995) IEEE Trans. Parallel Distributed Syst. , vol.6 , Issue.7 , pp. 724-732
    • Brassil, J.T.1    Cruz, R.L.2
  • 9
    • 33745851161 scopus 로고    scopus 로고
    • Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
    • DOI 10.1016/j.peva.2005.10.003, PII S0166531605001537
    • L. Lenzini, L. Martorini, E. Mingozzi, and G. Stea, "Tight end-toend per-flow delay bounds in FIFO multiplexing sink-tree networks, " Perform. Eval., vol. 63, nos. 9-10, pp. 956-987, Oct. 2006. (Pubitemid 44037830)
    • (2006) Performance Evaluation , vol.63 , Issue.9-10 , pp. 956-987
    • Lenzini, L.1    Martorini, L.2    Mingozzi, E.3    Stea, G.4
  • 10
    • 84948173505 scopus 로고    scopus 로고
    • Delay bounds in a network with aggregate scheduling
    • COST 263 Int. Workshop Quality Future Internet Services, Sep
    • A. Charny and J.-Y. Le Boudec, "Delay bounds in a network with aggregate scheduling, " in Proc. 1st Eur. Cooperat. Sci. Technol. (COST) 263 Int. Workshop Quality Future Internet Services, Sep. 2000, pp. 1-13.
    • (2000) Proc. 1st Eur. Cooperat. Sci. Technol. , pp. 1-13
    • Charny, A.1    Le Boudec, J.-Y.2
  • 11
    • 0842265104 scopus 로고    scopus 로고
    • A parameter based admission control for differentiated services networks
    • Mar
    • M. Fidler and V. Sander, "A parameter based admission control for differentiated services networks, " Elsevier Comput. Netw., vol. 44, no. 4, pp. 463-479, Mar. 2004.
    • (2004) Elsevier Comput. Netw. , vol.44 , Issue.4 , pp. 463-479
    • Fidler, M.1    Sander, V.2
  • 13
    • 0032182533 scopus 로고    scopus 로고
    • Latency-rate servers: A general model for analysis of traffic scheduling algorithms
    • PII S1063669298084039
    • D. Stiliadis and A. Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms, " IEEE/ACM Trans. Networking, vol. 6, no. 5, pp. 611-624, Oct. 1998. (Pubitemid 128745459)
    • (1998) IEEE/ACM Transactions on Networking , vol.6 , Issue.5 , pp. 611-624
    • Stiliadis, D.1    Varma, A.2
  • 18
    • 3042567207 scopus 로고    scopus 로고
    • Bandwidth-constrained mapping of cores onto NoC architectures
    • Feb
    • S. Murali and G. D. Micheli, "Bandwidth-constrained mapping of cores onto NoC architectures, " in Proc. Design Autom. Test Eur. Conf., Feb. 2004, pp. 896-901.
    • (2004) Proc. Design Autom. Test Eur. Conf. , pp. 896-901
    • Murali, S.1    Micheli, G.D.2


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