.png){kind=icon}
Return
Load balancing for integer loads using a modified approach
.png){kind=icon}
OA
AI
DOI：10.1016/j.array.2026.101130.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Integer load balancing via a deterministic BFS-based spanning tree. • Balancing flow with reduced l2-norm via spanning-tree-distance ordering. • Runs in O(n3) time for any weakly connected directed graph. • Fewer network edges used, lowering communication overhead. • Validated on the Petersen graph, cycle C6, and the hypercube Q3.
Keywords:
05C50
05C85
68M14
68R10
Load balancing algorithm
l2-norm
Balancing flow
Spanning tree
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
824
Citations:
1.2K
Organization
Cited Papers
An Energy-Aware Task Offloading and Load Balancing for Latency-Sensitive IoT Applications in the Fog-Cloud Continuum.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveShareSaveShareSaveShareSave
View more