Skip to main content
SpringerLink
Log in

An O[n 3/z 3] Reduction Procedure for Determining the Maximum Degree of Parallelism in Parallel Applications

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 2001)

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

Included in the following conference series:

  • 328 Accesses

Abstract

In the present work, fine-grain parallel applications of a wide class to be executed on distributed-memory multiprocessors are investigated. The problem of determining the maximum degree of parallelism in the control flow of such applications is under consideration. An efficient procedure (called R-procedure) for solving the indicated problem is introduced and stated. The procedure operates on a control flow graph of an application, and it provides fast calculation of the parallelism degree through the technique of reduction of the control flow graph. The R-procedure is shown to have the time complexity of at most O[n 3/z 3], with n and z standing for the number of processes in the application and parallelism degree, respectively.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Paragon XP/S Product Overview, Beaverton, Ore.: Supercomputer Systems Division, Intel Corp. (1991)

    Google Scholar 

  2. Duato, J., Yalamanchili, S., Ni, L.M.: Interconnection Networks: An Engineering Approach. Los Alamitos, Calif. IEEE CS Press (1997)

    Google Scholar 

  3. Chu, W.W., Lan, L.M-T.: Task Allocation and Precedence Relations for Distributed Real-Time Systems. IEEE Trans. Comput., Vol. C-36. 6 (1987) 667–679

    Article  Google Scholar 

  4. Chu, W.W., et al.: Task Allocation in Distributed Data Processing. IEEE Computer. 11 (1980) 57–69

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Kursk State Technical University, 94, 50 let Oktyabrya, 305040, Kursk, Russian Federation

    Igor V. Zotov & Vitaliy S. Titov

Authors
  1. Igor V. Zotov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vitaliy S. Titov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Supercomputer Software Department, ICMand MG SB RAS, pr. Lavrentiev 6, 630090, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zotov, I.V., Titov, V.S. (2001). An O[n 3/z 3] Reduction Procedure for Determining the Maximum Degree of Parallelism in Parallel Applications. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44743-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation