An Approximate Smallest-Effective-Bottleneck-First Coflow Scheduling Mechanism
Aiming at the Coflow scheduling problem in the prior knowledge unknown scene,an Approximate Smallest-Effective-Bottleneck-First(A-SEBF) Coflow scheduling method is proposed.Coflow's scheduling order is determined by combining the current size and width of Coflow,and the Coflow is characterized by la...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Editorial Office of Computer Engineering
2019-10-01
|
| Col·lecció: | Jisuanji gongcheng |
| Matèries: | |
| Accés en línia: | https://www.ecice06.com/fileup/1000-3428/PDF/20191004.pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|