The Scalable Tree Protocol - A Cache Coherence Approach for Large-Scale Multiprocessors

Document type: Conference Papers
Peer reviewed: Yes
Author(s): Håkan Nilsson, Per Stenström
Title: The Scalable Tree Protocol - A Cache Coherence Approach for Large-Scale Multiprocessors
Conference name: Fourth IEEE Symposium on Parallel and Distributed Processing
Year: 1992
Pagination: 498-506
ISBN: 0 8186 3200 3
Publisher: IEEE
City: Arlington, TX, USA
Organization: Blekinge Institute of Technology
Department: Dept. of Computer Science and Business Administration (Institutionen för datavetenskap och ekonomi)
*** Error ***
+46 455 780 00
*** Error ***
Language: English
Abstract: The problem of cache coherence in large-scale shared-memory multiprocessors has been addressed using directory-schemes. Two problems arise when the number of processors increases: the network latency increases and the implementation cost must be kept acceptable. The authors present a tree-based cache coherence protocol called the scalable tree protocol (STP). They show that it can be implemented at a reasonable implementation cost and that the write latency is logarithmic to the size of the sharing set. How to maintain an optimal tree structure and how to handle replacements efficiently are critical issues the authors address for this type of protocol. They compare the performance of the STP with that of the scalable coherent interface (SCI) (IEEE standard P1596) by considering a classical matrix-oriented algorithm targeted for large-scale parallel processing. They show that the STP manages to reduce the execution time considerably by reducing the write latency.
Subject: Computer Science\Computersystems
Keywords: performance evaluation, protocols, shared memory systems
Edit