Open access
Date
2011-11Type
- Report
ETH Bibliography
yes
Altmetrics
Abstract
The hardware trend toward higher core counts will likely result in a dynamic, bursty and interactive mix of parallel applications in personal and server computing. We investigate whether gang scheduling can provide performance benefits for applications in this scenario. We present a systematic study of the conditions under which gang scheduling might be better than classical general-purpose OS scheduling, and derive a set of necessary conditions on the workload. We find that these conditions are rarely met today, except in a small subset of workloads, for which we give an example. However, we propose that this subset is potentially important in the future, if (for example) parallel algorithms become increasingly used for real-time computer-human interaction. Show more
Permanent link
https://doi.org/10.3929/ethz-a-006742278Publication status
publishedJournal / series
Technical reportVolume
Publisher
Swiss Federal Institute of Technology Zurich, Department of Computer Science, Systems GroupOrganisational unit
03757 - Roscoe, Timothy / Roscoe, Timothy
02150 - Dep. Informatik / Dep. of Computer Science
More
Show all metadata
ETH Bibliography
yes
Altmetrics