By Topic

End-to-End Delay Bounds Analysis of Different On-chip Cache Coherence Policies: A Network Calculus-Based Approch

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xin Lai ; Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China ; Zhiying Wang ; Quanyou Feng

To analyze and compare end-to-end delay bounds of different cache coherence policies will provide beneficial guidelines for NoC design. However, it is not an easy task, because 1) packet flows generated by cache coherence events do not conform to the Poisson process, traditional queue theorem can't be applied to the performance analyzing for the NoCs that support cache coherence, 2) broadcast or multicast operations, which will duplicate the cache coherence packets, makes the analysis much more complicated. To address these challenges, in this paper, we use the stochastic network calculus to analyze the end-to-end delay bounds of different cache coherence policies. Specifically, we utilize Markov-modulated On-Off (MMOO) flow to model the arrival process of cache coherence events, and then deduce the general end-to-end delay bounds for different cache coherence policies. Furthermore, to deal with packet duplication issues in broadcast or multicast operations, we develop an analytical model based on scaling functions to study their impacts on end-to-end delay bounds.

Published in:

Modelling Symposium (AMS), 2012 Sixth Asia

Date of Conference:

29-31 May 2012