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
Shared Resource Sensitivity in Task-Based Runtime Systems
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Uppsala Architecture Research Team (UART))ORCID iD: 0000-0003-2314-7307
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Uppsala Architecture Research Team (UART))
2013 (English)In: Proceedings of the 6th Swedish Workshop on Multi-Core Computing, Halmstad, Sweden: Halmstad University , 2013Conference paper, Published paper (Refereed)
Abstract [en]

Task-based programming methodologies have become a popular alternative to explicit threading because they leave most of the complexity of scheduling and load balancing to the runtime system. Modern task schedulers use task execution information to build models which they can then use to predict future task performance and produce better schedules. However, while shared resource sensitivity, such as the use of shared cache, is widely known to hurt performance, current schedulers do not address this in their scheduling.This work applies low-overhead techniques for measuring resource sensitivity to task-based runtime systems to profile individual task behavior.We present results for several benchmarks, both in an isolated environment (all resources available) and in normal contention scenarios, and establish a direct quantitative cor-relation between individual tasks and the entire application sensitivity.We present insight into areas where these profiling techniques could enable significant gains in performance due to better scheduling, and conclude what scenarios are necessary for such improvements.

Place, publisher, year, edition, pages
Halmstad, Sweden: Halmstad University , 2013.
Keyword [en]
Resource Sharing, Tasks, Performance
National Category
Computer Systems
Research subject
Computer Science; Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-212780OAI: oai:DiVA.org:uu-212780DiVA: diva2:679219
Conference
MCC13; Sixth Swedish Workshop on Multicore Computing; 25-26 November 2013; Halmstad, Sweden
Projects
Resource Sharing ModelingUPMARC
Funder
Swedish Research Council
Available from: 2013-12-13 Created: 2013-12-13 Last updated: 2013-12-18Bibliographically approved

Open Access in DiVA

mcc13-gec-dbs(340 kB)223 downloads
File information
File name FULLTEXT01.pdfFile size 340 kBChecksum SHA-512
e10032c3e257659719b9b090cbad7cc63d5574027ff6bee770aab7c41332a160bba50a954726602735560db2de0d68ae1fa70ec4a5d21b46fc7c296b5366c89a
Type fulltextMimetype application/pdf

Other links

Workshop website

Search in DiVA

By author/editor
Ceballos, GermánBlack-Schaffer, David
By organisation
Computer Systems
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 223 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

urn-nbn

Altmetric score

urn-nbn
Total: 528 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