Abstract: The focus of the paper is to represent an algorithm that how the load to virtual machine can be deduced and avoid the dead lock while allocating the processes to virtual machine. In VM while processes are allocate they executes in queue, the first process get resources, other remains in waiting state. As rest of VM remains idle. To utilize the resources, here we purposed an algorithm that will avoid deadlock and utilize each VM successively.
Keywords: VM (Virtual machine).
Title: VIRTUAL MACHINE SCHEDULING TO AVOID DEADLOCKS
Author: Rajeev Kumar, Rajiv Ranjan
International Journal of Computer Science and Information Technology Research
ISSN 2348-120X (online), ISSN 2348-1196 (print)
Research Publish Journals
