Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Deadlock: A- Given the sequence of resource requests below, draw the resource allocation graph and answer the following questions: - Process A is holding resource S and is requesting resource X. - Process B is holding resources X, Y and is requesting resource W. - Process C is holding resource W and is requesting resource Z. - Process D is holding resource Z and is requesting resource Y and S. 1- List the reasons which causes deadlock to occur in multiprogramming environment. 2-Discuss how can the deadlock detection algorithm for one resource find out if a deadlock exists in the above sequence? 3- List the deadlocked processes. 4- Discuss at least two possible recovery solutions. Which one is better? Why? 5- List the recovery process-scheduling sequence corresponding to each solution given in the question above.
B- Name a proper method to be used for each of the following cases: Banker's algorithm - Deadlock avoidance for multiprogramming system. ------- preemption-------------------- - Deadlock recovery for real-time system. --------------------------- - Disk head scheduling for busy system. --------------------------- - File system implementation for batch applications. --------------------------- - Data transfer method for Database applications. --------------------------- C- Consider a system state which consists of the set of running processes A, B, C, D, and E. Assume that the system has four different types of resources R1, R2, R3, and R4. The total numbers of resource copies available in the system are: 6, 4, 4, and 2 in order. The maximum claim and the current resources allocation tables are given below.
Process
R1
R2
R3
R4
A
3
2
1
B
4
C
0
D
E
Maximum Claim Table
Current Allocation Table
1- List the resource allocation table for each individual resource type. 2- Is the current system state safe? Why?3- Answer the above question if D requests a copy of R4 and another copy of R2.Answer question number 2above if C requests a copy of R1 and at the same time B reserved a copy of R3.
Seek time 1 ms for every 100 tracks traversed. Initial track position is 0. Compute average seek time & rotational latency.
Think about a particular system that does not have an interrupting clock. The only way a procedure can lose the processor is to voluntarily surrender it.
What is file system reliability and explain the roles of error handling, back up, and file checker methods in supporting the file system reliability?
What are the formulas for these Worst Case Time Complexities?
Consider the advantages and disadvantages of each major operating system that Amy might use on the Web server. If you don't think that one operating system is clearly superior for this application, describe why.
Give an example of a three-process 4 resource system that is in an unsafe state. Explain why it is in an unsafe state. How many more resources would need to be added to make it a safe state?
intermediate level tasks below is a simple program. it creates 2 threads. the first thread keeps printing out x on the
Assume two hosts A and B are connected via router R. A-R link has infinite bandwidth; A-R link has infinite bandwidth; draw curves for throughput, delay, and power, each as function of load.
Why are there so many DVD formats?
What is the format of the processor's logical address. What is the length and width of the page table (disregarding the "access rights" bits)
Describe all the necessary equipment and explain the costs involved in the creation of the system and describe the ongoing maintenance that will be required
questiona process is a program under execution and as it executes it changes state. the state of a process is defined
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd