Skip to main content
SpringerLink
Log in

Research on the optimal parallel algorithms of broadcast-class problems

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Speedup is considered as the criterion of determining whether a parallel algorithm is optimal. But broadcast-class problems, existing only on parallel computer system, have no sequential algorithms at all. Speedup standard becomes invalid here. Through this research on broadcast algorithms under several typical parallel computation models, a model-independent evaluation standard minC 2 is developed, which can be not only used to determine an optimal broadcasting algorithm, but also normalized to apply to any parallel algorithm. As a new idea, minC 2 will lead to a new way in this field.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gibbons P B. A more practical PRAM model. InProc. ACM Symposium on Parallel Algorithms and Architectures, ACM, 1989, pp. 158–168.

  2. Valiant L G. A bridging model for parallel computation.Communications of the ACM, August 1990, 33(8): 103–111.

    Article  Google Scholar 

  3. Culler D E, Karp R M, Patterson D Aet al. Log P: Towards a realistic model of parallel computation. InProc. 4th ACM PPOPP, May 1993.

  4. Karp R M, Sahay A, Santos Eet al. Optimal broadcast and summation in theLog P model. Tech. Rep. UCB/CSD 92/721, UC Berkeley, 1992.

  5. Sahay A. Hiding communication costs in bandwidth-limited parallel FFT computation. Tech. Rep. UCB/CSD 92/722, UC Berkeley, 1992.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Science and Technology of China, 230027, Hefei, P.R. China

    Li Xiaofeng, Shou Biao & Zheng Shirong

Authors
  1. Li Xiaofeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shou Biao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zheng Shirong
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is supported by the National Natural Science Foundation and National “863” Hi-Tech Program of China.

Li Xiaofeng (xlee@acm.org) is now a Ph.D. candidate of computer science in University of Science and Technology of China. His research interests are concentrated on parallel processing and network technology, especially on fast communication technology in Network of Workstations (NOW).

Shou Biao (shou@cs.orst.edu) is now a Ph.D. candidate of computer science in Oregon State University (ORST). His research interests are parallel computing and algorithms.

Zheng Shirong (srzheng@cs.ustc.edu.cn) is a Professor in Department of Computer Science of University of Science and Technology of China. His research interests are parallel processing and architecture.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, X., Shou, B. & Zheng, S. Research on the optimal parallel algorithms of broadcast-class problems. J. of Comput. Sci. & Technol. 13, 455–463 (1998). https://doi.org/10.1007/BF02948504

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948504

Keywords

Search

Navigation