Login / Signup

A tighter recursive calculus to compute the worst case traversal time of real-time traffic over NoCs.

Meng LiuMatthias BeckerMoris BehnamThomas Nolte
Published in: ASP-DAC (2017)
Keyphrases
  • real time traffic
  • worst case
  • upper bound
  • lower bound
  • atm networks
  • real time
  • sign detection and recognition
  • np hard
  • quality of service
  • computational complexity
  • differentiated services