The impacts of timing constraints on virtual channels multiplexing in interconnect networks

Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference

Volumn 2006, Issue , 2006, Pages 55-62

  Khonsari, A ^a,b   Ould Khaoua, M ^c   Nayebi, A ^b   Sarbazi azad, H ^b,d  

^a UNIVERSITY OF TEHRAN   (Iran)

^b INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS IPM   (Iran)

^c UNIVERSITY OF GLASGOW   (United Kingdom)

^d SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

MULTICOMPUTER SYSTEMS; MULTIPLEXING PROBLEMS; VIRTUAL CHANNELS; WORMHOLE-SWITCHED NETWORKS;

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); CONSTRAINT THEORY; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; MICROPROCESSOR CHIPS; PROBLEM SOLVING;

MULTIPLEXING;

EID: 33751045843     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/.2006.1629390     Document Type: Conference Paper

References (18)

1. Abramovitz-Stegun: Handbook of Mathematical Functions, (Dover Edition 1965).
2. C.J. Ancker and A.V. Gafarian, Queueing with impatient customers who leave at random, The Journal of Industrial Engineering, XIII (2) (1962) 84-90.
3. C.J. Ancker and A.V. Gafarian, Some queueing problems with balking and reneging, Oper. Res. (11) (1963) 88-100.
4. D.Y. Barrer,Queuing with impatient customers and ordered service, Opr. Res. 5 (1957) 650-656.
5. L. Benini and G. DeMicheli, "Networks on Chips: A New SoC Paradigm," Computer, 35(1) (2002) 70-78.
6. Y. Boura, Design and analysis of routing schemes and routers for wormhole-routed mesh architectures, Ph.D. Dissertation, Department of Computer Science and Engineering, Penn State University (1995).
7. W.J. Dally and C.L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Trans. Computers 36(5) (1987) 547-553.
8. W.J. Dally, Virtual channel flow control, IEEE Trans. Parallel & Distributed Systems, 3(2) (1992) 194-215.
9. J. Duato, S. Yalamanchili and L. Ni, Interconnection Networks: An Engineering Approach, Morgan Kaufmann Publishers (2003).
10. M. Horowitz and B. Dally, "How Scaling Will Change Processor Architecture," Proc. Int'l Solid State Circuits Conf. (ISSCC), (Feb. 2004), 132-133.
11. A. Khonsari, Performance Modelling and Analysis of Deadlock Recovery Routing Algorithms in Multicomputer Interconnection Networks, PhD Thesis, Compting Science Department, Glasgow University, (2003).
12. L. Kleinrock, Queueing Systems: Theory (1) (John Wiley & Sons, New York, 1975).
13. J. D. C. LITTLE, A proof for the Queueing Formula Operations Research, 9(3) (1961) 383-387.
14. P. Magarshack and P.G. Paulin, "System-on-Chip beyond the Nanometer Wall," Proc. Design Automation Conf. (DAC), (June 2003), 419-424.
15. A. Movaghar, On queueing with customer impatience until the beginning of service, Queueing Systems, (29) (1998) 337-350.
16. M. Ould-Khaoua, A performance model for Duato's fully adaptive routing algorithm in k-ary ncubes, IEEE Trans. Computers 48(12) (1999) 1-8.
17. H. Sarbazi-Azad, Performance Analysis of Wormhole Routing in Interconnection Networks, PhD Thesis, Compting Science Department, Glasgow University, (2001).
18. H.C. Tijms, Stochastic modelling and analysis: A computational approach (John Wiley & Sons, 1986).