Mathematical formalisms for performance evaluation of networks-on-chip

ACM Computing Surveys

Volumn 45, Issue 3, 2013, Pages

  Kiasari, Abbas Eslami ^a   Jantsch, Axel ^a   Lu, Zhonghai ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Analytical modeling; Network on chip (NoC); Performance evaluation; System on chip (SoC)

Indexed keywords

ANALYTICAL MODELS; CALCULATIONS; DISTRIBUTED COMPUTER SYSTEMS; PROGRAMMABLE LOGIC CONTROLLERS; QUEUEING THEORY; SERVERS;

ANALYTICAL MODELING; MATHEMATICAL FORMALISM; NETWORK CALCULUS; NETWORK-ON-CHIP; NETWORKS ON CHIPS; ON CHIP COMMUNICATION; PERFORMANCES EVALUATION; SCHEDULABILITY ANALYSIS; SYSTEM-ON-CHIP; SYSTEMS-ON-CHIP;

NETWORK-ON-CHIP;

EID: 84880103807     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/2480741.2480755     Document Type: Review

References (131)

1. Abdelzaher, T. F., Sharma, V., And Lu, C. 2004. A Utilization Bound For Aperiodic Tasks And Priority Driven Scheduling. Ieee Trans. Comput. 53, 3, 334-350.
2. Andersson, B. And Jonsson, J. 2000. Fixed-Priority Preemptive Multiprocessor Scheduling: To Partition Or Not To Partition. In Proceedings Of The 7Th International Conference On Real-Time Systems And Applications (Rtcsa'00). Ieee Computer Society, 337-346.
3. Andersson, B.,Baruah, S., And Jonsson, J. 2001. Static-Priority Scheduling On Multiprocessors. In Proceedings Of The 22Nd Ieee Real-Time Systems Symposium (Rtss'01). Ieee Computer Society, 193-202.
4. Audsley, N. C., Burns, A., Tindell, K., And Wellings, A. 1993. Applying New Scheduling Theory To Static Priority Preemptive Scheduling. Softw. Eng. J. 8, 5, 284-292.
5. Altisen, K., Liu, Y., Andmoy, M. 2010. Performance Evaluation Of Components Using A Granularity-Based Interface Between Real-Time Calculus And Timed Automata. In Proceedings Of The 8Thworkshop On Quantitative Aspects Of Programming Languages (Qapl'10). 16-23.
6. Baker, T. P. 2003. Multiprocessor Edf And Deadline Monotonic Schedulability Analysis. In Proceedings Of The 24Th Ieee International Real-Time Systems Symposium (Rtss'03). Ieee Computer Society, 120-129.
7. Bakhouya, M., Suboh, S., Gaber, J., El-Ghazawi, T. A., And Niar, S. 2011. Performance Evaluation And Design Tradeoffs Of On-Chip Interconnect Architectures. Simul. Model. Practice Theory 19, 6, 1496-1505.
8. Balakrishnan, S. And Ozguner, F. 1998. A Priority-Driven Flow Control Mechanism For Real-Time Traffic In Multiprocessor Networks. Ieee Trans. Parallel Distrib. Syst. 9, 7, 664-678.
9. Bekooij, M. J. G.,Moriera, O., Poplavko, P.,Mesman, B., Pastrnak, M., And Meerbergen, J. 2004. Predictable Embedded Multiprocessor System Design. In Proceedings Of The International Workshop On Software And Compilers For Embedded Systems, Lecture Notes In Computer Science, Vol. 3199, Springer, 77-91.
10. Bekooij, M. J. G., Hoes, R., Moreira, O., Poplavko, P., Pastrnak, M., Mesman, B., Mol, J. D., Stuijk, S., Gheorghita V., And Van Meerbergen J. 2005. Dataflow Analysis For Real-Time Embedded Multiprocessor System Design. In Dynamic And Robust Streaming In And Between Connected Consumer-Elecronic Devices, Chapter 15. Kluwer Academic Publishers, Norwell, Ma.
11. Bertsimas, D. And Mourtzinou, G. 1997. Transient Laws Of Non-Stationary Queueing Systems And Their Applications. Queu. Syst. 25, 1-4, 115-155.
12. Bhattacharya, B. And Bhattacharyya, S. S. 2001. Parameterized Dataflow Modeling For Dsp Systems. Ieee Trans. Signal Process. 49, 10, 2408-2421.
13. Bilsen, G., Engels, M., Lauwereins, R., And Peperstraete, J. 1996. Cyclo-Static Dataflow. Ieee Trans. Signal Process. 44, 2, 397-408.
14. Bini, E., Buttazzo, G. C., And Buttazzo, G. M. 2003. Rate Monotonic Scheduling: The Hyperbolic Bound. Ieee Trans. Comp. 52, 7, 933-942.
15. Bini, E. And Buttazzo, G. C. 2004. Schedulability Analysis Of Periodic Fixed Priority Systems. Ieee Trans. Comput. 53, 11, 1462-1473.
16. Bogdan, P. Andmarculescu, R. 2007. Quantum-Like Effects In Network-On-Chip Buffers Behavior. In Proceedings Of The 44Th Annual Design Automation Conference (Dac'07). Acm Press, 266-267.
17. Bogdan, P. And Marculescu, R. 2009. Statistical Physics Approaches For Network-On-Chip Traffic Characterization. In Proceedings Of The 7Th Ieee/Acm International Conference On Hardware/Software Codesign And System Synthesis (Codes+Isss'09). Acm Press, 461-470.
18. Bogdan, P. And Marculescu, R. 2010.Workload Characterization And Its Impact On Multicore Platform Design. In Proceedings Of The 8Th Ieee/Acm/Ifip International Conference On Hardware/Software Codesign And System Synthesis (Codes+Isss'10). Acm Press, 231-240.
19. Bogdan, P. And Marculescu, R. 2011. Non-Stationary Traffic Analysis And Its Implications On Multicore Platform Design. Ieee Trans. Comput. Aided Design Integr. Circuits Syst. 30, 4, 508-519.
20. Bolch, G., Greiner, S., Demeer, H., And Trivedi, K. S. 2006. Queueing Networks And Markov Chains: Modeling And Performance Evaluation With Computer Science Applications. 2Nd Ed. Johnwiley & Sons, Hoboken, Nj.
21. Buck, J. T. 1993. Scheduling Dynamic Dataflow Graphs With Bounded Memory Using The Token Flow Model. Ph.D. Dissertation, Dept. Of Eecs, Uc Berkeley, Berkeley, Ca.
22. Buck, J. T. And Lee, E. A. 1993. Scheduling Dynamic Dataflow Graphs With Bounded Memory Using The Token Flow Model. In Proceedings Of The Ieee International Conference On Acoustics, Speech, And Signal Processing: Plenary, Special, Audio, Underwater Acoustics, Vlsi, Neural Networks (Icassp'93), Vol. I. Ieee Computer Society, 429-432.
23. Buck, J. T. 1994. A Dynamic Dataflow Model Suitable For Efficient Mixed Hardware And Software Implementations Of Dsp Applications. In Proceedings Of The 3Rd International Workshop On Hardware/Software Co-Design (Codes'94). Ieee Computer Society, 165-172.
24. Buttazzo, G. C. 2005. Rate Monotonic Vs. Edf: Judgement Day. Real Time Syst. 29, 1, 5-26.
25. Chakraborty, S., Kunzli, S., And Thiele, L. 2003. A General Framework For Analysing System Properties In Platform-Based Embedded System Designs. In Proceedings Of The Conference On Design, Automation And Test In Europe (Date'03). Ieee Computer Society, 10190-10195.
26. Chang, C.-S. 2000. Performance Guarantees In Communication Networks. Springer-Verlag, London, U.K.
27. Cheng, A.-L., Pan, Y., Yan, X.-L., And Huan, R.-H. 2011. A General Communication Performance Evaluation Model Based On Routing Path Decomposition. J. Zhejiang Univ. - Sci. C (Comput. & Electron.) 12, 7, 561-573.
28. Cruz, R. L. 1991A. A Calculus For Network Delay, Part I: Network Elements In Isolation. Ieee Trans. Inf. Theory 37, 1, 114-131.
29. Cruz, R. L. 1991B. A Calculus For Network Delay, Part Ii: Network Analysis. Ieee Trans. Inf. Theory 37, 1, 132-141.
30. Dasdan, A. 2004. Experimental Analysis Of The Fastest Optimum Cycle Ratio And Mean Algorithms. Acmtrans. Des. Autom. Electron. Syst. 9, 4, 385-418.
31. Dasdan, A. Andgupta, R. 1998. Faster Maximum And Minimum Mean Cycle Algorithms For System Performance Analysis. Ieee Trans. Comput. Aided Design Integr. Circuits Syst. 17, 10, 889-899.
32. Davis, R. I. And Burns, A. 2011. A Survey Of Hard Real-Time Scheduling For Multiprocessor Systems. Acm Comput. Surv. 43, 4, Article 35.
33. Dennis, J. B. 1980. Data Flow Supercomputers. Computer 13, 11, 48-56.
34. Foroutan, S., Thonnart, Y., Hersemeule, R., And Jerraya, A. 2009. Analytical Computation Of Packet Latency In A 2D-Mesh Noc. In Proceedings Of The Joint Ieee North-East Workshop On Circuits And Systems And Taisa Conference. 1-4.
35. Foroutan, S., Thonnart, Y., Hersemeule, R., And Jerraya, A. 2010. An Analytical Method For Evaluating Network-On-Chip Performance. In Proceedings Of The 13Th Conference On Design, Automation And Test In Europe (Date'10). 1629-1632.
36. Funk, S., Goossens, J., And Baruah, S. 2001. On-Line Scheduling On Uniform Multiprocessors. In Proceedings Of The 22Nd Ieee Real-Time Systems Symposium (Rtss'01). Ieee Computer Society, 183-192.
37. Ghamarian, A. H.,Geilen, M. C. W., Stuijk, S.,Basten, T. Theelen, B. D., Mousavi, M. R.,Moonen, A. J. M., And Bekooij, M. J. G. 2006. Throughput Analysis Of Synchronous Data Flow Graphs. In Proceedings Of The 6Th International Conference On Application Of Concurrency To System Design (Acsd'06). Ieee Computer Society, 25-36.
38. Ghamarian, A. H., Stuijk, S., Basten, T., Geilen, M. C. W., And Theelen, B. D. 2007. Latency Minimization For Synchronous Data Flow Graphs. In Proceedings Of The 10Th Euromicro Conference On Digital System Design Architectures, Methods And Tools (Dsd'07). Ieee Computer Society, 189-196.
39. Guan, W., Tsai, W., And Blough, D. 1993. An Analytical Model For Wormhole Routing In Multicomputer Interconnection Networks. In Proceedings Of The International Parallel Processing Symposium. 650-654.
40. Guz, Z., Walter, I., Bolotin, E., Cidon, I., Ginosar, R., And Kolodny, A. 2007. Network Delays And Link Capacities In Application-Specific Wormhole Nocs. J. Vlsi Design, Article 90941.
41. Hamann, A., Jersak, M., Richter, K., And Ernst, R. 2004. Design Space Exploration And System Optimization With Symta/S - Symbolic Timing Analysis For Systems. In Proceedings Of The 25Th Ieee International Real-Time Systems Symposium (Rtss'04). Ieee Computer Society, 469-478.
42. Hansson, A.,Wiggers, M., Moonen, A., Goossens, K., And Bekooij, M. J. G. 2009. Enabling Application-Level Performance Guarantees In Network-Based Systems On Chip By Applying Dataflow Analysis. Iet Comput. Digital Tech. 3, 5, 398-412.
43. Hansson, A. And Goossens, K. 2010. On-Chip Interconnect With Aelite: Composable And Predictable Systems, Springer.
44. Hary, S. L. And Ozguner, F. 1997. Feasibility Test For Real-Time Communication Using Wormhole Routing. Iee Proc. Comput. Digital Tech. 144, 5, 273-278.
45. Horstmannshoff, J., Grotker, T., And Meyr, H. 1997. Mapping Multirate Dataflow To Complex Rt Level Hardware Models. In Proceedings Of The Ieee International Conference On Application-Specific Systems, Architectures And Processors (Asap'97). 283-292.
46. Hu, P.-C. And Kleinrock, L. 1997. An Analytical Model For Wormhole Routing With Finite Size Input Buffers. In Proceedings Of The 15Th International Teletraffic Congress. 549-560.
47. Hu, J.,Ogras, U. Y., Andmarculescu, R. 2006. System-Level Buffer Allocation For Application-Specific Networkson- Chip Router Design. Ieee Trans. Comput. Aided Design Integr. Circuits Syst. 25, 12, 2919-2933.
48. Hur, J. Y.,Goossens, K., Andmhamdi, L. 2008. Performance Analysis Of Soft And Hard Single-Hop And Multi-Hop Circuit-Switched Interconnects For Fpgas. In Proceedings Of The Ifip International Conference On Very Large Scale Integration. 224-229.
49. Jackson, J. R. 1957. Networks Of Waiting Lines. Oper. Res. 5, 518-521.
50. Jafari, F., Lu, Z., Jantsch, A., And Yaghmaee, M. H. 2010. Buffer Optimization In Network-On-Chip Through Flow Regulation. Ieee Trans. Comput. Aided Design Integr. Circuits Syst. 29, 12, 1973-1986.
51. Jantsch, A., And Sander, I. 2005. Models Of Computation And Languages For Embedded System Design. Iee Proc. Comput. Digital Tech. 152, 2, 114-129.
52. Jiang, Y. And Liu, Y. 2008. Stochastic Network Calculus, Springer-Verlag, Berlin.
53. Jiang, Y. 2009. Network Calculus And Queueing Theory: Two Sides Of One Coin. In Proceedings Of The 4Th International Conference On Performance Evaluation Methodologies And Tools. Article 37.
54. Joseph, M. And Pandya, P. 1986. Finding Response Times In A Real-Time System. Brit. Comput. Soc. Comp. J. 29, 5, 390-395.
55. Kandlur, D. D., Shin, K. G., And Ferrari, D. 1994. Real-Time Communication In Multihop Networks. Ieee Trans. Parallel Distrib. Syst. 5, 10, 1044-1056.
56. Kiasari, A. E., Sarbazi-Azad, H., And Ould-Khaoua, M. 2008A. An Accurate Mathematical Performance Model Of Adaptive Routing In The Star Graph. Future Gen. Comput. Syst. 24, 6, 461-474.
57. Kiasari, A. E., Rahmati, D., Sarbazi-Azad, H., And Hessabi, S. 2008B. A Markovian Performance Model For Networks-On-Chip. In Proceedings Of The 16Th Euromicro International Conference On Parallel, Distributed And Network-Based Processing (Pdp'08). 157-164.
58. Kiasari, A. E., Sarbazi-Azad, H., And Hessabi, S. 2008C. Caspian: A Tunable Performance Model For Multicore Systems. In Proceedings Of The 14Th European Conference On Parallel And Distributed Computing (Euro-Par'08), Lecture Notes In Computer Science, Vol. 5168, Springer, 100-109.
59. Kiasari, A. E., Hessabi, S., And Sarbazi-Azad, H. 2008D. Permap: A Performance-Aware Mapping For Application-Specific Socs. In Proceedings Of The International Conference On Application-Specific Systems, Architectures And Processors (Asap'08). Ieee Computer Society, 73-78.
60. Kiasari, A. E., Jantsch, A., And Lu, Z. 2010. Aframework For Designing Congestion-Aware Deterministic Routing. In Proceedings Of The 3Rd International Workshop On Network-On-Chip Architectures (Nocarc'10). Acm Press, 45-50.
61. Kiasari, A. E., Lu, Z., And Jantsch, A. 2012. An Analytical Latency Model For Networks-On-Chip. Ieee Trans. Very Large Scale Integ. (Vlsi) Syst. Doi: 10.1109/Tvlsi.2011.2178620. To Appear.
62. Kim, J. And Das, C. R. 1994. Hypercube Communication Delay With Wormhole Routing. Ieee Trans. Comput. 43, 7, 806-814.
63. Kim, B.,Kim, J., Hong, S. J., And Lee, S. 1998. A Real-Time Communication Method For Wormhole Switching Networks. In Proceedings Of The International Conference On Parallel Processing (Icpp'98). Ieee Computer Society, 527-534.
64. Kim, J., Park, D., Nicopoulos, C., Vijaykrishnan, N., And Das, C. R. 2005. Design And Analysis Of An Noc Architecture From Performance, Reliability And Energy Perspective. In Proceedings Of The Acmsymposium On Architecture For Networking And Communications Systems (Ancs'05). Acm Press, 173-182.
65. Kim, H. Andhou, J. C. 2009. Enabling Network Calculus-Based Simulation For Tcp Congestion Control. Comput. Netw. 53, 11-24.
66. Kleinrock, L. 1975. Queueing Systems, Vol. 1., John Wiley, Hoboken, Nj.
67. Krimer, E., Keslassy, I., Kolodny, A.,Walter, I., And Erez, M. 2011. Static Timing Analysis For Modeling Qos In Networks-On-Chip. J. Parallel Distrib. Comput. 71, 5, 687-699.
68. Kumar, A.,Mesman, B.,Theelen, B. D.,Corporaal, H., Andha, Y. 2008. Analyzing Composability Of Applications On Mpsoc Platforms. J. Syst. Architec. Embed. Syst. Design 54, 3-4, 369-383.
69. Lauwereins, R., Wauters, P., Ade, M., And Peperstraete, J. A. 1994. Geometric Parallelism And Cyclo-Static Data Flow In Grape-Ii. In Proceedings Of The International Workshop On Rapid System Prototyping. 90-107.
70. Le Boudec J.-Y. And Thiran, P. 2001. Network Calculus: A Theory Of Deterministic Queuing Systems For The Internet. Springer-Verlag, Berlin.
71. Lee, E. A. And Messerschmitt, D. G. 1987A. Synchronous Data Flow. Proc. Ieee 75, 9, 1235-1245.
72. Lee, E. A. And Messerschmitt, D. G. 1987B. Static Scheduling Of Synchronous Data Flow Programs For Digital Signal Processing. Ieee Trans. Comput. 36, 1, 24-35.
73. Lee, E. A. 1991. Consistency In Dataflow Graphs. Ieee Trans. Parallel Distrib. Syst. 2, 2, 223-235.
74. Lee, E. A. And Parks, T. M. 1995. Dataflow Process Networks. Proc. Ieee 83, 5, 773-799.
75. Lehoczky, J. P., Sha, L., And Ding, Y. 1989. The Rate Monotonic Scheduling Algorithm: Exact Characterization And Average Case Behavior. In Proceedings Of The Ieee Real-Time Systems Symposium. 166-171.
76. Lehoczky, J. P. 1990. Fixed Priority Scheduling Of Periodic Task Sets With Arbitrary Deadlines. In Proceedings Of The Ieee Real Time Systems Symposium. 201-209.
77. Leung, J. Y. T. And Whitehead, J. 1982. On The Complexity Of Fixed Priority Scheduling Of Periodic, Real-Time Tasks. Perf. Eval. 2, 4, 237-250.
78. Li, J.-P. And Mutka, M. W. 1994. Priority Based Real-Time Communication For Large Scale Wormhole Networks. In Proceedings Of The 8Th International Symposium On Parallel Processing. Ieee Computer Society, 433-438.
79. Li, J.-P. And Mutka, M. W. 1996. Real-Time Virtual Channel Flow Control. J. Parallel Distrib. Comput. 32, 1, 49-65.
80. Lindley, D. V. 1952. The Theory Of Queues With A Single Server. Proc. Cambridge Philoso. Soci. 48, 2, 277-289.
81. Liu C. L. And Layland, J. W. 1973. Scheduling Algorithms For Multiprogramming In A Hard-Real-Time Environment. J. Acm 20, 1, 46-61.
82. Liu, J. W. S. 2000. Real-Time Systems 1St Ed. Prentice Hall, Upper Saddle River, Nj.
83. Lu, Z., Jantsch, A., And Sander, I. 2005. Feasibility Analysis Of Messages For On-Chip Networks Using Wormhole Routing. In Proceedings Of The Asia And South Pacific Design Automation Conference (Asp-Dac'05). Acm Press, 960-964.
84. Lu, Z., Millberg, M., Jantsch, A., Bruce, A., Van Der Wolf, P., And Henriksson, T. 2009. Flow Regulation For On-Chip Communication. In Proceedings Of The Design, Automation And Test In Europe Conference (Date'09). 578-581.
85. Lu, Z. 2011. Cross Clock-Domain Tdm Virtual Circuits For Networks On Chips. In Proceedings Of The 5Th Acm/Ieee International Symposium On Networks-On-Chip (Nocs'11). Acm Press, 209-216.
86. Manabe, Y. And Aoyagi, S. 1995. A Feasibility Decision Algorithm For Rate Monotonic Scheduling Of Periodic Real-Time Tasks. In Proceedings Of The Real-Time Technology And Applications Symposium (Rtas'95). Ieee Computer Society, 212-218.
87. Min, G. And Ould-Khaoua, M. 2004. A Performance Model For Wormhole-Switched Interconnection Networks Under Self-Similar Traffic. Ieee Trans. Comput. 53, 5, 601-613.
88. Moreira, O. M. And Bekooij, M. J. G. 2007. Self-Timed Scheduling Analysis For Real-Time Applications. Eurasip J. Adv. Signal Proces. Article Id: 083710.
89. Nelson, A., Hansson, A., Corporaal, H., And Goossens, K. 2010. Conservative Application-Level Performance Analysis Through Simulation Of Mpsocs. In Proceedings Of The 8Th Ieeeworkshop On Embedded Systems For Real-Time Multimedia. 51-60.
90. Odoni, A. And Roth, E. 1983. An Empirical Investigation Of The Transient Behavior Of Stationary Queueing Systems. Oper. Res. 31, 432-455.
91. Ogras, U. Y., Bogdan, P., And Marculescu, R. 2010. An Analytical Approach For Network-On-Chip Performance Analysis. Ieee Trans. Comp.-Aided Des. Integ. Cir. Syst. 29, 12, 2001-2013.
92. Oh, D. And Bakker, T. P. 1998. Utilization Bounds For N-Processor Rate Monotone Scheduling With Static Processor Assignment. Real Time Syst. J. 15, 1, 183-193.
93. Oh, Y. And Son, S. H. 1995. Allocating Fixed-Priority Periodic Tasks On Multiprocessor Systems. Real-Time Syst. 9, 3, 207-239.
94. Pandit, K., Schmitt, J., And Steinmetz, R. 2004. Network Calculus Meets Queueing Theory - A Simulation Based Approach To Bounded Queues. In Proceedings Of The Ieee International Workshop On Quality Of Service. 114-120.
95. Parhi, K. K. 1989. Algorithm Transformation Techniques For Concurrent Processors. Proc. Ieee 77, 12, 1879- 1895.
96. Peng, D.-T. And Shin, K. G. 1993. A New Performance Measure For Scheduling Independent Real-Time Tasks. J. Parallel Distrib. Comput. 19, 1, 11-26.
97. Pop, P., Eles, P., And Peng, Z. 2000. Schedulability Analysis For Systems With Data And Control Dependencies. In Proceedings Of The 12Th Euromicro Conference On Real-Time Systems (Rts'00). Ieee Computer Society, 201-208.
98. Qian, Y., Lu, Z., And Dou, W. 2009A. Applying Network Calculus For Performance Analysis Of Self-Similar Traffic In On-Chip Networks. In Proceedings Of The 7Th Ieee/Acm International Conference On Hardware/ Software Codesign And System Synthesis (Codes+Isss'09). Acm Press, 453-460.
99. Qian, Y., Lu, Z., And Dou, W. 2009B. Analysis Of Worst-Case Delay Bounds For Best-Effort Communication In Wormhole Networks On Chip. In Proceedings Of The 3Rd Acm/Ieee International Symposium On Networks-On-Chip (Nocs'09). Ieee Computer Society, 44-53.
100. Qian, Y., Lu, Z., And Dou, W. 2009C. Worst Case Flit And Packet Delay Bounds In Wormhole Networks On Chip. Ieice Trans. Fundamentals Electron. Commun. Comput. Sci. Special Section On Vlsi Design And Cad Algorithms E92-A, 12, 3211-3220.
101. Qian, Y., Lu, Z., Anddou,W. 2010A. Analysis Of Worst-Case Delay Bounds For On-Chip Packet-Switching Networks. Ieee Trans. Comp.-Aided Des. Integ. Cir. Sys. 29, 5, 802-815.
102. Qian, Y., Lu, Z., And Dou, W. 2010B. Qos Scheduling For Nocs: Strict Priority Queueing Versus Weighted Round Robin. In Proceedings Of The 28Th International Conference On Computer Design (Iccd'10). 52-59.
103. Rumbaugh, J. 1977. A Data Flow Multiprocessor. Ieee Trans. Comput. 26, 2, 138-146.
104. Sathaye, S. S. And Strosnider, J. K. 1994. A Real-Time Scheduling Framework For Packet-Switched Networks. In Proceedings Of The Ieee International Conference On Distributed Computing. Ieee Computer Society, 182-191.
105. Scherrer, A., Fraboulet, A., And Risset, T. 2009. Long-Range Dependence And On-Chip Processor Traffic. Microprocess. Microsyst. 33, 1, 72-80.
106. Schmitt, J. B. And Roedig, U. 2005. Sensor Network Calculus: A Framework For Worst Case Analysis. In Distributed Computing In Sensor Systems, Lecture Notes In Computer Science, Vol. 3560, Springer, 141-154.
107. Schmitt, J. 2003. On Average And Worst Case Behaviour In Non-Preemptive Priority Queueing. In Proceedings Of The International Symposium On Performance Evaluation Of Computer And Telecommunication Systems. 197-204.
108. Sha, L.,Lehoczky, J. P., And Rajkumar, R. 1986. Solutions For Some Practical Problems In Prioritized Preemptive Scheduling. In Proceedings Of The Ieee Real-Time Systems Symposium.181-191.
109. She, H., Lu, Z., Jantsch, A., Zhou, D., And Zheng, L. 2009. Analytical Evaluation Of Retransmission Schemes In Wireless Sensor Networks. In Proceedings Of The 69Th Ieee Vehicular Technology Conference (Vtc'09).
110. Shi, Z. And Burns, A. 2008. Real-Time Communication Analysis For On-Chip Networks With Wormhole Switching. In Proceedings Of The 2Nd Acm/Ieee International Symposium On Networks-On-Chip (Nocs'08). Ieee Computer Society, 161-170.
111. Shi, Z. And Burns, A. 2009. Real-Time Communication Analysis With A Priority Share Policy In On-Chip Networks. In Proceedings Of The 21St Euromicro Conference On Real-Time Systems (Ecrts). Ieee Computer Society, 3-12.
112. Shi, Z. And Burns, A. 2010. Schedulability Analysis And Task Mapping For Real-Time On-Chip Communication. Real-Time Syst. 46, 3, 360-385.
113. Sjodin, M. And Hansson, H. 1998. Improved Response-Time Analysis Calculations. In Proceedings Of The Ieee Real-Time Systems Symposium (Rtss'98). Ieee Computer Society, 399-409.
114. Song, H.,Kwon, B., And Yoon, H. 1997. Throttle And Preempt: A New Flow Control For Real-Time Communications In Wormhole Networks. In Proceedings Of The International Conference On Parallel Processing (Icpp'97). Ieee Computer Society, 198-202.
115. Soteriou, V., Wang, H., And Peh, L.-S. 2006. A Statistical Traffic Model For On-Chip Interconnection Networks. In Proceedings Of The 14Th Ieee International Symposium On Modeling, Analysis, And Simulation (Mascots'06). Ieee Computer Society, 104-116.
116. Sriram, S., And Bhattacharyya, S. S. 2009. Embedded Multiprocessors: Scheduling And Synchronization 2Nd Ed. Crc Press, Boca Raton, Fl.
117. Stiliadis, D. And Varma, A. 1998. Latency-Rate Servers: A General Model For Analysis Of Traffic Scheduling Algorithms. Ieee/Acm Trans. Netw. 6, 5, 611-624.
118. Stuijk, S., Geilen, M. C. W., And Basten, T. 2006. Exploring Trade-Offs In Buffer Requirements And Throughput Constraints For Synchronous Dataflow Graphs. In Proceedings Of The 43Rd Annual Design Automation Conference (Dac'06). Acm Press, 899-904.
119. Stuijk, S., Geilen, M. C. W., Theelen, B. D., And Basten, T. 2011. Scenario-Aware Dataflow: Modeling, Analysis And Implementation Of Dynamic Applications. In Proceedings Of The International Conference On Embedded Computer Systems. 404-411.
120. Theelen, B. D., Geilen, M. C. W., Basten, T., Voeten, J. P. M., Gheorghita, S. V., And Stuijk, S. 2006. A Scenario-Aware Data Flow Model For Combined Long-Run Average And Worst-Case Performance Analysis. In Proceedings Of The International Conference On Formal Methods And Models For Co-Design. 185-194.
121. Van As, H. R. 1986. Transient Analysis Of Markovian Queueing Systems And Its Application To Congestioncontrol Modeling. Ieee J. Select. Areas Commun. 4, 6, 891-904.
122. Varatkar, G. V. And Marculescu, R. 2004. On-Chip Traffic Modeling And Synthesis For Mpeg-2 Video Applications. Ieee Trans. Very Large Scale Integr. Syst. 12, 1, 108-119.
123. Wang, J., Li, Y., And Peng, Q. 2011. A Novel Analytical Model For Network-On-Chip Using Semi-Markov Process. Adv. Elect. Comput. Eng. 11, 1, 111-118.
124. Wiggers, M. H., Bekooij, M. J. G., And Smit, G. J. M. 2007A. Modeling Run-Time Arbitration By Latency-Rate Servers In Dataflow Graphs. In Proceedings Of The International Workshop On Software And Compilers For Embedded Systems. 11-22.
125. Wiggers, M. H., Bekooij, M. J. G., And Smit, G. J. M. 2007B. Efficient Computation Of Buffer Capacities For Cyclo-Static Dataflow Graphs. In Proceedings Of The 44Th Annual Design Automation Conference (Dac'07). Acm Press, 658-663.
126. Wiggers, M. H., Bekooij, M. J. G., And Smit, G. J. M. 2008. Buffer Capacity Computation For Throughput Constrained Streaming Applications With Data-Dependent Inter-Task Communication. In Proceedings Of The Ieee Real-Time And Embedded Technology And Applications Symposium (Rtas'08). Ieee Computer Society, 183-194.
127. Wiggers, M. H., Bekooij, M. J. G., And Smit, G. J. M. 2011. Buffer Capacity Computation For Throughputconstrained Modal Task Graphs. Acm Trans. Embed. Comput. Syst. 10, 2, Article 17.
128. Wu, J., Liu, J.-C., And Zhao, W. 2010. A General Framework For Parameterized Schedulability Bound Analysis Of Real-Time Systems. Ieee Trans. Comput. 59, 6, 776-783.
129. Xuan, D., Bettati, R., Chen, J., Zhao, W., And Li, C. 2000. Utilization-Based Admission Control For Real-Time Applications. In Proceedings Of The International Conference On Parallel Processing (Icpp'00). Ieee Computer Society, 251-262.
130. Yang, F. And Liu, J. 2010. Transient Analysis Of General Queueing Systems Via Simulation-Based Transfer Function Modeling, In Proceedings Of The Winter Simulation Conference (Wsc). Ieee Computer Society, 1110-1122.
131. Zhang, H. 1995. Service Disciplines For Guaranteed Performance Service In Packet-Switching Networks. Proc. Ieee 83, 10, 1374-1396.