Skip to main content
Log in

Optimal Period of Workload Redistribution for Dynamic Bulk Synchronous Computations in Heterogeneous Computing Systems

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In dynamic bulk synchronous computations, processors may change their workloads from phase to phase. Such workload change will possibly increase the duration of a phase and the overall parallel execution time. Therefore, it is necessary to redistribute workload at runtime to reduce the parallel time. However, such workload redistribution at runtime can be expensive and the overhead of frequent runtime workload redistribution may exceed the benefit of workload redistribution and balancing. The problem of finding the optimal period of runtime workload redistribution for dynamic bulk synchronous computations is motivated by the combined consideration of parallel execution time and system overhead for workload redistribution and balancing. We develop an analytical method to solve the problem in heterogeneous computing systems. We also demonstrate numerical data of the analytical method and simulation results that verify the analytical data.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. V. D. Agrawal and S. T. Chakradhar. Performance analysis of synchronized iterative algorithms on multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems, 3(6):739–746, 1992.

    Article  Google Scholar 

  2. A. H.-S. Ang and W. H. Tang. Probability Concepts in Engineering Planning and Design, Volume II - Decision, Risk, and Reliability. John Wiley & Sons, New York, 1984.

    Google Scholar 

  3. B. C. Arnold, N. Balakrishnan, and H. N. Nagaraja. A First Course in Order Statistics. John Wiley & Sons, New York, 1992.

    Google Scholar 

  4. R. C. Bose and S. S. Gupta. Moments of order statistics from a normal population. Biometrika, 46:433–440, 1959.

    MathSciNet  Google Scholar 

  5. N.-T. Fong, C.-Z. Xu, and L. Y. Wang. Periodic remapping of non-deterministic bulk synchronous computations. In Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems, pp. 788–793, November 1999.

  6. N.-T. Fong, C.-Z. Xu, and L. Y. Wang. Optimal periodic remapping of bulk synchronous computations on multiprogrammed distributed systems. In Proceedings of the 14th International Parallel and Distributed Processing Symposium, pp. 103–108, May 2000.

  7. D. C. Marinescu and J. R. Rice. Synchronization and load imbalance effects in distributed memory multi-processor systems. Concurrency: Practice and Experience, 3(6):593–625, 1991.

    Google Scholar 

  8. S. Madala and J. B. Sinclair. Performance of synchronous parallel algorithms with regular structures. IEEE Transactions on Parallel and Distributed Systems, 2(1):105–116, 1991.

    Article  Google Scholar 

  9. G. D. Peterson and R. D. Chamberlain. Beyond execution time: Expanding the use of performance models. IEEE Parallel and Distributed Technology, 2(2):37–49, 1994.

    Google Scholar 

  10. S. Ross. A First Course in Probability, 4th edition, Macmillan College Publishing Company, New York, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Keqin Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, K. Optimal Period of Workload Redistribution for Dynamic Bulk Synchronous Computations in Heterogeneous Computing Systems. J Supercomput 35, 205–226 (2006). https://doi.org/10.1007/s11227-006-4666-9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-006-4666-9

Keywords

Navigation