Theses and Dissertations

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

Browse

Search Results

Now showing 1 - 4 of 4
  • ItemOpen Access
    Policy based resource allocation on infrastructure as a service cloud
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Vora, Dhairya; Chaudhary, Sanjay; Bise, Minal
    Cloud computing refers to the provision of computational resources on demand. Resource allocation is an important aspect in cloud computing. Cloud user asks for resources in terms of a lease. Lease stores the information about required resources and the time at which these resources are required. Cloud provider accepts the lease if it can provide guarantee for assigning resources at asked time to the cloud user. Better scheduling algorithm can accept more number of leases and hence give better resource utilization. Cloud provides four types of leases: immediate, advance reservation, best effort and deadline sensitive. Immediate allocation policy accepts the lease if resources are available, else it rejects the lease. Advance reservation policy accepts the lease if resources are available at the asked time, else it rejects the lease. Best effort allocation policy accepts the lease as soon as the resources are available. Deadline sensitive leases have parameters like required resources, startTime, endTime and duration. Scheduler can accept such lease by providing required resources for the asked duration of time between given startTime and endTime. Haizea is a resource lease manager which handles the scheduling of the lease. Proposed algorithm extends the current scheduling algorithm of Haizea for deadline sensitive type of leases. Aim of the thesis is to improve resource utilization by extending the current scheduling algorithms of Haizea. Proposed scheduling algorithm accepts more number of leases by dividing a deadline sensitive lease into multiple slots and by back filling already.
  • ItemOpen Access
    Service integration on social network
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Patel, Mehul; Chaudhary, Sanjay; Bise, Minal
    Microblogging services are part of social network platforms, which allow people to exchange short messages. Social networks provide people to play an active role in collecting, analyzing and reporting news and information. People can use social network platform for marketing, buying and selling of their products. A sellers can tweet regarding product information including links of related photos, videos etc. A buyer can show interest in the product by means of tweets. Social network can be used as a mechanism to bring sellers and buyers closer. It provides a common platform for buyers and sellers to sell and buy their products. Microblogs can be parsed and analyzed to generate useful suggestions, e.g. sellers can be informed about potential buyers to get higher profit. Such information can be used to generate classified information to help users to take decision, e.g. minimum expected price of a crop that sellers expect in a given region. Microblogs can be written in different regional languages. Agro-produce marketing information can be processed and then stored in RDF/RDF(S) and OWL data store. SPARQL and conjunctive queries with pellet like reasoner or SPARQL-DL can be used to generate classified summarized information from RDF/RDF(S) and OWL data store.
  • ItemOpen Access
    Scheduling and isolation in virtualization
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Somani, Gaurav; Chaudhary, Sanjay
    Virtual machine (VM) based server implementation is popular for numerous advantages like fault isolation, efficient hardware utilization, security and ease of management. Virtual machine monitor (VMM) like Xen is a popular virtualization software to manage virtual machines by scheduling them to use resources such as CPU, memory and network. Performance isolation is desirable in virtual machine based infrastructures to meet Service Level Objectives (SLO). In performance isolation, no virtual machine should affect performance of other co hosted virtual machine, which shares the same hardware. Virtual machine schedulers are the key operators in allocating resources among virtual machines. This requires special attention towards scheduling as fairness and resource isolation are the key requirements for which any user virtualizes servers. I/O models are the main bottlenecks in sharing resources among virtual machines. To evaluate isolation property, we need to analyze resource sharing and utilization among virtual machines.

    The thesis aims to evaluate the performance isolation achieved by Xen in different scheduler configurations. Experiments are performed using different resource intensive applications to get an insight into isolation. These tests include CPU, Network and Disk I/O intensive benchmarks. Considering the equal importance of I/O applications in virtualized environment, tests for interactive applications in conjunction with CPU intensive applications are also performed. Experiment results show that Isolation is critical when we run I/O application in conjunction with CPU intensive applications. But effective parameter and scheduler configuration can lead towards better isolation as well as utilization. Global balancing of load across all the available physical processors in a physical machine is important characteristic of a scheduler. Xen’s Credit scheduler aims to achieve global load balancing on multiprocessor systems. Xen’s Simple Earliest Deadline First (SEDF) scheduler can not be used in production environment due to unavailability of this important feature of load balancing. Many applications requires scheduler like SEDF in their implementation to fulfill the requirement of interactive applications. This thesis investigates requirements of this feature and discusses algorithmic design and implementation of a developed user space load balancing program. Experiments show a balance among number of physical processors with better utilization of

  • ItemOpen Access
    Embedding binary trees and caterpillars into the hypercube
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2008) Srivastava, Abhishek; Sunitha, V.
    Embedding graphs is an important and well-studied theory in parallel computing. Finding the embedding of trees into hypercubes is an important, interesting and difficult problem. This work studies the embedding of binary trees and caterpillars into hypercubes. We give an embedding for a special type of binary tree into its optimal hypercube. We also present embedding of generalized ladders as subgraph into the hypercube. Through an embedding of caterpillars into generalized ladders, we have obtained an embedding of a class of caterpillars into their optimal hypercube.