Show simple item record

dc.contributor.author
Peter, Simon
dc.contributor.author
Baumann, Andrew
dc.contributor.author
Anderson Zachary R.
dc.contributor.author
Roscoe, Timothy
dc.date.accessioned
2017-07-06T13:59:39Z
dc.date.available
2017-06-09T17:44:24Z
dc.date.available
2017-07-06T13:59:39Z
dc.date.issued
2011-11
dc.identifier.uri
http://hdl.handle.net/20.500.11850/42296
dc.identifier.doi
10.3929/ethz-a-006742278
dc.description.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.
en_US
dc.format
application/pdf
dc.language.iso
en
en_US
dc.publisher
Swiss Federal Institute of Technology Zurich, Department of Computer Science, Systems Group
en_US
dc.rights.uri
http://rightsstatements.org/page/InC-NC/1.0/
dc.title
Gang scheduling istn't worth it ... yet
en_US
dc.type
Report
dc.rights.license
In Copyright - Non-Commercial Use Permitted
ethz.journal.title
Technical report
ethz.journal.volume
745
en_US
ethz.size
6 p.
en_US
ethz.code.ddc
DDC - DDC::0 - Computer science, information & general works::004 - Data processing, computer science
en_US
ethz.identifier.nebis
006742278
ethz.publication.place
Zurich
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02663 - Institut für Computing Platforms / Institute for Computing Platforms::03757 - Roscoe, Timothy / Roscoe, Timothy
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02663 - Institut für Computing Platforms / Institute for Computing Platforms::03757 - Roscoe, Timothy / Roscoe, Timothy
ethz.date.deposited
2017-06-09T17:44:53Z
ethz.source
ECOL
ethz.source
ECIT
ethz.identifier.importid
imp59364eb79c2e259807
ethz.identifier.importid
imp59366b148470634157
ethz.ecolpid
eth:4766
ethz.ecitpid
pub:70467
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2017-07-06T14:00:01Z
ethz.rosetta.lastUpdated
2020-02-15T06:13:14Z
ethz.rosetta.exportRequired
true
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Gang%20scheduling%20istn't%20worth%20it%20...%20yet&rft.jtitle=Technical%20report&rft.date=2011-11&rft.volume=745&rft.au=Peter,%20Simon&Baumann,%20Andrew&Anderson%20Zachary%20R.&Roscoe,%20Timothy&rft.genre=report&
 Search print copy at ETH Library

Files in this item

Thumbnail

Publication type

Show simple item record