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...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Editorial Office of Computer Engineering
2019-10-01
|
| Sarja: | Jisuanji gongcheng |
| Aiheet: | |
| Linkit: | https://www.ecice06.com/fileup/1000-3428/PDF/20191004.pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|