Scheduling Many-Task Computing Applications for a Hybrid Cloud
Saved in:
| Title: | Scheduling Many-Task Computing Applications for a Hybrid Cloud |
|---|---|
| Authors: | Mithila, Shifat Perveen |
| Source: | LSU Doctoral Dissertations |
| Publisher Information: | LSU Scholarly Repository |
| Publication Year: | 2022 |
| Collection: | LSU Digital Commons (Louisiana State University) |
| Subject Terms: | Cloud computing, Many-task computing, Decentralized scheduling, Cloud middleware, Computer Sciences |
| Description: | A centralized scheduler can become a bottleneck for placing the tasks of a many-task application on heterogeneous cloud resources. Previously, it was demonstrated that a decentralized vector scheduling approach based on performance measurements can be used successfully for this task placement scenario. In this dissertation, we extend this approach to task placement based on latency measurements. Each node collects performance metrics from its neighbors on an overlay graph, measures the communication latency, and then makes local decisions on where to move tasks. We present a decentralized and a centralized algorithm for configuring the overlay graph based on latency measurements and extend the vector scheduling approach to take latency into consideration. Our experiments in CloudLab, both in a simulated environment and in realistic conditions, demonstrate that this approach results in better performance and resource utilization than without latency information. |
| Document Type: | text |
| File Description: | application/pdf |
| Language: | unknown |
| Relation: | https://repository.lsu.edu/gradschool_dissertations/5928; https://repository.lsu.edu/context/gradschool_dissertations/article/7029/viewcontent/Mithila_diss.pdf |
| DOI: | 10.31390/gradschool_dissertations.5928 |
| Availability: | https://repository.lsu.edu/gradschool_dissertations/5928 https://doi.org/10.31390/gradschool_dissertations.5928 https://repository.lsu.edu/context/gradschool_dissertations/article/7029/viewcontent/Mithila_diss.pdf |
| Accession Number: | edsbas.CA86007A |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | A centralized scheduler can become a bottleneck for placing the tasks of a many-task application on heterogeneous cloud resources. Previously, it was demonstrated that a decentralized vector scheduling approach based on performance measurements can be used successfully for this task placement scenario. In this dissertation, we extend this approach to task placement based on latency measurements. Each node collects performance metrics from its neighbors on an overlay graph, measures the communication latency, and then makes local decisions on where to move tasks. We present a decentralized and a centralized algorithm for configuring the overlay graph based on latency measurements and extend the vector scheduling approach to take latency into consideration. Our experiments in CloudLab, both in a simulated environment and in realistic conditions, demonstrate that this approach results in better performance and resource utilization than without latency information. |
|---|---|
| DOI: | 10.31390/gradschool_dissertations.5928 |