No abstract

In the Information Technology world, cloud computing technology offering unlimited amount of IT resources and services to end users over the internet on pay-per-use basis. End users are accessing the cloud services on their mobile or personal computers. Service providers are upgrading their services very frequently to enhance the services, and to use their upgraded services, end users are also required to update the specification of their devices. But it will be very costly for the end users to upgrade their devices for high specification to use the enhanced services. Desktop Virtualization is an extensive technology of cloud services. It is the new concept, in which users can access the virtual desktop of required specifications, software and operating system on their old devices anytime and anywhere. With the help of desktop virtualization, users will be benefited by avoiding the cost of frequent upgradation of mobile or personal computer system. Desktop virtualization technology is proving to be a boon for large and small organizations who have to upgrade their computer system with new technology, which is a very costly and challenging process. Desktop virtualization avoids upgrading the hardware of the client machine repeatedly. It allows us to access all applications and data at a low cost on our old machine. This paper presents the comparative analysis of various approaches for desktop virtualization and various challenges which required the solution. Analysis presented in paper has been done based on various performance parameters which will provide the end users low-cost cloud services and best performance on their mobile or personal computers.

A distributed processing environment consists of one or more applications spread over several computers. These computers may be geographically separated from one another. The applications may be executed on different platforms using different operating systems and telecommunication protocols. In short, a distributed operating environment offers a variety of information system solutions regardless of the location of the user, user’s operating system or the equipment using by user. Performance enhancement of the distributed networks is a major and challenging problem for the researchers. In this paper, algorithm designed, have to allocate m tasks to n processors (m>n) in the environment of distributed processing. These m tasks are to be assigned on the n processors of system through Greedy algorithm of task scheduling. The starting time and finishing time of the processing of a task is considered and denoted by Si and Fi where i= 1, 2, 3, 4, 5…… m. In order to evaluate the optimal time, present algorithm obtains the set of assigned and on assigned tasks. Based on these sets allocation has been made. The method is presented into algorithmic form and several sets of input data have been implemented to test the effectiveness of the algorithm.