Show Bid Request
helps
Bid Request Id: 5697
|
|
|
|
Posted by: |
49ers (5 ratings)
(Software buyer rating 10 )
|
|
Non-action Ratio: |
Very Good - 20.00%
|
|
Posted: |
Nov 29, 2001
12:52:59 AM EDT
|
|
Bidding Closes: |
Dec 13, 2001
12:53:50 AM EDT
|
|
Viewed (by coders): |
335 times
|
|
|
|
|
Description:
1.Assume that processes P1-P4 are executing and resources R1-R3 exist. Suppose the following sequence occurs:
1.P1 requests R1.
2.P4 requests R2.
3.P3 requests R1.
4.P3 requests R2.
5.P3 requests R3.
7.P1 requests R3.
8.P2 requests R1.
9.P4 requests R3.
Draw a resource-allocation graph. Is a deadlock possible based upon the graph (assuming that the other conditions for a deadlock hold)? Justify your answer. If one does exist, which processes are involved?
2.Suppose that we have a very large data structure which spans several pages and the the data is organized as either a stack or a hash table. Contrast the performance of paging on the stack versus hash table.
3. Assume we have a paged memory. The page table is held in registers. It takes 8 milliseconds to service a page fault if an empty page is available or the replaced page is not modified, and 20 milliseconds if the replaced page is modified. Memory access time is 100 nanoseconds. Assume that the page to be replaced is modified 70 percent of the time. What is the maximum acceptable page-fault rate for an effective access time of no more than 200 nanoseconds? (Hint: Think about how you determine effective access time. This is just an algebra problem.)
4.The enhanced second chance algorithm is a clock algorithm that takes into account whether a page is dirty in addition to whether or not it is modified. It functions like the clock algorithm, except that instead of having only two classes of page: referenced versus unreferenced, it has four classes:
1.not referenced, not modified
2.not referenced, modified
3.referenced, not modified
4.referenced, modified
The most desirable type of page to replace is one that has not been referenced or modified and the least desirable is one that has been referenced and modified. It functions much as the second chance algorithm, looking for a page of the most desirable class and resetting reference bits as the clock is advanced.
Justify the ordering. Then write pseudocode to implement this algorithm. Do not make multiple passes through the clock to look for pages of the most desirable category present.
Deliverables:
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
This bid was accepted by the buyer!
|
$30 (USD)
|
Dec 2, 2001
1:27:54 AM EDT
|
9.81
(Excellent)
|
|
|
| I am experienced developer in C++ , Operating Systems and algorithms and will be able to solve your assignment. |
|
|
|
|
|
|
