Abstract
Query response times are critical for cluster computing applications in data centers. In this letter, we argue that to optimize the network performance, we should consider the latency of the flows suffered loss, which are called tardy flows. We propose two tardy flow scheduling algorithms and show that our work offers significant performance gains through performance analysis and simulations.
Original language | English |
---|---|
Pages (from-to) | 2400-2403 |
Number of pages | 4 |
Journal | IEICE Transactions on Information and Systems |
Volume | E99D |
Issue number | 9 |
DOIs | |
Publication status | Published - 2016 Sept |
Keywords
- Compute clusters
- Data center networks
- Flow completion time
- Flow scheduling
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence