dc.contributor.advisor | Chaudhary, Sanjay | |
dc.contributor.advisor | Bise, Minal | |
dc.contributor.author | Vora, Dhairya | |
dc.date.accessioned | 2017-06-10T14:39:16Z | |
dc.date.available | 2017-06-10T14:39:16Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | Vora, Dhairya (2011). Policy based resource allocation on infrastructure as a service cloud. Dhirubhai Ambani Institute of Information and Communication Technology, xi, 54 p. (Acc.No: T00321) | |
dc.identifier.uri | http://drsr.daiict.ac.in/handle/123456789/358 | |
dc.description.abstract | 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. | |
dc.publisher | Dhirubhai Ambani Institute of Information and Communication Technology | |
dc.subject | Cloud computing | |
dc.subject | Utility computing | |
dc.subject | Distributed computing | |
dc.subject | Computational grids | |
dc.subject | Computer systems | |
dc.subject | Database management | |
dc.subject | Cloud computing | |
dc.subject | Parallel processing | |
dc.subject | Electronic computers | |
dc.subject | Electronic data processing | |
dc.subject | Distributed processing | |
dc.subject | Automatic Data Processing | |
dc.subject | Workflow applications | |
dc.subject | Scheduling algorithms | |
dc.subject | Web services | |
dc.subject | Grid computing | |
dc.classification.ddc | 004.36 VOR | |
dc.title | Policy based resource allocation on infrastructure as a service cloud | |
dc.type | Dissertation | |
dc.degree | M. Tech | |
dc.student.id | 200911031 | |
dc.accession.number | T00321 | |