Skip to main content

The performance of a parallel scheme using the divide-and-conquer method

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 796))

Included in the following conference series:

  • 160 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. Q. Yang and C. Yu, Parallelization by the Divide-And-Conquer Method, IEEE Systems, Man and Cybernetics Conference, Chicago, 1992, pp. 1265–1270.

    Google Scholar 

  2. Q. Yang, C. Liu, C. Yu, G. Wang and T. Pham, A Hybrid Transitive Closure Algorithm for Sequential and Parallel Processing, IEEE International Conference on Data Engineering, 1994, pp. 498–505.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Gentzsch Uwe Harms

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, Q., Yu, C., Liu, C. (1994). The performance of a parallel scheme using the divide-and-conquer method. In: Gentzsch, W., Harms, U. (eds) High-Performance Computing and Networking. HPCN-Europe 1994. Lecture Notes in Computer Science, vol 796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020416

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57980-9

  • Online ISBN: 978-3-540-48406-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics