Skip to content

Research at St Andrews

Using Load Information in Work-Stealing on Distributed Systems with Non-Uniform Communication Latencies

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We evaluate four state-of-the-art work-stealing algorithms for distributed
systems with non-uniform communication latenices
(Random Stealing, Hierarchical Stealing, Cluster-aware
Random Stealing and Adaptive Cluster-aware Random Stealing)
on a set of irregular Divide-and-Conquer (D\&C) parallel applications. We also
investigate the extent to which these algorithms could be
improved if dynamic load information is
available, and how accurate this information needs to be. We show that, for highly-irregular D\&C
applications, the use of load information can significantly improve
application speedups, whereas there is little improvement for less irregular ones. Furthermore, we show that when load
information is used, Cluster-aware Random Stealing gives
the best speedups for both regular and irregular D\&C applications.
Close

Details

Original languageEnglish
Title of host publicationProc. EuroPar 2012: 2012 International European Conference on Parallel and Distributed Computing
PublisherSpringer
Number of pages12
DOIs
Publication statusPublished - 2012

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Learning-based dynamic pinning of parallelized applications in many-core systems

    Chasparis, G., Rossbory, M., Janjic, V. & Hammond, K., 21 Mar 2019, Proceedings 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2019). Institute of Electrical and Electronics Engineers Inc., 8 p. 8671569

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  2. The Missing Link! A new skeleton for evolutionary multi-agent systems in Erlang

    Stypka, J., Turek, W., Byrski, A., Kisiel-Dorohinicki, M., Barwell, A. D., Brown, C. M., Hammond, K. & Janjic, V., Feb 2018, In : International Journal of Parallel Programming. 46, 1, p. 4-22 19 p.

    Research output: Contribution to journalArticle

  3. Efficient dynamic pinning of parallelized applications by reinforcement learning with applications

    Chasparis, G., Rossbory, M. & Janjic, V., 1 Aug 2017, Euro-Par 2017: Parallel Processing: 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28 – September 1, 2017, Proceedings. Rivera, F. F., Pena, T. F. & Cabaleiro, J. C. (eds.). Cham: Springer, p. 164-176 13 p. (Lecture Notes in Computer Science (Theoretical Computer Science and General Issues); vol. 10417).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. HPC-GAP: engineering a 21st-century High-Performance Computer algebra system

    Behrends, R., Hammond, K., Janjic, V., Konovalov, A., Linton, S. A., Loidl, H-W., Maier, P. & Trinder, P., 10 Sep 2016, In : Concurrency and Computation : Practice and Experience. 28, 13, p. 3606-3636 33 p.

    Research output: Contribution to journalArticle

ID: 23410263