Name
Abstract | ||
|---|---|---|
Driven by the need for ultra-low latency, high throughput and low CPU overhead, Remote Direct Memory Access (RDMA) is being deployed by many cloud providers. To deploy RDMA in Ethernet networks, Priority-based Flow Control (PFC) must be used. PFC, however, makes Ethernet networks prone to deadlocks. Prior work on deadlock avoidance has focused on {\\em necessary} condition for deadlock formation, which leads to rather onerous and expensive solutions for deadlock avoidance. In this paper, we investigate {\\em sufficient} conditions for deadlock formation, conjecturing that avoiding {\\em sufficient} conditions might be less onerous. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/3005745.3005760 | HotNets |
Field | DocType | Citations |
Random graph,Latency (engineering),Computer science,Deadlock,Computer network,Ethernet,Flow control (data),Remote direct memory access,Throughput,Distributed computing,Cloud computing | Conference | 6 |
PageRank | References | Authors |
0.55 | 21 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuihai Hu | 1 | 47 | 5.49 |
| Yibo Zhu | 2 | 557 | 29.41 |
| Peng Cheng | 3 | 31 | 5.56 |
| Chuanxiong Guo | 4 | 2582 | 170.88 |
| Kun Tan | 5 | 1350 | 98.64 |
| Jitendra Padhye | 6 | 6770 | 514.84 |
| Kai Chen | 7 | 744 | 59.02 |