Skip to main content
Springer Nature Link
Log in

An Asynchronous Algorithm to Reduce the Number of Data Exchanges

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11945))

  • 1950 Accesses

Abstract

Communication or data movement cost is significantly higher than computation cost in existing large-scale clusters, for clusters having long network latency. For high-frequency parallel iterative applications, performance bottleneck is the long network latency caused by frequent data exchange. This paper presents an asynchronous algorithm capable of reducing the number of data exchanges among processes of parallel iterative applications. The proposed algorithm has been tested on a stencil-based parallel computation and compared with a BSP implementation of the same application. The asynchronous algorithm can effectively reduce the number of data exchanges at the expense of higher computation overhead and larger message size, performance can be improved up to 2.8x.

Supported by National Key R&D Program of China (2017YFB0202001), and National Natural Science Foundation of China (61432018, 61672208).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Chen, Y., Huang, K., Wang, B., Li, G., Cui, X.: Samsara parallel: a non-BSP parallel-in-time model. In: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Barcelona (2016)

    Google Scholar 

  2. Ao, Y., et al.: 26 PFLOPS stencil computations for atmospheric modeling on sunway TaihuLight. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS 2017). IEEE (2017)

    Google Scholar 

  3. Shield, C.K., French, C.W., Timm, J.: Development and implementation of the effective force testing method for seismic simulation of large-scale structures. Philos. Trans. Roy. Soc. London A: Math. Phys. Eng. Sci. 359(1786), 1911–1929 (2001)

    Article  Google Scholar 

  4. Dennis, J.M., Edwards, J., Evans, K.J., et al.: CAM-SE: a scalable spectral element dynamical core for the community atmosphere model. Int. J. High Perform. Comput. Appl. 26(1), 74–89 (2012)

    Article  Google Scholar 

  5. Dou, H.-S., Tsai, H.M., Khoo, B.C., Qiu, J.: Simulations of detonation wave propagation in rectangular ducts using a three-dimensional WENO scheme. Combust. Flame 154(4), 644–659 (2008)

    Article  Google Scholar 

  6. Baffico, L., Bernard, S., Maday, Y., Turinici, G., Zerah, G.: Parallel-in-time molecular-dynamics simulations. Phys. Rev. E 66, 5 (2002)

    Article  Google Scholar 

  7. Bahi, J.M., Contassot-Vivier, S., Couturier, R.: Evaluation of the asynchronous iterative algorithms in the context of distant heterogeneous clusters. Parallel Comput. 31(5), 439–461 (2005)

    Article  MathSciNet  Google Scholar 

  8. Blathras, K., Szyld, D.B., Shi, Y.: Timing models and local stopping criteria for asynchronous iterative algorithms. J. Parallel Distrib. Comput. 58(3), 446–465 (1999)

    Article  Google Scholar 

  9. Lions, J.-L., Manday, Y., Turinici, G.: Resolution EDP par un schema en temps parareal. C. R. Acad. Sci. Numer. Anal. 332(7), 661–668 (2001)

    MATH  Google Scholar 

  10. Yu, Y.: Parallel implementation and performance optimization for refactoring GROMACS on the sunway many-core architecture. University of Science and Technology of China (2018)

    Google Scholar 

  11. Valiant, L.G.: A bridging model for parallel computation. SIAM J. Sci. Stat. Comput. 33, 103–111 (1990)

    Google Scholar 

  12. The Riken Himeno CFD Benchmark. http://accc.riken.jp/HPC/HimenoBMT/index e.html

  13. Phillips, E.H., Fatica, M.: Implementing the Himeno benchmark with CUDA on GPU clusters. In: IEEE International Symposium on Parallel and Distributed Processing IEEE (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HCST Key Lab, EECS, Peking University, Beijing, 100871, China

    Zhuo Tian, Yifeng Chen & Lei Zhang

Authors
  1. Zhuo Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yifeng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhuo Tian .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Software Engineering, Swinburne University of Technology, Hawthorn, Melbourne, VIC, Australia

    Sheng Wen

  2. School of Computer Science, The University of Sydney, Camperdown, NSW, Australia

    Albert Zomaya

  3. Department of Computer Science, St. Francis Xavier University, Antigonish, NS, Canada

    Laurence T. Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tian, Z., Chen, Y., Zhang, L. (2020). An Asynchronous Algorithm to Reduce the Number of Data Exchanges. In: Wen, S., Zomaya, A., Yang, L.T. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2019. Lecture Notes in Computer Science(), vol 11945. Springer, Cham. https://doi.org/10.1007/978-3-030-38961-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38961-1_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38960-4

  • Online ISBN: 978-3-030-38961-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics