No abstract

An operating system has some rules that control the execution of processes. These rules are called the scheduling algorithms. Scheduling algorithms make the organization and management of resources in a hardware. Two of these algorithms are round robin and priority scheduling. In this paper we will stimulate the logic of these algorithms with two simple programs written in c language.

In this paper the authors evaluate the CPU Consumption, Memory Utilization and Transfer Time between 5 Hypervisors XEN-PV, XEN-HVM, OpenVZ, KVM-FV and KVM-PV by using FTP and HTTP approaches. All the results are compared with the Real Environment. From the experimental results, the authors have concluded that OpenVZ and XEN-PV have better performance than other hypervisors. The worse performance is for KVM Hypervisor. In our paper we have used some scripts in order to evaluate the performance of these Hypervisors. Keyword: XEN-PV, XEN-HVM, OpenVZ, KVM-FV, KVM-PV, FTP approach, HTTP approach. 2011 Third International Conference on Intelligent Networking and Collaborative Systems 978-0-7695-4579-0/11 $26.00

The speed at which the process will be executed doesn't depend only on the implementation of the architecture of the computer, the frequency of the clock, but also regard to the politics the algorithm follows and the data structure the algorithm is implemented. The usage of efficient page replacement algorithms, that choose which page in memory will be swapped if a page fault, are required to implement in a virtual memory system. A lot of algorithms are developed during the years for page replacement. Each algorithm has the aim to have less number of page faults. With less page faults we have an improvement in performance and the speed of the process is increased. In this paper three algorithms (FIFO, LRU and Optimal page replacement algorithms) will be tested and will be shown the one that has the best performance.

No abstract