577 research outputs found
Yet Another Compressed Cache: a Low Cost Yet Effective Compressed Cache
Cache memories play a critical role in bridging the latency, bandwidth, and energy gaps between cores and off-chip memory. However, caches frequently consume a significant fraction of a multicore chip’s area, and thus account for a significant fraction of its cost. Compression has the potential to improve the effective capacity of a cache, providing the performance and energy benefits of a larger cache while using less area. The design of a compressed cache must address two important issues: i) a low-latency, low-overhead compression algorithm that can represent a fixed-size cache block using fewer bits and ii) a cache organization that can efficiently store the resulting variable-size compressed blocks. This paper focuses on the latter issue. In this paper, we propose YACC (Yet Another Compressed Cache), a new compressed cache design that uses super-blocks to reduce tag overheads and variable-size blocks to reduce internal fragmentation, but eliminates two major sources of complexity in previous work—decoupled tag-data mapping and address skewing. YACC’s cache layout is similar to conventional caches, eliminating the back-pointers used to maintain a decoupled tag-data mapping and the extra decoders used to implement skewed associativity. An additional advantage of YACC is that it enables modern replacement mechanisms, such as RRIP. For our benchmark set, YACC performs comparably to the recently-proposed Skewed Compressed Cache (SCC) ‎[Sardashti et al. 2014], but with a simpler, more area efficient design without the complexity and overheads of skewing. Compared to a conventional uncompressed 8MB LLC, YACC improves performance by on average 8% and up to 26%, and reduces total energy by on average 6% and up to 20%. An 8MB YACC achieves approximately the same performance and energy improvements as a 16MB conventional cache at a much smaller silicon footprint, with 1.6% higher area than an 8MB conventional cach
One-transit paths and steady-state of a non-equilibrium process in a discrete-time update
We have shown that the partition function of the Asymmetric Simple Exclusion
Process with open boundaries in a sublattice-parallel updating scheme is equal
to that of a two-dimensional one-transit walk model defined on a diagonally
rotated square lattice. It has been also shown that the physical quantities
defined in these systems are related through a similarity transformation.Comment: 8 pages, 2 figure
A fingerprint based metric for measuring similarities of crystalline structures
Measuring similarities/dissimilarities between atomic structures is important
for the exploration of potential energy landscapes. However, the cell vectors
together with the coordinates of the atoms, which are generally used to
describe periodic systems, are quantities not suitable as fingerprints to
distinguish structures. Based on a characterization of the local environment of
all atoms in a cell we introduce crystal fingerprints that can be calculated
easily and allow to define configurational distances between crystalline
structures that satisfy the mathematical properties of a metric. This distance
between two configurations is a measure of their similarity/dissimilarity and
it allows in particular to distinguish structures. The new method is an useful
tool within various energy landscape exploration schemes, such as minima
hopping, random search, swarm intelligence algorithms and high-throughput
screenings
- …