Load balancing in homogeneous pipeline based applications

We propose to use knowledge about a parallel application’s structure that was acquired with the use of a skeleton based development strategy to dynamically improve its performance. Parallel/distributed programming provides the possibility of solving highly demanding computational problems. However,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel computing Jg. 38; H. 3; S. 125 - 139
Hauptverfasser: Moreno, A., Cesar, E., Guevara, A., Sorribes, J., Margalef, T.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.03.2012
Schlagworte:
Algorithms
Computation
Load balancing
Mapping
Optimization
Performance enhancement
Phases
Pipeline
Pipelines
Strategy
Load balancing
Performance
Pipeline
ISSN:0167-8191, 1872-7336
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose to use knowledge about a parallel application’s structure that was acquired with the use of a skeleton based development strategy to dynamically improve its performance. Parallel/distributed programming provides the possibility of solving highly demanding computational problems. However, this type of application requires support tools in all phases of the development cycle because the implementation is extremely difficult, especially for non-expert programmers. This work shows a new strategy for dynamically improving the performance of pipeline applications. We call this approach Dynamic Pipeline Mapping (DPM), and the key idea is to have free computational resources by gathering the pipeline’s fastest stages and then using these resources to replicate the slowest stages. We present two versions of this strategy, both with complexity O( N log ( N)) on the number of pipe stages, and we compare them to an optimal mapping algorithm and to the Binary Search Closest (BSC) algorithm [1]. Our results show that the DPM leads to significant performance improvements, increasing the application throughput up to 40% on average.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0167-8191
1872-7336
DOI:10.1016/j.parco.2011.11.001