Performance Evaluation of Link-Based Cache Coherence Schemes
| Document type: | Conference Papers |
|---|---|
| Peer reviewed: | Yes |
| Author(s): | Håkan Nilsson, Per Stenström |
| Title: | Performance Evaluation of Link-Based Cache Coherence Schemes |
| Conference name: | 26st Hawaii International Conference on System Sciences |
| Year: | 1993 |
| Pagination: | 486-495, vol. 1 |
| ISBN: | 0 8186 3230 5 |
| Publisher: | IEEE |
| City: | Wailea, HI, USA |
| Organization: | Blekinge Institute of Technology |
| Department: | Dept. of Computer Science and Business Administration (Institutionen för datavetenskap och ekonomi) Dept. of Computer Science and Business Administration S-372 25 Ronneby +46 455 780 00 http://www.ide.hk-r.se/ |
| Language: | English |
| Abstract: | The authors have evaluated the implementation and performance tradeoffs between three directory-based cache coherence protocols. They study two link-based approaches, called tree-based and linear-list protocols, and contrast their performance and implementation cost with that of a full-map protocol. Using program-driven simulation and a set of three benchmark programs, it was found that tree-based and linear-list protocols performed almost as well as full-map protocols but with a considerably lower implementation cost. However, if the sharing set is large, linear-list schemes may suffer because of the large write latency while tree-based protocols still perform well. |
| Subject: | Computer Science\Computersystems |
| Keywords: | buffer storage, performance evaluation |
