Characterization of TCC on Chip-Multiprocessors

  • Authors:

  • Austen McDonald;JaeWoong Chung;Hassan Chafi;Chi Cao Minh;Brian D. Carlstrom;Lance Hammond;Christos Kozyrakis;Kunle Olukotun

  • Affiliations:

  • Computer Systems Laboratory, Stanford University;Computer Systems Laboratory, Stanford University;Computer Systems Laboratory, Stanford University;Computer Systems Laboratory, Stanford University;Computer Systems Laboratory, Stanford University;Computer Systems Laboratory, Stanford University;Computer Systems Laboratory, Stanford University;Computer Systems Laboratory, Stanford University

  • Venue:
  • Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Transactional Coherence and Consistency (TCC) is a novel coherence scheme for shared memory multiprocessors that uses programmer-defined transactions as the fundamental unit of parallel work, synchronization, coherence, and consistency. TCC has the potential to simplify parallel program development and optimization by providing a smooth transition from sequential to parallel programs. In this paper, we study the implementation of TCC on chip-multiprocessors (CMPs). We explore design alternatives such as the granularity of state tracking, doublebuffering, and write-update and write-invalidate protocols. Furthermore, we characterize the performance of TCC in comparison to conventional snoopy cache coherence (SCC) using parallel applications optimized for each scheme. We conclude that the two coherence schemes perform similarly, with each scheme having a slight advantage for some applications. The bandwidth requirements of TCC are slightly higher but well within the capabilities of CMP systems. Also, we find that overflow of speculative state can be effectively handled by a simple victim cache. Our results suggest TCC can provide its programming advantages without compromising the performance expected from well-tuned parallel applications.