Change search
ReferencesLink to record
Permanent link

Direct link
NUMA-aware scheduling for both memory- and compute-bound tasks
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2015 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

There has been much work in NUMA-aware (Non-Uniform Memory Access) scheduling the past decade, all authors presenting different schedulers and considers the major problems with today schedulers, which are mostly aimed at UMA (Unified Memory Access) machines or not optimized for NUMA machines.

This paper is aimed at summarizing the available literature about NUMA-aware scheduling and extract guidelines for how to schedule compute- and memory-bound tasks in a NUMA-aware fashion. This can be done by using different techniques to distribute the data among the available nodes and by fully utilizing all of the memory controllers sockets.

From the discussion and theory, it is possible to form eight guidelines that can be used to write a NUMA-aware scheduler, formed from the main ideas of the available literature.

Place, publisher, year, edition, pages
2015. , 16 p.
, UMNAD, 1031
National Category
Engineering and Technology
URN: urn:nbn:se:umu:diva-108380OAI: diva2:852741
Educational program
Bachelor of Science Programme in Computing Science
Available from: 2015-09-10 Created: 2015-09-10 Last updated: 2015-09-10Bibliographically approved

Open Access in DiVA

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

By organisation
Department of Computing Science
Engineering and Technology

Search outside of DiVA

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

Total: 94 hits
ReferencesLink to record
Permanent link

Direct link