Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/452529
Title: | Optimization of resource Allocation in cloud computing using Service based algorithms |
Researcher: | Divya, R |
Guide(s): | Jayanthi, VE |
Keywords: | Engineering and Technology Computer Science Computer Science Information Systems Wireless networks Algorithm optimization Heuristic algorithm |
University: | Anna University |
Completed Date: | 2021 |
Abstract: | Cloud computing offers a lot of computing, storage and memory based resources to the users on the pay for use basis. Cloud Service Provider (CSP), users and the resources are entangled in the service cycle of cloud computing. All the Cloud computing services aim at profit and Quality of Service. The Profit of CSP depends on various factors. The foremost factor is the efficient usage of resources in cloud and it involves the process of scheduling and providing them to appropriate cloud server. Scheduling the CR (Cloud Request) is done based on the cost factors, to achieve best profit. The pricing model of cloud comes as the second factor. It is decided by the CSP, on their own standard terms and investment. Hence, optimizing the cloud based on resources and investment, plays an important role in achieving profit and efficiency. newlineInitial work deals with the deadlock prevention in Software as a Service (SaaS) cloud. An improved queuing model with Wait for resource algorithm is proposed as a solution of deadlock free cloud. For better resource utilization, the proposed model is designed to queue the arriving CRs in the first step and then a session is created between the CR and the servers with constraint on the number of CRs per session. Wait for resource algorithm pre-determines the resource needs of CR before allocation, due to this the deadlock is avoided. The proposed model gives 33 sec of average make span, 60% average resource utilization and a throughput factor of 1.3. It also gives least average waiting time and outperforms the load balancing algorithm, which produced varying response time for random applications running on cloud, without deadlock. newline |
Pagination: | xiv,129p. |
URI: | http://hdl.handle.net/10603/452529 |
Appears in Departments: | Faculty of Information and Communication Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 32.29 kB | Adobe PDF | View/Open |
02_prelim pages.pdf | 3.46 MB | Adobe PDF | View/Open | |
03_content.pdf | 23.33 kB | Adobe PDF | View/Open | |
04_abstract.pdf | 92.83 kB | Adobe PDF | View/Open | |
05_chapter 1.pdf | 384.24 kB | Adobe PDF | View/Open | |
06_chapter 2.pdf | 304.53 kB | Adobe PDF | View/Open | |
07_chapter 3.pdf | 402.81 kB | Adobe PDF | View/Open | |
08_chapter 4.pdf | 271.2 kB | Adobe PDF | View/Open | |
09_chapter 5.pdf | 384.32 kB | Adobe PDF | View/Open | |
10_annexures.pdf | 201.12 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 131.44 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: