A directory based hybrid cache update strategy to reduce memory latency of shared memory multiprocessors

Loading...
Thumbnail Image
Issue Date
2016-04-29
Embargo End Date
Authors
Chidella, Kishore K.
Advisor
Asaduzzaman, Abu
Citation

Chidella, Kishore K. 2016. A directory based hybrid cache update strategy to reduce memory latency of shared memory multiprocessors. --In Proceedings: 12th Annual Symposium on Graduate Research and Scholarly Projects. Wichita, KS: Wichita State University, p. 31

Abstract

Multiple cores with a shared memory on a single-chip provide an excellent architecture to achieve fast computation. However, shared memory multiprocessors with typical write update and write invalidate strategies suffer due to the fact that the number of cores is normally less than 16, bandwidth is often wasted, and memory latency becomes very high. This paper presents a directory based hybrid cache update strategy for shared memory multiprocessors with large number of cores to help reduce memory latency. The proposed directory scheme continuously checks for requests from cores, satisfies the requests according to the priority, starving cases, and updates the directory accordingly. We simulate a 32-core system using pure write update (PWU), pure write invalidates (PWI), and the proposed hybrid strategies. Preliminary experimental results show that the proposed strategy decreases memory latency by 24% when compared with the PWI strategy. The proposed strategy is as good as the PWU strategy.

Table of Content
Description
Presented to the 12th Annual Symposium on Graduate Research and Scholarly Projects (GRASP) held at the Heskett Center, Wichita State University, April 29, 2016.
Research completed at Department of Electrical Engineering and Computer Science, College of Engineering
publication.page.dc.relation.uri
DOI