0x13:reports:d2t2t05-shenango-achieving-high-cpu-efficiency-for-latency-sensitive-datacenter-workloads
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| 0x13:reports:d2t2t05-shenango-achieving-high-cpu-efficiency-for-latency-sensitive-datacenter-workloads [2019/04/10 12:47] – ehalep | 0x13:reports:d2t2t05-shenango-achieving-high-cpu-efficiency-for-latency-sensitive-datacenter-workloads [2019/09/28 17:04] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 6: | Line 6: | ||
| Amy described Shenago, an efficient algorithm for scheduling both latency sensitive (online) and batch-processing (offline) applications on the same host using an efficient CPU scheduling algoritmn using microsecond reprioritization. She outlined the goals of the projects, some of the challenges in the implementation and benchmark outcomes. | Amy described Shenago, an efficient algorithm for scheduling both latency sensitive (online) and batch-processing (offline) applications on the same host using an efficient CPU scheduling algoritmn using microsecond reprioritization. She outlined the goals of the projects, some of the challenges in the implementation and benchmark outcomes. | ||
| - | Site: https:// | + | Site: https:// |
0x13/reports/d2t2t05-shenango-achieving-high-cpu-efficiency-for-latency-sensitive-datacenter-workloads.1554900466.txt.gz · Last modified: 2019/09/28 17:04 (external edit)