Exploring the throughput-fairness tradeoff of deadline scheduling in heterogeneous computing environments | Zendy

Vasumathi Sundaram | Zendy; Abhishek Chandra | Zendy; Jon Weissman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Exploring the throughput-fairness tradeoff of deadline scheduling in heterogeneous computing environments

Author(s) -

Vasumathi Sundaram,

Abhishek Chandra,

Jon Weissman

Publication year - 2008

Publication title -

acm sigmetrics performance evaluation review

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.223

H-Index - 80

eISSN - 1557-9484

pISSN - 0163-5999

DOI - 10.1145/1384529.1375522

Subject(s) - computer science , distributed computing , scheduling (production processes) , scalability , exploit , earliest deadline first scheduling , dynamic priority scheduling , fair share scheduling , round robin scheduling , rate monotonic scheduling , two level scheduling , fairness measure , fixed priority pre emptive scheduling , maximum throughput scheduling , throughput , computer network , mathematical optimization , quality of service , operating system , mathematics , computer security , wireless

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research