Skip to main content

Methods for Exploitation of Fine-Grained Parallelism

  • Chapter
Parallel Computer Architectures

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

  • 362 Accesses

Abstract

Fine-grained parallelism is offered by an increasing number of processors. This kind of parallelism increases performance for all kinds of applications, including general-purpose code; most promising is the combination with coarse-grained parallelism. Unlike coarse-grained parallelism it can be exploited by automatic parallelization. This paper presents program analysis and transformation methods for exploitation of fine-grained parallelism, based on global instruction scheduling.

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 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. A. Aiken: Compaction-Based Parallelization PhD Diss., Techn. Report No. TR88–922, Cornell University, Ithaca, NY, June 1988

    Google Scholar 

  2. K. Ebcioglu, A. Nicolau: A Global Resource-constrained Parallelization Technique Proc. 3rd Int. Conf. on Supercomputing, Crete, June 1989, pp. 154–163

    Google Scholar 

  3. J. R. Ellis: Bulldog: A Compiler for VLIW Architectures MIT Press, 1985

    Google Scholar 

  4. J. A. Fisher: Trace Scheduling: A Technique for Global Microcode Compaction IEEE Transaction on Computers, July 1981, pp. 478–490

    Google Scholar 

  5. R. Gupta: A Reconfigurable LIW Architecture and its Compiler PhD Dissertation, University of Pittsburgh, 1987, Order No. 8807357

    Google Scholar 

  6. N. P. Jouppi: The Nonuniform Distribution of Instruction-Level and Machine Parallelism and Its Effect on Performance IEEE Trans. on Comp. Vol. 38, No. 12, Dec. 1989

    Google Scholar 

  7. J. Lah, D. E. Atkins: Tree Compaction of Microprograms ACM SIGMICRO 16th Annual Workshop, pp. 23–33, Oct. 1983

    Google Scholar 

  8. J. L. Linn: SRDAG Compaction–A Generalization of Trace Scheduling to Increase the Use of Global Context Information ACM SIGMICRO 16th Annual Workshop, pp. 11–22, Oct. 1983

    Google Scholar 

  9. A. Nicolau: Percolation Scheduling: A Parallel Compilation Technique Technical Report TR 85–678, Cornell University, Ithaca, NY, May 1985

    Google Scholar 

  10. C. Störmann, G. Piepenbrock: Erzeugung parallelen Codes für VLIW-Architekturen durch globale Kompaktierung Diplomarbeit, TU München, May 1990

    Google Scholar 

  11. B. Su, S. Ding, L. Jin: An Improvement of Trace Scheduling for Global Microcode Compaction ACM SIGMICRO 17th Annual Workshop, pp. 78–85, Oct. 1984

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Böckle, G., Störmann, C., Wildgruber, I. (1993). Methods for Exploitation of Fine-Grained Parallelism. In: Bode, A., Dal Cin, M. (eds) Parallel Computer Architectures. Lecture Notes in Computer Science, vol 732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21577-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21577-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57307-4

  • Online ISBN: 978-3-662-21577-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics