Parallel/distributed application development is an extremely difficult task for non-expert programmers, and support tools are therefore needed for all phases of the development cycle of this kind of applications. In particular, dynamic performance tuning tools can take advantage of the knowledge about the application's structure given by a skeleton based programming tool. This study shows the definition of a strategy for dynamically improving the performance of pipeline applications. This strategy, which has been called Dynamic Pipeline Mapping, improves the application's throughput by gathering the pipe's fastest stages and replicating its slowest ones. We have evaluated the new algorithm by experimentation and simulation, and results show that DPM leads to significant performance improvements. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Moreno, A., César, E., Guevara, A., Sorribes, J., Margalef, T., & Luque, E. (2008). Dynamic Pipeline Mapping (DPM). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5168 LNCS, pp. 295–304). https://doi.org/10.1007/978-3-540-85451-7_32
Mendeley helps you to discover research relevant for your work.