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.
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
Q. Explain a mechanism by which one segment could belong to the address space of two different processes. Answer: Because segment tables are a collection of base-limit register
As we already know, threadsmust ensure consistency; otherwise, race conditions (non-deterministic results) might happen. Now consider the "too much milk problem": two people share
The code should be nicely formatted with plenty of comments. It should be easy to read, properly The summary section should include three parts: (1) Record the running t
Synchronization In communication among processes messages passed may be blocking or nonblocking - also called as synchronous and asynchronous. Blocking send : The sending pr
Explain bounded buffer and unbounded buffer. Here in a producer-consumer problem the producer process produces information that is consumed by a consumer process. At this time
How does user specify block to be fetched in direct access? By specifying the relative block number, relative to first block in file, which is block 0.
Explain in detail about ipc in linux
PART A Question 1 Using your own words, explain what a continuous random variable and a continuous probability density function are. Give examples. Question 2 Gi
how intranet can make your business effective
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