DocumentCode
253333
Title
TAPS: Task-aware preemptive flow scheduling
Author
Lili Liu ; Jinming Li ; Jianping Wu
Author_Institution
Tsinghua Nat. Lab. for Inf. Sci. & Technol., Beijing, China
fYear
2014
fDate
21-23 May 2014
Firstpage
1
Lastpage
2
Abstract
With various applications running, data centers are widely deployed in industry as the essential infrastructure around the world. These applications are interactive in nature with very demanding soft-real-time latency. Data centers execute a cloud application(task) distributedly, and a task is divided to many flows to shuffle a large amount of data. Therefore, low latency is provided to transmit the flows within deadlines in the data center network. Unfortunately, traditional transport protocols in data centers adopt fair sharing to share the link bandwidth equally. Flows cannot be completed within deadlines with these deadline-agnostic protocols, which leads to a waste of link bandwidth. Though some deadline-aware transport protocols are proposed recently to make more flows be completed before deadlines. However, cloud tasks, including financial service, online payment, scientific computation, are useful only if all the flows in the task can be completed before deadlines. Otherwise, the bandwidths consumed by the partially completed flows are wasted because of the failed task.
Keywords
cloud computing; computer centres; protocols; TAPS; cloud application; data center network; data centers; deadline-agnostic protocols; deadline-aware transport protocols; financial service; online payment; scientific computation; soft-real-time latency; task-aware preemptive flow scheduling; Bandwidth; Control systems; Processor scheduling; Protocols; Routing; Servers; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Local & Metropolitan Area Networks (LANMAN), 2014 IEEE 20th International Workshop on
Conference_Location
Reno, NV
Type
conf
DOI
10.1109/LANMAN.2014.7028628
Filename
7028628
Link To Document