Distributed data cache designs for clustered VLIW processors

TL;DR: This paper proposes and evaluates three different configurations of the L1 data cache among clusters for clustered VLIW processors, a snoop-based cache coherence scheme, a word-interleaved cache, and flexible LO-buffers managed by the compiler, and shows that the performance of such fully distributed architectures is always better than theperformance of a partially distributed one with the same amount of resources.

Abstract: Wire delays are a major concern for current and forthcoming processors. One approach to deal with this problem is to divide the processor into semi-independent units referred to as clusters. A cluster usually consists of a local register file and a subset of the functional units, while the L1 data cache typically remains centralized in What we call partially distributed architectures. However, as technology evolves, the relative latency of such a centralized cache will increase, leading to an important impact on performance. In this paper, we propose partitioning the L1 data cache among clusters for clustered VLIW processors. We refer to this kind of design as fully distributed processors. In particular; we propose and evaluate three different configurations: a snoop-based cache coherence scheme, a word-interleaved cache, and flexible LO-buffers managed by the compiler. For each alternative, instruction scheduling techniques targeted to cyclic code are developed. Results for the Mediabench suite'show that the performance of such fully distributed architectures is always better than the performance of a partially distributed one with the same amount of resources. In addition, the key aspects of each fully distributed configuration are explored.