Buddy system of the memory allocation
Describe the Buddy system of the memory allocation.
Expert
Free memory is maintained in the linked lists, each of equivalent sized blocks. Any such block is of size 2^k. If some memory is needed by a process, the block size of the next higher order is selected and broken to two. Note that the two such pieces vary in address only in their kth bit. These pieces are termed as buddies. If any used block is freed, the OS checks to see if its buddy is as well free. If so, it is re-joined, and place to the original free-block linked-list.
Explain several operating system services?
Give brief introduction of the term command interpreter?
Illustrate the difference between firewall and proxy server.
Explain two data items which is used within the petersons solution?
With the help of an example describe how you convinced someone to do something that they were not too keen on doing.
Describe briefly the term read-write locks?
What do you mean by DNS? Explain why it is used? Also describe ‘forward lookup’ and ‘reverse lookup in the DNS?
Write down the merits of distributed system?
Describe the term busy waiting and spinlock.
Illustrate the term Mutual Exclusion.
18,76,764
1960215 Asked
3,689
Active Tutors
1452528
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!