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!
MEMORY MANAGEMENT USING BUDDY SUSTEM
Here we are dividing the memory as powers of two 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 after that one of the 256 is divided into further 128keach and place the process in that. Similar to that if another process enters the division and placing will continue.
Subsequent to this all the free spaces will join together.
After the two adjacent processes having similar space completed they will combine together and at last when all the processes are over the 1M memory will get back.
What is named pipes?
Difference between cache and associate memory
Q. Distinguish among PCS and SCS scheduling. Answer: PCS scheduling is completed local to the process. It is how a thread library schedules threads onto available LWPs. SCS sch
Do you have writers that can use the software AIMMS version 3.9?
Q. Explain application of consumer behaviour? Consumer behaviour is described as the dynamic interaction of affect and cognition and behaviour and the environment by human bein
what is dual mode operation
Question 1 Brief the following distributed computing system model Question 2 Explain the components involved in implementation of RPC mechanism Question 3 What is
What is linked allocation, as detailed in text? Directory has pointers to first and last blocks of file. Every block of file (except last) has pointer to the next block.
Q. Present an algorithm for reconstructing a logical ring after a process in the ring fails? Answer: Typically distributed systems utilize a coordinator process that performs
Question: Concurrency and Synchronization a) Define the following terms: I. Critical section II. Mutual Exclusion III. Deadlock IV. Starvation. b) Name three methods w
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