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!
What is a buddy system?
We are dividing the memory as powers of two therefore the division will be 2, 4, 8, 16, 32, 64, 128, 256...i.e. in powers of 2 as well as we are selecting the space which is smallest but large enough to hold a process. Assume we have 1M memory. If a process 70k enters we are able to choose the 128k which will be the best fit for the process. Thus divide the 1M into 512k each. After that a further division of 256k each in one 512k afterward one of the 256 is divided into further 128keach and place the process in that. Similarly to that if another process enters the division and placing will continue.
Process A enters of 0k
A
128 128 256 512
Process B enters of 35k
B
.
128 64 64 256 512
Process c enters of 80k
C
128 64 64 128 128 512
Process A terminates
128
64 64 128 128 512
Process D enters of 60k
D
Process B terminates
64
64 128 128 512
Process D terminates
128 128 512
Process C terminates
512
Subsequent to this all the free spaces will join together. Later than the two adjacent processes having same space completed they will combine together and at last when all the processes are over the 1M memory will get back.
What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.
What makes a Just-in-Time inventory system differ from a traditional inventory system?
Explain the ExitThread Function used in the Windows NT ExitThread(ExitCode) The ExitThread( ) call is made to end the currently running thread. If the current thread is th
What do you mean by first fit? First fit allocates the first hole that is big sufficient .Searching can either start at the starting of the set of holes or where the previous f
Explain the various methods for handling deadlocks. A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the
Use and overview? Pure and impure interpreter?
what is tlb?
1. What must a kernel provide for an effective user-level thread implementation? 2. With respect to the quantum q in a scheduling algorithm, explain and discuss the impact of the
Demand paging With demand paging, a page is called into memory only when a location on that page is actually indexed during run time. With pre-paging, pages other than the one
Q. Explain the booting process for a Windows XP system? Answer: (1) Since the hardware powers on the BIOS begins executing From ROMand loads as well as executes the bootstrap
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