COMPUTER ARCHITECTURE Suppose there are 10 processors on a bus that each try to lock a variable simultaneously. Assume that each bus transaction [read miss or write miss] is 100 clock cycles long. You...


COMPUTER ARCHITECTURE<br>Suppose there are 10 processors on a bus that each try to lock a<br>variable simultaneously. Assume that each bus transaction [read<br>miss or write miss] is 100 clock cycles long. You can ignore the<br>time of the actual read or write of a clock held in the cache, as<br>well as the time the lock is held. Determine that number of bus<br>transactions required for all 10 processors to acquire the lock,<br>assuming they are all spinning when the lock is released at time is<br>0, about how long will it take to process the 10 re quests?<br>Assume that the bus is totally fair so that every pending request is<br>serviced before a'new request and that the processors are<br>equally fast<br>

Extracted text: COMPUTER ARCHITECTURE Suppose there are 10 processors on a bus that each try to lock a variable simultaneously. Assume that each bus transaction [read miss or write miss] is 100 clock cycles long. You can ignore the time of the actual read or write of a clock held in the cache, as well as the time the lock is held. Determine that number of bus transactions required for all 10 processors to acquire the lock, assuming they are all spinning when the lock is released at time is 0, about how long will it take to process the 10 re quests? Assume that the bus is totally fair so that every pending request is serviced before a'new request and that the processors are equally fast

Jun 11, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here