Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/1733
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPai, Ullas Ravindra-
dc.contributor.authorDeb, Sujay (Advisor)-
dc.date.accessioned2025-06-04T10:22:35Z-
dc.date.available2025-06-04T10:22:35Z-
dc.date.issued2023-12-05-
dc.identifier.urihttp://repository.iiitd.edu.in/xmlui/handle/123456789/1733-
dc.description.abstractIn a multi-core system, each core has its own local cache, which stores copies of data from the main memory. In a single program, different threads might run on separate cores to perform parallel tasks. These threads could be working on different aspects of the same problem and likely share the same data. When multiple cores must work with the same data, coherency mechanisms ensure that all cores see a consistent view of that data. Directory-based coherence is commonly used in Network architectures to maintain data coherency between the cores. Directory protocols were originally developed to address the lack of scalability of snooping protocols. The aim is to establish the proof of concept of Cache coherence protocols - improving the execution time of programs in systems trying to exploit Multi-threaded workloads. We shall see how coherence requests, in theory, get translated during implementation, starting with an unsophisticated protocol. We shall go over the need for coherence, the thought processes behind the protocol, the design of various components and their implementation, and finally, the validation of the designs.en_US
dc.language.isoen_USen_US
dc.publisherIIIT-Delhien_US
dc.subjectSnoopingen_US
dc.subjectDirectoryen_US
dc.subjectCache coherenceen_US
dc.subjectProtocolsen_US
dc.subjectScalabilityen_US
dc.subjectMulti-threadeden_US
dc.titleImplementation of cache-coherent NoC for multi-core systemsen_US
dc.typeOtheren_US
Appears in Collections:Year-2023

Files in This Item:
File Description SizeFormat 
Ullas Pai_2020255.pdf
  Restricted Access
1.06 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.