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
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
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7556ee35-af23-4600-b410-53be754c5835%2F5da5c850-af40-4f43-a2c9-601ecce7638d%2F6d5704i_processed.jpeg&w=3840&q=75)
Transcribed Image 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
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education