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
Characterizing Task Scheduling Performance Based on Data Reuse
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication. (Uppsala Architecture Research Team (UART))ORCID iD: 0000-0003-2314-7307
Barcelona Supercomputing Center, Spain.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication. (Uppsala Architecture Research Team (UART))
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication. (Uppsala Architecture Research Team (UART))
2016 (English)In: Proc. 9th Nordic Workshop on Multi-Core Computing, 2016Conference paper, Published paper (Refereed)
Abstract [en]

Through the past years, several scheduling heuristics were introduced to improve the performance of task-based ap-plications, with schedulers increasingly becoming aware of memory-related bottlenecks such as data locality and cachesharing. However, there are not many useful tools that pro-vide insights to developers about why and where dierentschedulers do better scheduling, and how this is related tothe applications' performance. In this work we present atechnique to characterize dierent task schedulers based onthe analysis of data reuse, providing high-level, quantitativeinformation that can be directly correlated with tasks per-formance variation. This exible insight is key for optimiza-tion in many contexts, including data locality, throughput, memory footprint or even energy eciency.

Place, publisher, year, edition, pages
2016.
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-310338OAI: oai:DiVA.org:uu-310338DiVA, id: diva2:1056162
Conference
MCC16, November 29–30, Trondheim, Norway
Projects
Resource Sharing ModelingUPMARC
Funder
Swedish Foundation for Strategic Research , FFL12-0051Available from: 2016-12-14 Created: 2016-12-14 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(1102 kB)181 downloads
File information
File name FULLTEXT01.pdfFile size 1102 kBChecksum SHA-512
48d6c2c073ca0d010aa15dad83b67609b4ab65af803d92bd12fe4093410ed6228be0df0092fca961f386fae65e3043e4d2ca0572e5c877e1b7afe27d86d3bc1a
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Ceballos, GermánBlack-Schaffer, DavidHugo, Andra
By organisation
Computer Architecture and Computer Communication
Computer Sciences

Search outside of DiVA

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