Name
Abstract | ||
|---|---|---|
•A task-level scheduling method for application performance guarantee in data center is proposed.•The method relies on priori information on task and application requirement.•Task requirement should be strictly satisfied for integrity and performance. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.compeleceng.2016.07.013 | Computers & Electrical Engineering |
Keywords | Field | DocType |
Data center networks,Task scheduling,Application performance,Maximize profit | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling | Journal |
Volume | Issue | ISSN |
61 | C | 0045-7906 |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
5 | ||