Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Terrible Twins: A Simple Scheme to Avoid Bad Co-Schedule
University West, Department of Engineering Science, Division of Computer, Electrical and Surveying Engineering.ORCID iD: 0000-0001-7232-0079
University West, Department of Engineering Science, Division of Computer, Electrical and Surveying Engineering.ORCID iD: 0000-0003-0589-8086
2016 (English)In: Proceedings of the 1st COSH Workshop on Co-Scheduling of HPC Applications / [ed] Trinitis, Carsten ; Weidendorfer, Josef, Munchen, 2016, Vol. 1, 1-6 p.Conference paper, Published paper (Refereed)
Abstract [en]

Co-scheduling processes on different cores in the same server might lead to excessive slowdowns if they use a shared resource,like the memory bus. If possible, processes with a high shared resource use should be allocated to different server nodes to avoid contention, thus avoiding slowdown.This paper introduces the simple scheme of avoiding to coschedule twins, i.e., several instances of the same program.The rational for this is that instances of the same program use the same resources and they are more likely to be either low or high resource users − high resource users should obviously not be combined, but a bit non-intuitively, it is also shown that low resource users should also not be combined in order to not miss out on better scheduling opportunities.This is verified using both a statistical argument as well as experimentally using ten programs from the NAS parallel benchmark suite. By using the simple rule of forbidding twins, the average slowdown is shown to decrease from 6.6% down to 5.9%, and the worst case slowdown is lowered from 12.7% to 9.0%, indicating a considerable improvement despite having no information about any programs' resource usage or slowdown behavior.

Place, publisher, year, edition, pages
Munchen, 2016. Vol. 1, 1-6 p.
Keyword [en]
Co-scheduling; Scheduling; Allocation; Multicore; Slowdown; Cluster; Cloud
National Category
Computer Engineering
Research subject
ENGINEERING, Computer engineering
Identifiers
URN: urn:nbn:se:hv:diva-9072DOI: 10.14459/2016md1286952OAI: oai:DiVA.org:hv-9072DiVA: diva2:903044
Conference
COSH Workshop on Co-Scheduling of HPC Applications HIPEAC 2016
Available from: 2016-02-12 Created: 2016-02-12 Last updated: 2016-03-08Bibliographically approved

Open Access in DiVA

fulltext(319 kB)53 downloads
File information
File name FULLTEXT01.pdfFile size 319 kBChecksum SHA-512
7eeb0521d32c668d001886c3ad55e55fbb15de73f02f9c534e3595e275a7489cb7907c6e52601f2cc8ec606810ee3b236e21031619ec2a67ceb959a4c3672c9f
Type fulltextMimetype application/pdf

Other links

Publisher's full texthttps://mediatum.ub.tum.de/?id=1286952

Search in DiVA

By author/editor
De Blanche, AndreasLundqvist, Thomas
By organisation
Division of Computer, Electrical and Surveying Engineering
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 53 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 186 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf