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
Automatic Adaptation of Resources to Workload requirements in Nested Fork-join Programming Model
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS. (Multicore center)ORCID iD: 0000-0002-7860-6593
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.ORCID iD: 0000-0002-9637-2065
2012 (English)Report (Other academic)
Abstract [en]

We provide a work-stealing scheduling method for nested fork/join parallelism that is mathematically proven to self- adapt multiprogrammed applications resource allocation to the current workloads’ individual needs while it takes avail- able resources into account. The scheduling method both scales up the allocated resources when needed and down, when possible.The theoretical model has been implemented in the Bar- relfish distributed multikernel operating system and demon- strated to function on a simulated x86 64 multicore plat- form.The work presented here is the first step towards a com- plete framework for the system-wide scheduling and load balancing of multiprogrammed many-core systems, assum- ing a variety of workload types and guaranteeing at least av- erage execution for each running program.

Place, publisher, year, edition, pages
KTH Royal Institute of Technology, 2012. , 12 p.
Series
TRITA-ICT/ECS R, ISSN 1653-7238 ; 12:04
Keyword [en]
Scheduling, parallel programming, multicore, manycore
National Category
Software Engineering
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-107668ISRN: KTH/ICT/ECS/R-12-04-SEOAI: oai:DiVA.org:kth-107668DiVA: diva2:577048
Funder
Swedish e‐Science Research Center
Note

QC 20130109

Available from: 2013-01-09 Created: 2012-12-14 Last updated: 2013-09-10Bibliographically approved
In thesis
1. Cooperative user- and system-level scheduling of task-centric parallel programs
Open this publication in new window or tab >>Cooperative user- and system-level scheduling of task-centric parallel programs
2013 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Emerging architecture designs include tens of processing cores on a single chip die; it is believed that the number of cores will reach the hundreds in not so many years from now. However, most common workloads cannot expose fluctuating parallelism, insufficient to utilize such systems. The combination of these issues suggests that large-scale systems will be either multiprogrammed or have their unneeded resources powered off. To achieve these features, workloads must be able to provide a metric on their parallelism which the system can use to dynamically adapt per-application resource allotments.Adaptive resource management requires scheduling abstractions to be split into two cooperating layers. The system layer that is aware of the availability of resources and the application layer which can accurately and iteratively estimate the workload's true resource requirements.This thesis addresses these issues and provides a self-adapting work-stealing scheduling method that can achieve expected performance while conserving resources. This method is based on deterministic victim selection (DVS) that controls the concentration of the load among the worker threads. It allows to use the number of spawned but not yet processed tasks as a metric for the requirements. Because this metric measures work to be executed in the future instead of past behavior, DVS is versatile to handlevery irregular workloads.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2013. vi, 29 p.
Series
Trita-ICT-ECS AVH, ISSN 1653-6363 ; 13:15
Keyword
parallel, workload, runtime, task, adaptive, resource management, load balancing, work-stealing
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
SRA - ICT
Identifiers
urn:nbn:se:kth:diva-127708 (URN)978-91-7501-816-4 (ISBN)
Presentation
2013-09-27, Sal/Hall D, Forum, KTH-ICT, Isafjordsgatan 39, Kista, 12:10 (English)
Opponent
Supervisors
Note

QC 20130910

Available from: 2013-09-10 Created: 2013-09-04 Last updated: 2013-09-17Bibliographically approved

Open Access in DiVA

fulltext(315 kB)352 downloads
File information
File name FULLTEXT01.pdfFile size 315 kBChecksum SHA-512
2bbfcc42f3a4760e4fa471ca0c07d10502ebf41143702c35e0f7206bf8f6d860e0c85787ff4025dcfb0fd75aa6cf547a8e3a3bb4030f85dee2e87c5f7b82048d
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Varisteas, GeorgiosBrorsson, Mats
By organisation
Software and Computer systems, SCS
Software Engineering

Search outside of DiVA

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