Placement and replacement algorithms
In the framework of memory management, describe the placement and replacement algorithms?
Expert
Placement algorithms find out where in available real-memory to load a program. Common techniques are first-fit, next-fit, and best-fit. Replacement algorithms are used if memory is full, and one process (or part of process) requires to be swapped out to accommodate a new program. The replacement algorithm finds out which are the partitions to be swapped out.
Explain the following: a) Adaptive mutex. b) Turnstile.
Describe what is UFD and MFD.
Illustrate the term Asymmetric Multiprocessing.
Describe in brief the FAT file systems.
Illustrate the term DOMAIN? Write down the difference between the domain and a workgroup?
Explain whether it is possible to have dead lock including the single process?
Describe the Buddy system of the memory allocation.
what are the two procedures used in a recovery algorithm?
What do you understand by the term resident set and working set of a process?
What do you mean by the system calls?
18,76,764
1947083 Asked
3,689
Active Tutors
1415840
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!