Skip to main content

Combining Fusion Optimizations and Piecewise Execution of Nested Data-Parallel Programs

  • Conference paper
  • First Online:
  • 877 Accesses

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

Abstract

Nested data-parallel programs often have large memory requirements due to their high degree of parallelism. Piecewise execution is an implementation technique used to minimize the space needed. In this paper, we present a combinination of piecewise execution and loop-fusion techniques. Both a formal framework and the execution model based on threads are presented. We give some experimental results, which demonstrate the good performance in memory consumption and execution time.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. E. Blelloch. NESL: A nested data-parallel language. Technical report, School of Computer Science, Carnegie Mellon University, 1995.

    Google Scholar 

  2. G. E. Blelloch and G. Sabot. Compiling collection-oriented languages onto massively parallel computers. Journal of Parallel and Distributed Computing, 8(2):119–134, 1990.

    Article  Google Scholar 

  3. G. Keller. Transformation-based Implementation of Nested Data Parallelism for Distributed Memory Machines. PhD thesis, Technische Universität Berlin, 1999.

    Google Scholar 

  4. G. Keller and M. M. T. Chakravarty. On the distributed implementation of aggregate data structures by program transformation. In HIPS’ 99. IEEE CS, 1999.

    Google Scholar 

  5. D. Palmer, J. Prins, S. Chatterjee, and R. Faith. Piecewise execution of nested data-parallel programs. In LCPC’ 95. Springer, 1996.

    Google Scholar 

  6. W. Pfannenstiel. Piecewise execution of nested parallel programs — a thread-based approach. In P. Amestoy, P. Berger, M. Daydé, I. Duff, V. Frayssé, L. Giraud, and D. Ruiz, editors, EuroPar’99, LNCS 1685, pages 445–449. Springer, 1999.

    Google Scholar 

  7. W. Pfannenstiel. Thread-based piecewise execution of nested data-parallel programs: Implementation and case studies. Technical Report 99-12, TU Berlin, 1999.

    Google Scholar 

  8. K. Taura and A. Yonezawa. Fine-grain multithreading with minimal compiler support-a cost effective approach to implementing efficient multithreading languages. In PLDI’ 97. ACM, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pfannenstiel, W. (2000). Combining Fusion Optimizations and Piecewise Execution of Nested Data-Parallel Programs. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-45591-4_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45591-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics