Skip to main content
SpringerLink
Log in

Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code

  • Conference paper
Book cover Applications of Graph Transformations with Industrial Relevance (AGTIVE 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5088))

  • 934 Accesses

Abstract

The Coconut code generator produces highly efficient assembly code, targeting signal processing applications such as Magnetic Resonance Imaging. It takes advantage of SIMD-parallelism, and captures as patterns assembly language “tricks” that produce very efficient, but highly convoluted code — the motivation is to beat the expert assembly tuner, while producing reliable output and maintainable input. On a growing set of benchmarks, it produces code with peak or near-peak efficiency.

To facilitate formal verification of the resulting code, the intermediate languages used in compilation are all variations on term hypergraphs (jungles) that we call “code graphs”. To verify the results of compilation, schedulable code graphs containing hyperedges labelled by instructions operating on vectors of components are transformed by replacing SIMD instructions with non-vector instructions, applying simplification rules, and comparing the result to specifications.

The authors thank CFI, OIT, NSERC and IBM Canada for financial support.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Anand, C.K., Kahl, W.: A Domain-Specific Language for the Generation of Optimized SIMD-Parallel Assembly Code. SQRL Report 43, McMaster University (2007), http://sqrl.mcmaster.ca/sqrl_reports.html

  2. Anand, C.K., Kahl, W.: MultiLoop: Efficient Software Pipelining for Modern Hardware. In: CASCON 2007: Proc. 2007 Conference of the Center for Advanced Studies on Collaborative Research, pp. 260–263. ACM, New York (2007)

    Chapter  Google Scholar 

  3. Corradini, A., Gadducci, F.: An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories. Applied Categorical Structures 7(4), 299–331 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Enenkel, R.: A Comprehensive Test Environment for Mathematical Functions. IBM Technical Report TR-74.200, IBM Corp. (2004)

    Google Scholar 

  5. Hoffmann, B., Plump, D.: Jungle Evaluation for Efficient Term Rewriting. In: Gabrowski, J., Lescanne, P., Wechler, W. (eds.) ALP 1988. Mathematical Research, vol. 49, pp. 191–203. Akademie-Verlag (1988)

    Google Scholar 

  6. Kahl, W.: A Relation-Algebraic Approach to Graph Structure Transformation. Habil. Thesis, Informatik, UniBw München, Techn. Ber. 2002-03 (2001)

    Google Scholar 

  7. Kahl, W., Anand, C.K., Carette, J.: Control-Flow Semantics for Assembly-Level Data-Flow Graphs. In: MacCaull, W., Winter, M., Düntsch, I. (eds.) RelMiCS 2005. LNCS, vol. 3929, pp. 147–160. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Leviathan, R., Pnueli, A.: Validating Software Pipelining Optimizations. In: Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2002, pp. 280–287. ACM, New York (2002)

    Google Scholar 

  9. IBM Corp. Synergistic Processor Unit Instruction Set Architecture. IBM Systems and Technology Group, Hopewell Junction, NY (2006)

    Google Scholar 

  10. Necula, G.C.: Translation validation for an optimizing compiler. In: Programming Language Design and Implementation (PLDI 2000), pp. 83–95. ACM, New York (2000)

    Google Scholar 

  11. Plump, D.: Term Graph Rewriting. In: Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation. Applications, Languages and Tools, ch. 1, vol. 2, pp. 3–61. World Scientific, Singapore (1999)

    Chapter  Google Scholar 

  12. Pnueli, A., Siegel, M., Singerman, E.: Translation Validation. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 151–166. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Püschel, M., Moura, J.M.F., et al.: SPIRAL: Code Generation for DSP Transforms. Proc. IEEE, Program Generation, Optimization, and Adaptation 93(2), 232–275 (2005) (special issue)

    Google Scholar 

  14. Schösser, A., Geiss, R.: Graph Rewriting for Hardware Dependent Program Optimisations. In: Schürr, A., Nagl, M., Zündorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088. Springer, Heidelberg (2007)

    Google Scholar 

  15. Sleep, M., Plasmeijer, M., van Eekelen, M. (eds.): Term Graph Rewriting: Theory and Practice. Wiley, Chichester (1993)

    MATH  Google Scholar 

  16. Ştefănescu, G.: Network Algebra. Springer, London (2000)

    MATH  Google Scholar 

  17. Thaller, W.: Explicitly Staged Software Pipelining. Master’s thesis, McMaster University, Department of Computing and Software (2006), http://sqrl.mcmaster.ca/~anand/papers/ThallerMScExSSP.pdf

  18. The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.4.10 (2007), http://www.gap-system.org/

  19. Tristan, J.B., Leroy, X.: Formal Verification of Translation Validators, A Case Study on Instruction Scheduling Optimizations. In: Principles of Programming Languages, POPL 2008, pp. 17–27. ACM, New York (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Quality Research Laboratory Department of Computing and Software, McMaster University, Canada

    Christopher Kumar Anand & Wolfram Kahl

Authors
  1. Christopher Kumar Anand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfram Kahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachgebiet Echtzeitsysteme, Technische Universität Darmstadt, D-64283, Darmstadt, Germany

    Andy Schürr

  2. Department of Computer Science, RWTH Aachen, Chair of Computer Science III, Aachen, Germany

    Manfred Nagl

  3. Software Engineering Research Group, Department of Computer Science and Electrical Engineering, University of Kassel, Kassel, Germany

    Albert Zündorf

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kumar Anand, C., Kahl, W. (2008). Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code. In: Schürr, A., Nagl, M., Zündorf, A. (eds) Applications of Graph Transformations with Industrial Relevance. AGTIVE 2007. Lecture Notes in Computer Science, vol 5088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89020-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89020-1_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89019-5

  • Online ISBN: 978-3-540-89020-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation