M Tech Dissertations

Permanent URI for this collectionhttp://ir.daiict.ac.in/handle/123456789/3

Browse

Filters

2007 - 20092

Settings

Subject: search.filters.subject.Electronic resource

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Issues of computational resource allocation and load balancing in cloud computing using virtualization
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Bhadani, Abhay Kumar; Chaudhary, Sanjay
    With the advent of world wide web, the life of every person has changed drastically. No one can imagine a computer without being connected to the Internet. This dependency is likely to grow in coming years with the adoption of technologies like virtualization and cloud computing. Cloud Computing and Virtualizations one of the foremost technology which has attracted many researchers recently, which is directly going to benefit the end-users and data center service providers. It has many underlying benefits, one of them is directly related to the costs of deploying new servers. Few others are related to harnessing the power of the existing infrastructure and resources. When we look things from server side resource usage, things become quite challenging. Just to meet peak loads, high capacity servers are deployed, which remains underutilized most of the times on an average. With the help of virtualization technique, we can run multiple instances of different operating systems simultaneously. There are many virtualization tools available, which can be used to achieve maximum resource utilization. Making efficient use of computing resource (especially computational time) has always been a critical and challenging task. Several scheduling algorithms have been in place, proposed and implemented on one or other Operating Systems from time to time. But, since we have limited processors and things work in concurrent fashion, overload situation can occur hampering the overall objective, performance and throughput of the system. Things become even more challenging when it comes to distributed systems and load balancing. One of the key commercial player in the virtualization is VMWare, whereas Xen is an open-source free software. There are also few tools like Virtual Box, Linux VServer, OpenVZ, Virtuozzo and few others. Among these the most popular virtual machine monitor is Xen. The likely choice of experimenting with Xen is due to Open Source and wide acceptance by Linux community, and their continuous effort to improve, also it meets the need of industry standards at large. Consider a hypothetical scenario, where multiple instances of operating systems are running and is being used by the clients over the web in the form of cloud service. The user will use the system as if the whole server and/or system is dedicated to him. The user is completely unaware about the actual physical location of the server on which he is running his applications and disk storage space. Since, multiple OS are running on a single physical server, and multiple servers are running in the data centre. All connected via high speed network links. At some instance of time, one server may become overloaded, while other server may remain underutilized. This again poses challenge to distribute the load and make things work perfect in this situation. This situation can be handled using load balancing mechanism over the virtual machines. This thesis work tries to find a mechanism to balance the load based on computational time parameter of the virtual machines.
  • Thumbnail Image
    ItemOpen Access
    Checkpointing and recovery mechanism in grid
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2007) Mehta, Janki; Chaudhary, Sanjay
    Grid is a collection of distributed computing resources that performs tasks in co-ordination to achieve high-end computational capabilities. Grid Computing is a collective computing of a given task by breaking it into sub-tasks. Each sub-task could be large and run for several hours or days on a number of grid nodes. If a sub-task fails to complete even on a single site, all the computations need to be done again. In scalable distributed systems, individual component failures usually does not result in failure of the entire system. However, a single failure may crash an entire parallel application. Grid is dynamic in nature. Since the probability of a single component failure rises rapidly with the number of components in the system, as system grows in size, efficient recovery mechanism is most important for highly parallel mission critical and long running applications of grid environment. This thesis addresses a recovery mechanism using checkpoints to recover from Grid Service failure resulting in task or transaction failure in Computational Grid and Data Grid which will prevent computations to be restarted from scratch. Grid Service may fail as a result of hardware or software fault. A checkpoint is a point in time snapshot of a grid node in which its state information is stored. It will help in reducing the crash recovery time. This work helps in preserving two main objectives of grid namely optimal resource utilization and speedy computations which can be achieved by using resources in a better way for improving performance of system rather than engaging them in tasks like rollbacks resulting from cascading aborts. The saved state using checkpoints can also be used for job migration using job schedulers of grid on occurrence of critical failures like Operating System failure. Experiments conducted provide integration of proposed mechanism with standard grid Web Service Resource Framework and will aid in future development work.