uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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: Proc. 6th Swedish Workshop on Multi-Core Computing, Halmstad University Press, 2013Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Halmstad University Press, 2013.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-212780OAI: oai:DiVA.org:uu-212780DiVA, id: diva2:679219
Conference
MCC13, November 25–26, Halmstad, Sweden
Projects
Resource Sharing ModelingUPMARC
Funder
Swedish Research CouncilAvailable from: 2013-12-13 Created: 2013-12-13 Last updated: 2018-01-26Bibliographically approved
In thesis
1. Modeling the interactions between tasks and the memory system
Open this publication in new window or tab >>Modeling the interactions between tasks and the memory system
2017 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Making computer systems more energy efficient while obtaining the maximum performance possible is key for future developments in engineering, medicine, entertainment, etc. However it has become a difficult task due to the increasing complexity of hardware and software, and their interactions. For example, developers have to deal with deep, multi-level cache hierarchies on modern CPUs, and keep busy thousands of cores in GPUs, which makes the programming process more difficult.

To simplify this task, new abstractions and programming models are becoming popular. Their goal is to make applications more scalable and efficient, while still providing the flexibility and portability of old, widely adopted models. One example of this is task-based programming, where simple independent tasks (functions) are delegated to a runtime system which orchestrates their execution. This approach has been successful because the runtime can automatically distribute work across hardware cores and has the potential to minimize data movement and placement (e.g., being aware of the cache hierarchy).

To build better runtime systems, it is crucial to understand bottlenecks in the performance of current and future multicore systems. In this thesis, we provide fast, accurate and mathematically-sound models and techniques to understand the execution of task-based applications concerning three key aspects: memory behavior (data locality), scheduling, and performance. With these methods, we lay the groundwork for improving runtime system, providing insight into the interplay between the schedule's behavior, data reuse through the cache hierarchy, and the resulting performance.

Place, publisher, year, edition, pages
Uppsala University, 2017
Series
Information technology licentiate theses: Licentiate theses from the Department of Information Technology, ISSN 1404-5117 ; 2017-002
National Category
Computer Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:uu:diva-335530 (URN)
Supervisors
Projects
UPMARC
Available from: 2017-10-01 Created: 2017-12-06 Last updated: 2018-01-31Bibliographically approved

Open Access in DiVA

fulltext(336 kB)247 downloads
File information
File name FULLTEXT01.pdfFile size 336 kBChecksum SHA-512
d17db0b1d8c27f93971463e7e8ce3eebebd95c164ce5a406a158d41cedc0af945c8f2dfa577f30dfdbeae6edfe07a652b6b2556278e65850d208a033eb3610fa
Type fulltextMimetype application/pdf

Authority records BETA

Ceballos, GermánBlack-Schaffer, David

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar
Total: 247 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: 560 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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