Prerequisite – Partition Allocation Methods
Static partition schemes suffer from the limitation of having the fixed number of active processes and the usage of space may also not be optimal. The buddy system is a memory allocation and management algorithm that manages memory in power of two increments. Assume the memory size is 2U, suppose a size of S is required.
- If 2U-1<S<=2U: Allocate the whole block
- Else: Recursively divide the block equally and test the condition at each time, when it satisfies, alloacate the block and get out the loop.
System also keep the record of all the unallocated blocks each and can merge these different size blocks to make one big chunk.
- Easy to implement a buddy system
- Allocates block of correct size
- It is easy to merge adjacent holes
- Fast to allocate memory and de-allocating memory
- It requires all allocation unit to be powers of two
- It leads to internal fragmentation
Consider a system having buddy system with physical address space 128 KB.Calculate the size of partition for 18 KB process.
So, size of partition for 18 KB process = 32 KB. It divides by 2, till possible to get minimum block to fit 18 KB.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Operating System | Process Table and Process Control Block (PCB)
- Automata Theory | Set 1
- Operating Systems | Set 14
- Zombie Processes and their Prevention
- Operating System | Bakery Algorithm
- Fragmentation at Network Layer
- Operating Systems | States of a process
- Computer Network | Carrier sense multiple access (CSMA)
- Data flow analysis in Compiler
- Three address code in Compiler