TETRA: Time- and Energy-Aware TOPSIS-based Resource Allocation
| dc.contributor.advisor | Al-Masri, Eyhab | |
| dc.contributor.author | Paruchuri, Sri Vibhu | |
| dc.date.accessioned | 2024-04-26T23:19:26Z | |
| dc.date.issued | 2024-04-26 | |
| dc.date.submitted | 2024 | |
| dc.description | Thesis (Master's)--University of Washington, 2024 | |
| dc.description.abstract | With the exponential growth of IoT devices, there has been an increasing demand for distributed computing paradigms such as edge computing and fog computing to address the limitations of cloud computing. Resource scheduling is a critical aspect across the different layers, as it ensures that the available resources are efficiently utilized and allocated to different tasks. Most of the existing resource scheduling algorithms for fog computing environments focus primarily on performance metrics such as makespan, resource utilization, and cost separately. However, there is a need for dynamic multi-objective optimization techniques that can be energy-aware while not compromising on makespan. In this thesis, we introduce a novel resource scheduling algorithm for fog computing environments that optimizes time and energy consumption, which ensures higher performance and lower data center costs. The algorithm considers all the available Virtual Machines (VM) in the fog computing environment. Then, it uses the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS), which is a multi-criteria decision analysis (MCDA) method, to identify the optimal resources. Our algorithm considers multiple computational parameters such as Million Instructions Per Second (MIPS), the number of processing cores, and thermal design power (TDP) to rank available resources. We conducted a series of experiments, and our algorithm achieves a multi-objective optimization for scheduling IoT tasks on higher-ranked resources resulting in a 7%, 19% and 25% optimization rates in makespan over Best-Fit, Greedy and First-Fit algorithms respectively. In addition, the optimizations in energy consumption over the Best-Fit, Greedy and First-Fit algorithms from our experiments were 1%, 41% and 27%, respectively. | |
| dc.embargo.lift | 2026-04-16T23:19:26Z | |
| dc.embargo.terms | Restrict to UW for 2 years -- then make Open Access | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.other | Paruchuri_washington_0250O_26614.pdf | |
| dc.identifier.uri | http://hdl.handle.net/1773/51334 | |
| dc.language.iso | en_US | |
| dc.rights | CC BY | |
| dc.subject | Cloud Computing | |
| dc.subject | Energy Aware | |
| dc.subject | Fog Computing | |
| dc.subject | Resource Allocation | |
| dc.subject | Resource Scheduling | |
| dc.subject | Time Aware | |
| dc.subject | Computer science | |
| dc.subject.other | Computer science and systems | |
| dc.title | TETRA: Time- and Energy-Aware TOPSIS-based Resource Allocation | |
| dc.type | Thesis |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Paruchuri_washington_0250O_26614.pdf
- Size:
- 2.8 MB
- Format:
- Adobe Portable Document Format
