Consider a problem: some workers need to take tables across a road. The road only allóws two people take one table across at a time, the table is heavy and must needs two peoples simultaneously. The below semaphore-based solution shows that one people can call the people_ready when he/she is ready to use the road. When a table is ready, the Table_ready is called. When two people can take one table, these functions provide one table with two people and call Enter_road. Assume the waiting queue use FCFS for the semaphore. Do you think this solution is good or not for the above problem? Please explain why. semaphore people_ready = 0; semaphore table_ready 0; void PeopleReadyO people_ready.up): table_ready.down(): void TableReady() People_ready.down): People_ready.downO: Enter road(); Table_ready.up0: Table_ready.up();

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
icon
Related questions
Question

9 and 10. 

8. Consider a memory system with a cache access time of 30ns and a hit ratio of 90%. If the
effective access time is 20% greater than the cache access time, what is the memory access time?
9.
Consider a problem: some workers need to take tables across a road. The road only allows
two people take one table across at a time, the table is heavy and must needs two peoples
simultaneously. The below semaphore-based solution shows that one people can call the
people_ready when he/she is ready to use the road. When a table is ready, the Table_ready is
called. When two people can take one table, these functions provide one table with two people
and call Enter_road. Assume the waiting queue use FCFS for the semaphore. Do you thỉnk this
solution is good or not for the above problem? Please explain why.
semaphore people_ready = 0;
semaphore table_ready 0;
void PeopleReadyO
people_ready.up0:
table_ready.down(:
void TableReady()
People_ready.down);
People ready.down0:
Enter road);
Table_ready.up0:
Table_ready.up(0:
pe Given the following stream of page references by an application, calculate the number of
page faults the application would incur with the following page replacement algorithm and fill in
the contents of the page frames of memory after each memory reference. Assume that all pages
are initially free.
10.
Transcribed Image Text:8. Consider a memory system with a cache access time of 30ns and a hit ratio of 90%. If the effective access time is 20% greater than the cache access time, what is the memory access time? 9. Consider a problem: some workers need to take tables across a road. The road only allows two people take one table across at a time, the table is heavy and must needs two peoples simultaneously. The below semaphore-based solution shows that one people can call the people_ready when he/she is ready to use the road. When a table is ready, the Table_ready is called. When two people can take one table, these functions provide one table with two people and call Enter_road. Assume the waiting queue use FCFS for the semaphore. Do you thỉnk this solution is good or not for the above problem? Please explain why. semaphore people_ready = 0; semaphore table_ready 0; void PeopleReadyO people_ready.up0: table_ready.down(: void TableReady() People_ready.down); People ready.down0: Enter road); Table_ready.up0: Table_ready.up(0: pe Given the following stream of page references by an application, calculate the number of page faults the application would incur with the following page replacement algorithm and fill in the contents of the page frames of memory after each memory reference. Assume that all pages are initially free. 10.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Probability Problems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education