Long-range dependence and on-chip processor traffic

Abstract

Long-range dependence is a property of stochastic processes that has an important impact on network performance, especially on the buffer usage in routers. We analyze the presence of long-range dependence in on-chip processor traffic and we study the impact of long-range dependence on networks-on-chip. We propose to investigate the presence of long-range dependence in communication traces of processor ips at the cycle-accurate level. We also study the impact of long-range dependence on a real network-on-chip using the SocLib simulation environment and traffic generators of our own. Our experiments show that long-range dependence is not an ubiquitous property of on-chip processor traffic and that its impact on the network-on-chip is highly correlated with the low level communication protocol used.

Analytical performance modeling of de Bruijn inspired mesh-based network-on-chips

“…Hu et al [41] has presented a non-uniform NoC buffer space allocation algorithm under various random traffic patterns. In [42] long-range dependencies and analysis the real traffic patterns and buffer sizing problems are studied.…”

Review, Analysis, and Implementation of Path Selection Strategies for 2D NoCs

“…Usually, these topologies have to face non-uniform traffic resulting from several factors, such as routing biases, topological artifacts, long-range dependencies, traffic scenarios, and many others. Such nonuniform traffic has a vital influence on the performance of NoC topologies that have been widely studied by [19,20,95], this non-uniformity of network traffic results in local congested regions that increases network delay and lower NoC performance. The functionality of a routing method can be divided into two parts: the route computation and selection functions, as shown in fig 1 . The route computation function provides the route from the current router to the destination router FIGURE 1: The selection strategy uses network congestion information to select one direction out of directions received from routing algorithms.…”

Mathematical analysis of buffer sizing for Network-on-Chips under multimedia traffic

“…Recent measurements of on-chip traffic [15], [16], [21] have convincingly shown that scale-invariant burstiness (i.e. self-similarity [12]) is being recognized in both pair-wised single application [21] and over entire network [16].…”

“…self-similarity [12]) is being recognized in both pair-wised single application [21] and over entire network [16].…”

“…The authors in [15], [16] extended the results of [21] to cycle-accurate level and proposed a stochastic traffic generator being aware that 1) On-chip traffic is non-stationary 2) On-chip traffic flows contain long range dependent behavior that must be taken into account when synthesizing traffic. Recently, the authors in [18] propose an empiricallyderived network on-chip traffic model for homogeneous NoCs.…”