Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Languages and Compilers for Parallel Computing

LCPC 1999: Languages and Compilers for Parallel Computing pp 100–116Cite as

A Linear Algebra Formulation for Optimising Replication in Data Parallel Programs

  • Conference paper
  • First Online:

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

Abstract

In this paper, we present an efficient technique for optimising data replication under the data parallel programming model. We propose a precise mathematical representation for data replication which allows handling replication as an explicit, separate stage in the parallel data placement problem. This representation takes the form of an invertible mapping. We argue that this property is key to making data replication amenable to good mathematical optimisation algorithms. We further outline an algorithm for optimising data replication, based on this representation, which performs interprocedural data placement optimisation over a sequence of loop nests. We have implemented the algorithm and show performance figures.

While this work was carried out, Paul Kelly was a visiting research scientist at the Department of Computer Science and Engineering, University of California at San Diego, USA.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Barrett, M. Berry, T. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, USA, 1994.

    Google Scholar 

  2. O. Beckmann and P. H. J. Kelly. Efficient interprocedural data placement optimisation in a parallel library. In D. OrsHallaron, editor LCR98: Fourth International Workshop on Languages, Compilers and Run-time Systems for Scalable Computers, volume 1511 of LNCS, pages123–138. Springer-Verlag, May 1998.

    Chapter  Google Scholar 

  3. A. N. Burton and P. H. J. Kelly. Tracing and reexecuting operating system calls for reproducible performance experiments. Journal of Computers and Electrical Engineering—Special Issue on Performance Evaluation of High Performance Computing and Computers, 1999. To appear.

    Google Scholar 

  4. S. Chatterjee, J. R. Gilbert, and R. Schreiber. Mobile and replicated alignment of arrays in data-parallel programs. In Proceedings of Supercomputing’ 93, pages 420–429, Nov. 1993.

    Google Scholar 

  5. S. Chatterjee, J. R. Gilbert, R. Schreiber, and S.-H. Teng. Automatic array alignment in data-parallel programs. In Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, January 10–13,1992, pages16–28. ACM Press, 1993.

    Google Scholar 

  6. P. Feautrier. Toward automatic distribution. Parallel Processing Letters, 4(3):233–244, 1994.

    Article  Google Scholar 

  7. J. A. Green. Sets and Groups. Routledge & Kegan Paul, second edition, 1988.

    Google Scholar 

  8. C. H. Koelbel, D. B. Loveman, R. S. Schreiber, G. L. Steele Jr., and M. E. Zosel. The High Performance Fortran Handbook. MIT Press, Cambridge, MA, USA, Jan. 1994.

    Google Scholar 

  9. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing. Benjamin/Cummings, 1993.

    Google Scholar 

  10. C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh. Basic Linear Algebra Subprograms for Fortran usage. ACM Transactions on Mathematical Software, 5(3):308–323, Sept. 1979.

    Google Scholar 

  11. Z. Li. Array privatization for parallel execution of loops. In 1992 International Conference on Supercomputing, Washington, DC, pages 313–322. ACM Press, 1992.

    Google Scholar 

  12. L. Snyder. A Programmer’s Guide to ZPL. Department of Computer Science and Engineering, University of Washington, Seattle, WA 98195, Jan. 1999. Verion 6.3.

    Google Scholar 

  13. S. A. M. Talbot. Shared-Memory Multiprocessors with Stable Performance. PhD thesis, Department of Computing, Imperial College London, UK, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College, 180 Queen’s Gate, London, SW7 2BZ, UK

    Olav Beckmann & Paul H. J. Kelly

Authors
  1. Olav Beckmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul H. J. Kelly
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA, 92093-0114, USA

    Larry Carter  & Jeanne Ferrante  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beckmann, O., Kelly, P.H.J. (2000). A Linear Algebra Formulation for Optimising Replication in Data Parallel Programs. In: Carter, L., Ferrante, J. (eds) Languages and Compilers for Parallel Computing. LCPC 1999. Lecture Notes in Computer Science, vol 1863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44905-1_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44905-1_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67858-8

  • Online ISBN: 978-3-540-44905-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation