Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/162821
Title: | Distributed dispatcher & scheduler with bandwidth constraint in edge computing | Authors: | Low, Nicholas Zhi Wei | Keywords: | Engineering::Computer science and engineering | Issue Date: | 2022 | Publisher: | Nanyang Technological University | Source: | Low, N. Z. W. (2022). Distributed dispatcher & scheduler with bandwidth constraint in edge computing. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/162821 | Project: | SCSE21-0868 | Abstract: | In this report, we study the distributed dispatcher & scheduler with bandwidth constraint in edge computing. We will first image and create a cloud computing environment for a centralised solution. We then consider networking bandwidth constraints and a server’s computational resources before creating a centralised algorithm for dispatching and scheduling. Subsequently, we implement this algorithm in a simulation environment and confirm our understanding of the cloud computing concept and test the algorithm’s correctness. After which, the cloud computing environment will be viewed from a decentralised perspective where a decentralised solution can be formulated. A final decentralised solution will be created by modifying the above centralised solution to abide by the three key characteristics of a decentralised system, concurrency, loosely coupled and independent of failure. | URI: | https://hdl.handle.net/10356/162821 | 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 | Size | Format | |
---|---|---|---|---|
FYP Final Report_Nicholas Low Zhi Wei.pdf Restricted Access | 756.65 kB | Adobe PDF | View/Open |
Page view(s)
61
Updated on Mar 28, 2024
Download(s)
6
Updated on Mar 28, 2024
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.