Self-organizing Core Allocation
| dc.contributor.author | Ziermann, Tobias | |
| dc.contributor.author | Wildermann, Stefan | |
| dc.contributor.author | Teich, Jürgen | |
| dc.date.accessioned | 2017-06-29T21:44:20Z | |
| dc.date.available | 2017-06-29T21:44:20Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | This paper deals with the problem of dynamic allocation of cores to par- allel applications on homogeneous many-core systems such asfor exampleMulti- Processor System-on-Chips (MPSoCs). For a given number of thread-parallel applicationscthe goal is to find a core assignment that maximizes the average speedup. However, the difficulty is that some applications may have a higher speedup variation than others when assigned additional cores. This paper first presents a centralized algorithm to calculate an optimal assignment for the above objective. Howeveras the number of cores and the dynamics of applications will significantly increase in the future, decentralized concepts are necessary to scale with this development. Therefore, a decentralized (self-organizing) algorithm is developed in order to minimize the amount of global information that has to be exchanged between applications. The experimental results show that this approach can reach the optimal result of the centralized version in average by 98.95%. | en |
| dc.identifier.pissn | 0177-0454 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V., Fachgruppe PARS | |
| dc.relation.ispartof | PARS-Mitteilungen: Vol. 30, Nr. 1 | |
| dc.title | Self-organizing Core Allocation | en |
| dc.type | Text/Journal Article | |
| gi.citation.publisherPlace | Berlin |
Dateien
Originalbündel
1 - 1 von 1