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, why thread is known as the lightweight process?
Explain two data items which is used within the petersons solution?
Briefly explain the term ‘deadlock’?
Give brief introduction of the term command interpreter?
Briefly explain the term ‘Process’ in reference of OS?
Explain what do you understand by the FPCB?
Write a short note on SMP?
Write a brief note on busy waiting?
Explain the term deadlock and starvation?
Write down the probable threads which thread can have?
18,76,764
1922963 Asked
3,689
Active Tutors
1444035
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!