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!
Question :
a) Consider table 1.0 below, assume the processes arrived in the order P1, P2, P3, P4 at time shown and need the indicated burst time (both in milliseconds).
Create a Gantt chart for the preemptive Shortest Job First (SJF) scheduling algorithms below showing when each process will be scheduled, and also determine the average waiting time for each process.
b) Now consider table 2.0 and create the Gantt charts for each of the scheduling algorithms below showing when each process will be scheduled, and also determine the average waiting time for each of them, assuming they arrived in the following order P1, P2, P3, P4.
i. First-Come-First-Serve (FCFS) ii. Round Robin with Quantum of 2 milliseconds iii. Round Robin with time quantum of 6 milliseconds iv. Round Robin with time quantum of 9 milliseconds
c) Based on the average waiting times you calculated in part (b) above, what can be deduced about the value of the time quantum for the round robin scheduling algorithms?
d) What is the main problem with the FCFS scheme?
How does communication takes place in a distributed system? Distributed systems depend on the networking for their functionality. A network is a communication path among two
Q. Data transfer between two processes? Communication: Data transfer between two processes is essential for some time. Both processes are on the one computer or on different
Question: a) Illustrate with the help of a diagram, the difference between two tier and three tier architectures. b) Explain in what kind of environment, a peer to peer envi
Define Maintaining Data on a Per Client Basis Perhaps the most dramatic syntactical programming change for the application developer of client – server applications is maintain
Q. In a ring-protection system the level 0 has the greatest access to objects and level n (greater than zero) has fewer access rights. The access rights of a program at a partic
KERNEL-LEVEL THREADS (KLT) In this level every thread management is done by kernel .No thread library except an API system calls to the kernel thread facility exists. The kern
Describe the purpose of the checkpoint mechanism. How habitually must checkpoints be performed? Explain how the frequency of checkpoints affects: System performance while no
Safety algorithm : This is to make sure if the system is in safe state or not. It may need an order of m x n2 operation to determine if the state of the system is safe or not.
With software algorithms for mutual exclusion, such as Dekker's algorithm, Peterson's algorithm, or Lamport's bakery algorithm, note that optimizing compilers and out-of-order exec
Q. We have an OS (operating system) for a machine that uses base and limit registers however we have modified the machine to provide a page table. Can the page tables be set up to
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: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd