Computer Architecture Shared Memory MIMD Architectures. Ola Flygt Växjö University http://w3.msi.vxu.se/users/ofl/ [email protected] +46 470 70 86 49. Outline. Multiprocessors Cache memories Interconnection network Shared path Switching networks Arbitration
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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Computer ArchitectureShared Memory MIMD Architectures
+46 470 70 86 49
Enable the temporary connection of any two components of a multiprocessor.
The priority loop of the rotating arbiter works similarly to the grant chain of the daisy-chained arbiter.
- unnecessary traffic on interconnection in case of private data and of infrequently used shared data
+ more reliable (error detection and recovery features of the main memory)
- more complex cache controllers
- cache controllers have to accept invalidate command from other cache controllers
E = Exclusive state
M = Modified state
Sc = Shared clean state
Sm = Shared modified state