Question: Consider the Buddy algorithm for memory allocation used in traditional UNIX. Suppose the memory is 64MB. Consider the following sequence of events: (a) process X

Consider the Buddy algorithm for memory allocation used in traditional UNIX. Suppose the memory is 64MB. Consider the following sequence of events: (a) process X requests 7 MB, (b) process Y requests requests 12 MB, (c) process Z requests 2 MB, (d) process X exits releasing its memory. If the events are processed by the Buddy algorithm, draw figures to show the allocated and free blocks after every event in the above sequence. (a) (b) (d)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
