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...
Збережено в:
| Автор: | |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Editorial Office of Computer Engineering
2019-10-01
|
| Серія: | Jisuanji gongcheng |
| Предмети: | |
| Онлайн доступ: | https://www.ecice06.com/fileup/1000-3428/PDF/20191004.pdf |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|