Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/577990
Title: Optimizing Scheduling in Container Based Cloud Architecture
Researcher: Acharya, Jignaben Navanitlal
Guide(s): Suthar, Anil C.
Keywords: Computer Science
Computer Science Software Engineering
Engineering and Technology
University: Gujarat Technological University
Completed Date: 2023
Abstract: quotAt present, cloud computing is the most essential model in computing technology. Cloud computing has received a great deal of attention because of its focus on providing fast and reasonable computing resources for customers. Distribution and management of limited cloud resources among users is a very challenging task. Docker-based clouds are a new emerging model based on container technology. newline newlineProject aims to address the problem of scheduling containers in cloud computing using Docker. Docker supports the spread scheduling strategy by default. Its main objective is to place containers on all available machines in the cluster. However, it does not consider load on machines. Also, if a node in the cluster fails, the spread strategy will distribute its containers uniformly across the remaining nodes. A consequence of this is that some machines in the cluster become overloaded and some machines become under loaded. newline newlineAs a result, we optimize the performance of docker clusters by taking into account the CPU usage of every machine while placing containers on machines. That will minimize the number of machines, ensure load balancing and maximize resource utilization. By using this scheduler, user can select a node with a minimum CPU utilization to place the initial docker container to improve load balancing and minimize the number of machines in the docker cluster as much as possible. In addition, we examine the failures of the servers on which the containers run. Hence, we proposed another fault tolerant container scheduling algorithm that works even when any of the nodes in the cluster fail. Both algorithms are evaluated and compared with existing spread algorithms in a real cloud environment. Compared to a spread strategy, both scheduling algorithms use minimal number of machines in the docker cluster as well as proper resource utilization. newlinequot newline newline
Pagination: A4
URI: http://hdl.handle.net/10603/577990
Appears in Departments:Computer/IT Engineering

Files in This Item:
File Description SizeFormat 
02_prelim pages.pdfAttached File958.8 kBAdobe PDFView/Open
10_annexures.pdf647.3 kBAdobe PDFView/Open
80_recommendation.pdf2.49 MBAdobe PDFView/Open
abstract.pdf565.74 kBAdobe PDFView/Open
chapters-1.pdf605.11 kBAdobe PDFView/Open
chapters-2.pdf1.72 MBAdobe PDFView/Open
chapters-3.pdf449.22 kBAdobe PDFView/Open
chapters-4.pdf715.94 kBAdobe PDFView/Open
chapters-5.pdf2.94 MBAdobe PDFView/Open
chapters-6.pdf415.8 kBAdobe PDFView/Open
index-table of contents.pdf576.71 kBAdobe PDFView/Open
title.pdf188.62 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: