Priority assignment for real-time wormhole communication in on-chip networks

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2008, Pages 421-430

  Shi, Zheng ^a   Burns, Alan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND SEARCH; COMMUNICATION PLATFORMS; EXPONENTIAL COMPLEXITY; FIXED PRIORITIES; ON CHIP COMMUNICATION; ON-CHIP NETWORKS; POSSIBLE SOLUTIONS; PRIORITY ASSIGNMENT; QOS REQUIREMENTS; REAL-TIME COMMUNICATION; SCHEDULABILITY ANALYSIS; SEARCH ALGORITHMS; SEARCH SPACES; WORMHOLE COMMUNICATION; WORMHOLE SWITCHING;

COMMUNICATION; ELECTRIC NETWORK TOPOLOGY; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; LINEAR PROGRAMMING; QUALITY OF SERVICE;

REAL TIME SYSTEMS;

EID: 67249133157     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2008.11     Document Type: Conference Paper

References (21)

1. W. J. Dally, "Route packets, not wires: On-chip interconnection networks," Proceedings of the 38th Design Automation Conference (DAC), pp. 684-689, 2001.
2. L. Benini and G. D. Micheli, "Networks on Chips: A New SoC Paradigm," Computer, vol.35, no. 1, pp. 70-78, 2002. (Pubitemid 34069383)
3. S. Furber and J. Bainbridge, "Future trends in SoC interconnect," in VLSI Design, Automation and Test, 2005, pp. 183- 186. [Online]. Available: http://www.imit.kth.se/̃axel/papers/2002/rvk-2002.pdf (Pubitemid 46305666)
4. T. Bjerregaard and J. Spars, "Implementation of guaranteed services in the mango clockless network-on-chip," IEE Proceedings: Computing and Digital Techniques, vol.Vol. 153, (4), no. 217-229, 2006. (Pubitemid 44000360)
5. L. M. Ni and P. K. McKinley, "A survey of wormhole routing techniques in direct networks," Computer, vol.26, no. 2, pp. 62-76, 1993.
6. N. Kavaldjiev and G. Smit, "A survey of efficient on-chip communications for soc," CTIT, 2003.
7. S. Balakrishnan and F. Ozguner, "A priority-driven flow control mechanism for real-time traffic in multiprocessor networks," IEEE Trans. Parallel Distrib. Syst., vol.9, no. 7, pp. 664-678, 1998. (Pubitemid 128743604)
8. S. L. Hary and F. Ozguner, "Feasibility test for real-time communication using wormhole routing," IEE Proceedings - Computers and Digital Techniques, vol.144, no. 5, pp. 273-278, 1997. [Online]. Available: http://link.aip.org/link/?ICE/144/273/1 (Pubitemid 127755301)
9. Z. Lu, A. Jantsch, and I. Sander, "Feasibility analysis of messages for onchip networks using wormhole routing," in ASP-DAC '05: Proceedings of the 2005 conference on Asia South Pacific design automation. New York, NY, USA: ACM Press, 2005, pp. 960-964.
10. Z. Shi and A. Burns, "Real-time communication analysis for on-chip networks with wormhole switching," in Proceeding of the 2nd IEEE International Symposium on Networks-on-Chip(NoCS), 2008 Apr, pp. 161-170. (Pubitemid 351715040)
11. C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard-real-time environment," J. ACM, vol.20, no. 1, pp. 46-61, 1973.
12. J. Y.-T. Leung and J. Whitehead, "On the complexity of fixed-priority scheduling of periodic real-time tasks," Performance Evaluation, vol.2, pp. 237-250, 1982. (Pubitemid 13487696)
13. N. C. Audsley, "Optimal priority assignment and feasibility of static priority tasks with arbitrary start times," in YCS164, Dept. Computer Science, University of York, 1991. [Online]. Available: citeseer.ist.psu.edu/audsley91optimal.html
14. N. C. Audsley, "On priority asignment in fixed priority scheduling," Inf. Process. Lett., vol.79, no. 1, pp. 39-44, 2001.
15. A. Zuhily and A. Burns, "Optimality of (dj)-monotonic priority assignment," Information Processing Letters, vol.103, no. 1, pp. 247-250, 2007.
16. M. Mutka, "Using rate monotonic scheduling technology for realtimecommunications in a wormhole network," in Proceeding of the Second Workshop on Parallel and Distributed Real-Time Systems, 1994, pp. 194-199.
17. J. Li and M. Mutka, "Real-time virtual channel flow control," J. Parallel and Distributed Computing, vol.32, no. 1, pp. 49-65, 1996. (Pubitemid 126160586)
18. B. Kim, J. Kim, S. J. Hong, and S. Lee, "A real-time communication method for wormhole switching networks," in ICPP '98: Proceedings of the International Conference on Parallel Processing. Washington, DC, USA: IEEE Computer Society, 1998, pp. 527-534.
19. N. C. Audsley, A. Burns, M. Richardson, K. Tindell, and A. J. Wellings, "Applying new scheduling theory to static priority pre-emptive scheduling," Software Engineering Journal, vol.8, pp. 284-292, 1993. [Online]. Available: citeseer.ist.psu.edu/audsley93applying.html
20. R. Racu, M. Jersak, and R. Ernst, "Applying sensitivity analysis in real-time distributed systems," in RTAS '05: Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium. Washington, DC, USA: IEEE Computer Society, 2005, pp. 160-169. (Pubitemid 41311468)
21. E. Bini and G. C. Buttazzo, "Measuring the performance of schedulability tests," Real-Time System., vol.30, no. 1-2, pp. 129-154, 2005. 430 (Pubitemid 41310221)