Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/163588
Title: Algorithm design for resource management of time critical applications in an edge-cloud architecture
Authors: Shaan, Aryaman
Keywords: Engineering::Computer science and engineering
Issue Date: 2022
Publisher: Nanyang Technological University
Source: Shaan, A. (2022). Algorithm design for resource management of time critical applications in an edge-cloud architecture. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/163588
Project: SCSE21-0471
Abstract: The advent of edge computing and 5G technology has opened up new possibilities in the cloud computing space. Due to lower wireless latency, the cloud can now cater to applications that are time critical and require quick response times. As such, it can now cater to applications that are safety-critical as well, like autonomous driving cars, robotic surgery, manufacturing etc. This introduces a new challenge to algorithm designers: more specifically, the challenge of resource allocation of deadline-constrained tasks on an edge-cloud architecture. The problem studied in this report was challenging due to the fact that each task needed two different types of resources allocated to it on two different servers. A task needs to first be offloaded to an access point after being allocated communication resources (bandwidth). Next, it needs to be transmitted to a server where it is allocated computational resources in order to be processed. Hence, the problem of allocating a variety of finite resources on different servers to deadline-constrained tasks, while trying to maximise profit, was challenging. This study proposes a well-performing heuristic algorithm to solve this resource allocation problem. It also introduces an approximation algorithm that has polynomial time complexity when the total number of access points and servers is a constant. An additional assumption the approximation algorithm needs is that resources can only be allocated in discrete units. Experiments devised to test the heuristic algorithm under various scenarios have also been shown.
URI: https://hdl.handle.net/10356/163588
Schools: School of Computer Science and Engineering 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Shaan_Aryaman_FYP.pdf
  Restricted Access
1.56 MBAdobe PDFView/Open

Page view(s)

262
Updated on Apr 19, 2024

Download(s) 50

79
Updated on Apr 19, 2024

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.