usenix conference policies
Efficiently Scheduling X Clients
Abstract:
The X server is charged with providing window system services to many applications simultaneously, and needs a scheduling mechanism to distribute it's limited resources among these applications. The original scheduling mechanism was simplistic and caused graphics-intensive applications to starve interactive applications.
A new scheduling mechanism has been designed which fairly distributes time among the requesting applications while at the same time increasing performance by a small amount. Descriptions of the original and new scheduling mechanism and empirical measurements demonstrating the effects of scheduling within the X server are included along with a discussion on how the design was arrived at.
BibTeX
@inproceedings {271361,
author = {Keith Packard},
title = {Efficiently Scheduling X Clients},
booktitle = {2000 USENIX Annual Technical Conference (USENIX ATC 00)},
year = {2000},
address = {San Diego, CA},
url = {https://www.usenix.org/conference/2000-usenix-annual-technical-conference/efficiently-scheduling-x-clients},
publisher = {USENIX Association},
month = jun
}
author = {Keith Packard},
title = {Efficiently Scheduling X Clients},
booktitle = {2000 USENIX Annual Technical Conference (USENIX ATC 00)},
year = {2000},
address = {San Diego, CA},
url = {https://www.usenix.org/conference/2000-usenix-annual-technical-conference/efficiently-scheduling-x-clients},
publisher = {USENIX Association},
month = jun
}
connect with us