1 1 vote In a Buddy memory allocation system, a process is allocated an amount of memory whose size is the smallest power of $2$ that is greater than or equal to the amount requested by the process. A system using buddy memory allocation has $1MB$ memory. For a given sequence of nine processes, their respective memory requirements in $KB$ are$:50, 150, 90, 130, 70, 80, 120, 180, 68.$ Illustrate with an allocation diagram to justify whether all the requests, in the given order, can be complied with. Assume that memory once allocated to a process is no longer available during the entire span of the above sequence. Calculate the total memory wasted due to fragmentation in your memory allocation by the above scheme. Operating System descriptive isi2012-pcb-cs operating-system memory-management + – go_editor 1.0k views answer comment Share Follow Print See 1 comment 1 1 comment reply Priyansh Singh commented Sep 22, 2020 reply Follow flag (i) Request 120,180,68 can’t be full filled. (ii) Memory wasted due to Internal fragmentation → 390 KB 0 0 replyShare Please log in or register to add a comment.
0 0 votes Shaded region is internal fragmentation. And last 3 requests won't be fulfilled. Franz Kafka answered Apr 25, 2025 • edited Apr 25, 2025 by Franz Kafka Franz Kafka comment Share Follow 0 reply Please log in or register to add a comment.
