.png){kind=icon}
.png){kind=icon}
Return
Scheduling Multi-Component Applications Across Federated Edge Clusters With Phare
.png){kind=icon}
OA
AI
DOI：10.1109/OJCOMS.2024.3377917.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The shift towards agile microservice architecture has enabled significant benefits for IT companies but has also resulted in increased complexity for Cloud orchestration tools. Traditional tools were designed for centralized data centers and are ineffective for locating microservices in geographically-distributed edge-like infrastructures. This paper presents Phare, a decentralized scheduling algorithm designed to optimize the placement of microservices by satisfying their computing and communication demands while minimizing deployment costs. Phare employs a heuristic-based approach to solve the NP-Hard scheduling problem, prioritizing the microservices with the more stringent requirements and placing them on the most convenient computing facilities, based on the concept of affinity, contributing to the field by providing a more holistic approach to resource scheduling in edge computing. We validate our approach against Firmament, the state-of-the-art workload scheduling algorithm for component-based applications, on simulated edge infrastructures with hundreds of clusters. Phare achieves up to a 10x reduction in terms of deployment costs compared to Firmament while providing a much lower scheduling latency.
Keywords:
Costs
Microservice architectures
Task analysis
Scheduling algorithms
Data centers
Cloud computing
Resource management
Resource sharing
cloud-to-edge
service allocation
Journal
I
IF:
4.3
Papers:
1.7K
Citations:
991