Skip to main content

On the Parallelization of Sequential Programs

  • Conference paper
Supercomputing

Part of the book series: NATO ASI Series ((NATO ASI F,volume 62))

  • 70 Accesses

Abstract

Parallelization of sequential programs for MIMD computers is considered. In general, the major steps included in the parallelization process are: program partitioning into a task system, derivation of a parallel task system, scheduling and execution of this task system on a multiprocessor system. We present a general framework for an automatic maximally parallel task system generator which may be useful as a component of the code parallelization process. The framework is based on the concept of maximally parallel task systems, a concept which has been mainly used for designing operating systems.

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

Access this chapter

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. Callahan, C. D., Cooper, K. D., Hood, R. T., Kennedy, K., and Torczon, L.: PARASCOPE: A Parallel Programming Environment. The International Journal of Supercomputer Applications, Vol. 2, No. 4, 1988, pp. 84–99.

    Article  Google Scholar 

  2. Coffman, Jr., E. G., and Denning, P. J.: Operating Systems Theory. Prentice Hall, Englewood Cliffs, NJ, 1973.

    Google Scholar 

  3. Dongarra, J. and Sorenson, D.: SCHEDULE: Tools for Developing arid Analyzing Parallel Fortran Programs. ANL/MSC TM-86, Argonne National Laboratory, Math and Computer Science Division.

    Google Scholar 

  4. Kohler, W. H.: Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on a Multiprocessor System. IEEE Transaction on Computers, C. 24, 1975, pp. 1235–1238.

    Article  MATH  Google Scholar 

  5. Kowalik, J. S., Lord, R. E., and Kumar, S. P.: Design and Performance of Algorithms for MIMD Computers. High Speed Computation, Ed. J. S. Kowalik, Springer-Verlag, 1984.

    Google Scholar 

  6. Lord, R. E.: Scheduling Recurrence Equations for Solution on MIMD Type Computers. Ph.D. Dissertation, Washington State University, Pullman, WA, 1976.

    Google Scholar 

  7. Polychronopoulos, C. D.: Toward Auto-Scheduling Compilers. Journal of Supercomputing, No. 2, 1988, pp. 297–330.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kumar, S.P., Kowalik, J.S. (1990). On the Parallelization of Sequential Programs. In: Kowalik, J.S. (eds) Supercomputing. NATO ASI Series, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75771-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-75771-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-75773-0

  • Online ISBN: 978-3-642-75771-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics