Department of Information Technology
Uppsala Architecture Research Team

Bandwidth Bandit: Quantitative Characterization of Memory Contention

The Bandwidth Bandit steals system bandwidth by accessing data in carefully chosen sequential and random access patterns that avoid polluting the cache hierarchy. (E.g., we design the pattern to ensure that we only use a very limited number of sets in the cache.) This work demonstrates that there is little correlation between bandwidth consumption and sensitivity, by quantitatively analyze whether an application is latency sensitive (e.g., slows down as soon as there is any bandwidth contention) or bandwidth sensitive (e.g., only slows down when bandwidth is exhausted).


Using Bandit Data to predict multicore scaling for bandwidth-bound applications. Poster

Updated  2013-07-05 13:05:10 by David Black-Schaffer.