Priority Based Forced Requeue to Reduce Worst-Case Latencies for Bursty Traffic
2009 (English)In: DATE: 2009 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, 2009, 1070-1075 p.Conference paper (Refereed)
In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low priority packets from the network and requeue them outside using priority queues. The first benefit of this approach, applicable to any NoC offering best effort services, is that packets that have not yet entered the network now compete with packets inside the network and hence tighter bounds on admission times can be given. The second benefit - which is more specific to deflective routing as in the Nostrum NoC - is that packet "reshuffling" dramatically reduces the latency inside the network for bursty traffic due to a lowered risk of collisions at the exit of the network. This paper studies the Forced Requeuing on a mesh with varying burst sizes and traffic scenarios. The experimental results show a 50% reduction in worst-case latency from a system perspective thanks to a reshaped latency distribution whilst keeping the average latency the same.
Place, publisher, year, edition, pages
2009. 1070-1075 p.
, Design, Automation and Test in Europe Conference and Expo, ISSN 1530-1591
Best effort services, Burst size, Bursty traffic, Low priorities, Priority queues, Priority-based, Risk perception
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-30353ISI: 000273246700191ScopusID: 2-s2.0-70350070728ISBN: 978-1-4244-3781-8OAI: oai:DiVA.org:kth-30353DiVA: diva2:401549
Design, Automation and Test in Europe Conference and Exhibition, Nice, FRANCE, APR 20-24, 2009
QC 201103032011-03-032011-02-242011-11-24Bibliographically approved