Policy based resource allocation on infrastructure as a service cloud
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.
Collections
- M Tech Dissertations [923]
Related items
Showing items related by title, author, creator and subject.
-
Path complexity of maximum segment sum problem
Mishra, Devesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ... -
On designing DNA codes and their applications
Limbachiya, Dixita (Dhirubhai Ambani Institute of Information and Communication Technology, 2019)Bio-computing uses the complexes of biomolecules such as DNA (Deoxyribonucleic acid), RNA (Ribonucleic acid) and proteins to perform the computational processes for encoding and processing the data. In 1994, L. Adleman ... -
Efficient ASIC implementation of advanced encryption standard
Joshi, Ashwini Kumar (Dhirubhai Ambani Institute of Information and Communication Technology, 2008)In spite of the many defense techniques, software vulnerabilities like buffer overflow, format string vulnerability and integer vulnerability is still exploited by attackers. These software vulnerabilities arise due to ...