1 / 21

An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing

This summary examines an adaptive cache coherence protocol specifically designed to optimize migratory sharing in computer systems. The proposed protocol addresses various states and requests involved in managing data consistency among multiple processors. Key operations include read and write requests, data flushing, and invalidation processes. The study presents experimental results showing improved execution times and reduced network traffic for applications that utilize migratory sharing. Ultimately, the proposed protocol reveals potential benefits and complexities, emphasizing its conditional effectiveness based on application types.

nola-joyner
Download Presentation

An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing CS258 Paper Summary Computer Science Jaein Jeong

  2. Migratory Sharing • Pi has exclusive copy of X Pi Dirty Dirty Invalid Pj Location X Pi Invalid Pk

  3. Migratory Sharing • Pj sends read request to X Pi Dirty Dirty Rd Invalid Pj Location X Pi Invalid Pk

  4. Migratory Sharing • D.C. sends flush to the exclusive sharer Pi Pi Dirty Rd Dirty Invalid Pj Location X Pi Invalid Pk

  5. Migratory Sharing • Pi sends data to Pj and main memory • State changes to shared, with sharer Pi and Pj Pi Shared WB WB Shared Shared Pj Location X Pi, Pj Invalid Pk

  6. Migratory Sharing • Pj sends read exclusive request to X Pi Shared Shared RdX Shared Pj Location X Pi, Pj Invalid Pk

  7. Migratory Sharing • D.C. invalidates Pi Pi Shared Inv. Shared Shared Pj Location X Pi, Pj Invalid Pk

  8. Migratory Sharing • Pi is invalidated • State for memory and Pj changes to dirtywith sharer Pj Pi Invalid Dirty Dirty Pj Location X Pj Invalid Pk

  9. Transaction Cost under W.I. • Two separate requests from Pj: • Read and Read Exclusive requests • One flush and one invalidation to Pi • Idea for improvement • One request from Pj • After Pi sends data, its state becomes invalid

  10. Migratory Sharing (modified) • Pj sends read request (migrating read) to X Pi Dirty Dirty Rd Invalid Pj Location X Pi Invalid Pk

  11. Migratory Sharing (modified) • D.C. sends read to the exclusive sharer Pi Pi Dirty Rd Dirty Invalid Pj Location X Pi Invalid Pk

  12. Migratory Sharing (modified) • Pi sends data to Pj and main memoryand invalidates its copy Pi Invalid WB WB Dirty Invalid Pj Location X Pi Invalid Pk

  13. Migratory Sharing (modified) • D.C. sends ACK to Pj • State changes with sharer Pj Pi Invalid Dirty ACK Dirty Pj Location X Pj Invalid Pk

  14. Invalid Shared Dirty Migrating Extensions to support migratory sharing • Switches b/w W.I. And migratory protocol • Extensions are needed: • LW (last writer), N (num sharer) • 2 states for home, 1 state for local

  15. Detection of migratory sharing • Condition for migratory sharingRxq_i && N == 2 && LW != i Pi Dirty Dirty Rd Invalid Pj Location X Pi Invalid Pk

  16. Pi Migrating Rd_j Dirty Invalid Pj Location X Pi Invalid Pk Detection of non-migratory sharing <States of Processor Pi> • Condition for W-IRr && local state == migrating

  17. Experimental Results(Execution Time) • Effective for read-and-modifiy accesses • Reduces number of writes • No negative effect for non-migratory apps

  18. Experimental Results(Network Traffic) • Same trend with the execution time

  19. Experimental Results(Various memory consistency models) • Adaptive protocol more effective for stricter memory consistency models

  20. Experimental Results(Smaller cache size) • Adaptive protocol more effective when capacity and conflict misses are reduced with larger cache

  21. Discussion • Is the adaptive protocol worthwhile? • The effectiveness varies depending on applications (1% to 54%). Benefits on migratory sharing • Added complexity • Increased number of states • More complex transition

More Related